About the Execution of GreatSPN+red for LeafsetExtension-PT-S16C2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
388.947 | 8594.00 | 19223.00 | 90.80 | TFTFFTTTTTFFTTTT | 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.r223-tall-171649611200343.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 LeafsetExtension-PT-S16C2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611200343
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 13:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 905K 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 LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716542155068
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 09:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 09:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:15:56] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-24 09:15:56] [INFO ] Transformed 1542 places.
[2024-05-24 09:15:56] [INFO ] Transformed 1449 transitions.
[2024-05-24 09:15:56] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2178 resets) in 1580 ms. (25 steps per ms) remains 7/16 properties
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (177 resets) in 324 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (176 resets) in 630 ms. (63 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (304 resets) in 337 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (322 resets) in 477 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (328 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (304 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (176 resets) in 126 ms. (314 steps per ms) remains 6/7 properties
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1449 rows 1542 cols
[2024-05-24 09:15:57] [INFO ] Computed 93 invariants in 84 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/101 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-06 is UNSAT
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1361/1462 variables, 50/60 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-24 09:15:59] [INFO ] Deduced a trap composed of 85 places in 824 ms of which 78 ms to minimize.
[2024-05-24 09:16:00] [INFO ] Deduced a trap composed of 85 places in 828 ms of which 10 ms to minimize.
[2024-05-24 09:16:00] [INFO ] Deduced a trap composed of 85 places in 648 ms of which 9 ms to minimize.
[2024-05-24 09:16:01] [INFO ] Deduced a trap composed of 85 places in 703 ms of which 11 ms to minimize.
[2024-05-24 09:16:02] [INFO ] Deduced a trap composed of 103 places in 667 ms of which 10 ms to minimize.
[2024-05-24 09:16:03] [INFO ] Deduced a trap composed of 94 places in 677 ms of which 9 ms to minimize.
SMT process timed out in 5394ms, After SMT, problems are : Problem set: 4 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 293 are kept as prefixes of interest. Removing 1249 places using SCC suffix rule.5 ms
Discarding 1249 places :
Also discarding 719 output transitions
Drop transitions (Output transitions of discarded places.) removed 719 transitions
Drop transitions (Empty/Sink Transition effects.) removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 293 transition count 471
Reduce places removed 51 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 313 place count 242 transition count 469
Reduce places removed 2 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 12 rules applied. Total rules applied 325 place count 240 transition count 459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 335 place count 230 transition count 459
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 335 place count 230 transition count 452
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 349 place count 223 transition count 452
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 407 place count 165 transition count 394
Iterating global reduction 4 with 58 rules applied. Total rules applied 465 place count 165 transition count 394
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 469 place count 165 transition count 390
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 473 place count 161 transition count 390
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 490 place count 161 transition count 390
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 491 place count 160 transition count 390
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 492 place count 160 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 493 place count 159 transition count 389
Applied a total of 493 rules in 109 ms. Remains 159 /1542 variables (removed 1383) and now considering 389/1449 (removed 1060) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 159/1542 places, 389/1449 transitions.
RANDOM walk for 40001 steps (4693 resets) in 765 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (581 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (580 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2461 steps, run visited all 2 properties in 47 ms. (steps per millisecond=52 )
Probabilistic random walk after 2461 steps, saw 871 distinct states, run finished after 55 ms. (steps per millisecond=44 ) properties seen :2
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA LeafsetExtension-PT-S16C2-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7419 ms.
ITS solved all properties within timeout
BK_STOP 1716542163662
--------------------
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 ReachabilityFireability -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="LeafsetExtension-PT-S16C2"
export BK_EXAMINATION="ReachabilityFireability"
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 LeafsetExtension-PT-S16C2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611200343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S16C2.tgz
mv LeafsetExtension-PT-S16C2 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;