About the Execution of GreatSPN+red for ShieldRVs-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
396.212 | 9322.00 | 20288.00 | 88.70 | FFFFFTTTFTFFTFFF | 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.r355-tall-171683759600830.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 ShieldRVs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759600830
=====================================================================
--------------------
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 1717055327178
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:48:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 07:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:48:48] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-30 07:48:48] [INFO ] Transformed 1203 places.
[2024-05-30 07:48:48] [INFO ] Transformed 1353 transitions.
[2024-05-30 07:48:48] [INFO ] Found NUPN structural information;
[2024-05-30 07:48:48] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 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 1534 ms. (26 steps per ms) remains 2/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-03 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 309 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
// Phase 1: matrix 1353 rows 1203 cols
[2024-05-30 07:48:49] [INFO ] Computed 121 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 936/982 variables, 97/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 936/1079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 221/1203 variables, 24/1103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 221/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1353/2556 variables, 1203/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2556/2556 variables, and 2527 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1105 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1203/1203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 936/982 variables, 97/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 936/1079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:48:51] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 46 ms to minimize.
[2024-05-30 07:48:51] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 4 ms to minimize.
[2024-05-30 07:48:51] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 8 ms to minimize.
[2024-05-30 07:48:52] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-05-30 07:48:52] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 4 ms to minimize.
[2024-05-30 07:48:52] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 4 ms to minimize.
[2024-05-30 07:48:52] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 4 ms to minimize.
[2024-05-30 07:48:52] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 4 ms to minimize.
[2024-05-30 07:48:53] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 4 ms to minimize.
[2024-05-30 07:48:53] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 4 ms to minimize.
[2024-05-30 07:48:53] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 4 ms to minimize.
[2024-05-30 07:48:53] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 4 ms to minimize.
[2024-05-30 07:48:54] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 4 ms to minimize.
[2024-05-30 07:48:54] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 4 ms to minimize.
[2024-05-30 07:48:54] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-30 07:48:54] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-30 07:48:54] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-05-30 07:48:54] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-30 07:48:55] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-05-30 07:48:55] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 20/1099 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:48:55] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 4 ms to minimize.
[2024-05-30 07:48:55] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 4 ms to minimize.
[2024-05-30 07:48:55] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 4 ms to minimize.
[2024-05-30 07:48:55] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 4 ms to minimize.
SMT process timed out in 6408ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 1203 transition count 1243
Reduce places removed 110 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 112 rules applied. Total rules applied 222 place count 1093 transition count 1241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 1091 transition count 1241
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 224 place count 1091 transition count 1100
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 506 place count 950 transition count 1100
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 693 place count 763 transition count 913
Iterating global reduction 3 with 187 rules applied. Total rules applied 880 place count 763 transition count 913
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 880 place count 763 transition count 842
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 1022 place count 692 transition count 842
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Deduced a syphon composed of 211 places in 2 ms
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 3 with 422 rules applied. Total rules applied 1444 place count 481 transition count 631
Partial Free-agglomeration rule applied 58 times.
Drop transitions (Partial Free agglomeration) removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1502 place count 481 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1503 place count 480 transition count 630
Applied a total of 1503 rules in 348 ms. Remains 480 /1203 variables (removed 723) and now considering 630/1353 (removed 723) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 480/1203 places, 630/1353 transitions.
RANDOM walk for 35084 steps (77 resets) in 468 ms. (74 steps per ms) remains 0/2 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
All properties solved without resorting to model-checking.
Total runtime 8061 ms.
ITS solved all properties within timeout
BK_STOP 1717055336500
--------------------
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="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 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 r355-tall-171683759600830"
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 '
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 ;