Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110300390.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Echo-PT-d02r15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.2K Apr 29 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 29 11:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 29 11:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 29 11:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 208K Apr 29 11:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 11:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 917K May 10 09:33 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 Echo-PT-d02r15-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654190106862

Running Version 202205111006
[2022-06-02 17:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 17:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 17:15:08] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2022-06-02 17:15:08] [INFO ] Transformed 2127 places.
[2022-06-02 17:15:08] [INFO ] Transformed 1674 transitions.
[2022-06-02 17:15:08] [INFO ] Found NUPN structural information;
[2022-06-02 17:15:08] [INFO ] Parsed PT model containing 2127 places and 1674 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r15-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 703 ms. (steps per millisecond=14 ) properties (out of 15) seen :10
FORMULA Echo-PT-d02r15-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1674 rows 2127 cols
[2022-06-02 17:15:09] [INFO ] Computed 1065 place invariants in 216 ms
[2022-06-02 17:15:10] [INFO ] After 716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-02 17:15:11] [INFO ] [Nat]Absence check using 82 positive place invariants in 27 ms returned sat
[2022-06-02 17:15:11] [INFO ] [Nat]Absence check using 82 positive and 983 generalized place invariants in 347 ms returned sat
[2022-06-02 17:15:12] [INFO ] After 1260ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-06-02 17:15:13] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 21 ms to minimize.
[2022-06-02 17:15:14] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 3 ms to minimize.
[2022-06-02 17:15:14] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 1 ms to minimize.
[2022-06-02 17:15:15] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 3 ms to minimize.
[2022-06-02 17:15:15] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 2 ms to minimize.
[2022-06-02 17:15:16] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 1 ms to minimize.
[2022-06-02 17:15:16] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 1 ms to minimize.
[2022-06-02 17:15:17] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 1 ms to minimize.
[2022-06-02 17:15:17] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 1 ms to minimize.
[2022-06-02 17:15:17] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 1 ms to minimize.
[2022-06-02 17:15:18] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 1 ms to minimize.
[2022-06-02 17:15:18] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 1 ms to minimize.
[2022-06-02 17:15:19] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 1 ms to minimize.
[2022-06-02 17:15:19] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 1 ms to minimize.
[2022-06-02 17:15:20] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 1 ms to minimize.
[2022-06-02 17:15:20] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 1 ms to minimize.
[2022-06-02 17:15:20] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2022-06-02 17:15:21] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 1 ms to minimize.
[2022-06-02 17:15:21] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 0 ms to minimize.
[2022-06-02 17:15:22] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 1 ms to minimize.
[2022-06-02 17:15:22] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2022-06-02 17:15:23] [INFO ] Deduced a trap composed of 11 places in 366 ms of which 1 ms to minimize.
[2022-06-02 17:15:23] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2022-06-02 17:15:24] [INFO ] Deduced a trap composed of 15 places in 366 ms of which 1 ms to minimize.
[2022-06-02 17:15:24] [INFO ] Deduced a trap composed of 13 places in 353 ms of which 1 ms to minimize.
[2022-06-02 17:15:25] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2022-06-02 17:15:25] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2022-06-02 17:15:25] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 1 ms to minimize.
[2022-06-02 17:15:26] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 0 ms to minimize.
[2022-06-02 17:15:26] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2022-06-02 17:15:27] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 1 ms to minimize.
[2022-06-02 17:15:27] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 1 ms to minimize.
[2022-06-02 17:15:28] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 1 ms to minimize.
[2022-06-02 17:15:28] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 5 ms to minimize.
[2022-06-02 17:15:29] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2022-06-02 17:15:29] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2022-06-02 17:15:30] [INFO ] Deduced a trap composed of 13 places in 342 ms of which 1 ms to minimize.
[2022-06-02 17:15:30] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 0 ms to minimize.
[2022-06-02 17:15:31] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 0 ms to minimize.
[2022-06-02 17:15:31] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 1 ms to minimize.
[2022-06-02 17:15:32] [INFO ] Deduced a trap composed of 17 places in 367 ms of which 1 ms to minimize.
[2022-06-02 17:15:32] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 1 ms to minimize.
[2022-06-02 17:15:33] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 1 ms to minimize.
[2022-06-02 17:15:33] [INFO ] Deduced a trap composed of 13 places in 338 ms of which 1 ms to minimize.
[2022-06-02 17:15:33] [INFO ] Deduced a trap composed of 16 places in 333 ms of which 1 ms to minimize.
[2022-06-02 17:15:34] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 1 ms to minimize.
[2022-06-02 17:15:34] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 1 ms to minimize.
[2022-06-02 17:15:35] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 0 ms to minimize.
[2022-06-02 17:15:35] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 1 ms to minimize.
[2022-06-02 17:15:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 17:15:35] [INFO ] After 25222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA Echo-PT-d02r15-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d02r15-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d02r15-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 16472 steps, including 911 resets, run visited all 2 properties in 198 ms. (steps per millisecond=83 )
FORMULA Echo-PT-d02r15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 200 ms.
All properties solved without resorting to model-checking.
Total runtime 28058 ms.

BK_STOP 1654190136124

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Echo-PT-d02r15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Echo-PT-d02r15, 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 r078-tall-165260110300390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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