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.r528-tall-171683761900830.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 ltsminxred
Input is ShieldRVs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761900830
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 370K 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 ShieldRVs-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717268329160

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:58:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 18:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:58:50] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-01 18:58:50] [INFO ] Transformed 1203 places.
[2024-06-01 18:58:50] [INFO ] Transformed 1353 transitions.
[2024-06-01 18:58:50] [INFO ] Found NUPN structural information;
[2024-06-01 18:58:50] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (28 resets) in 1579 ms. (25 steps per ms) remains 3/11 properties
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 413 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
// Phase 1: matrix 1353 rows 1203 cols
[2024-06-01 18:58:51] [INFO ] Computed 121 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 968/1050 variables, 104/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1050 variables, 968/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 153/1203 variables, 17/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 153/1324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1353/2556 variables, 1203/2527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2556/2556 variables, and 2527 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1422 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1203/1203 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 968/1050 variables, 104/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1050 variables, 968/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 18:58:53] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 46 ms to minimize.
[2024-06-01 18:58:53] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 5 ms to minimize.
[2024-06-01 18:58:54] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 5 ms to minimize.
[2024-06-01 18:58:54] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 4 ms to minimize.
[2024-06-01 18:58:54] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 5 ms to minimize.
[2024-06-01 18:58:54] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 5 ms to minimize.
[2024-06-01 18:58:55] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 4 ms to minimize.
[2024-06-01 18:58:55] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 4 ms to minimize.
[2024-06-01 18:58:55] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 5 ms to minimize.
[2024-06-01 18:58:55] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 5 ms to minimize.
[2024-06-01 18:58:56] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 4 ms to minimize.
[2024-06-01 18:58:56] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2024-06-01 18:58:56] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 4 ms to minimize.
[2024-06-01 18:58:56] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 5 ms to minimize.
[2024-06-01 18:58:57] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-06-01 18:58:57] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 4 ms to minimize.
[2024-06-01 18:58:57] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 4 ms to minimize.
[2024-06-01 18:58:57] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 4 ms to minimize.
SMT process timed out in 6586ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1203 transition count 1254
Reduce places removed 99 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 104 rules applied. Total rules applied 203 place count 1104 transition count 1249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 208 place count 1099 transition count 1249
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 208 place count 1099 transition count 1114
Deduced a syphon composed of 135 places in 3 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 478 place count 964 transition count 1114
Discarding 171 places :
Symmetric choice reduction at 3 with 171 rule applications. Total rules 649 place count 793 transition count 943
Iterating global reduction 3 with 171 rules applied. Total rules applied 820 place count 793 transition count 943
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 820 place count 793 transition count 882
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 942 place count 732 transition count 882
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1344 place count 531 transition count 681
Partial Free-agglomeration rule applied 55 times.
Drop transitions (Partial Free agglomeration) removed 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 1399 place count 531 transition count 681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1400 place count 530 transition count 680
Applied a total of 1400 rules in 338 ms. Remains 530 /1203 variables (removed 673) and now considering 680/1353 (removed 673) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 530/1203 places, 680/1353 transitions.
RANDOM walk for 30299 steps (57 resets) in 520 ms. (58 steps per ms) remains 0/3 properties
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8245 ms.
ITS solved all properties within timeout

BK_STOP 1717268338594

--------------------
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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-030B, 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 r528-tall-171683761900830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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