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.r364-tall-171683777100068.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 ShieldIIPs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777100068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 332K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716910280213

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 15:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-28 15:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:31:21] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-28 15:31:21] [INFO ] Transformed 1203 places.
[2024-05-28 15:31:21] [INFO ] Transformed 1183 transitions.
[2024-05-28 15:31:21] [INFO ] Found NUPN structural information;
[2024-05-28 15:31:21] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 265 ms.
Structural test allowed to assert that 542 places are NOT stable. Took 12 ms.
RANDOM walk for 40000 steps (15 resets) in 2192 ms. (18 steps per ms) remains 1/661 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
// Phase 1: matrix 1183 rows 1203 cols
[2024-05-28 15:31:22] [INFO ] Computed 181 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 29/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1173/1203 variables, 180/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 1173/1384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1183/2386 variables, 1203/2587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2386 variables, 0/2587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2386 variables, 0/2587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2386/2386 variables, and 2587 constraints, problems are : Problem set: 0 solved, 1 unsolved in 960 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1203/1203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 29/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1173/1203 variables, 180/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 1173/1384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:31:24] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 39 ms to minimize.
[2024-05-28 15:31:24] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 5 ms to minimize.
[2024-05-28 15:31:24] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 5 ms to minimize.
[2024-05-28 15:31:24] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 4 ms to minimize.
[2024-05-28 15:31:25] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 5 ms to minimize.
[2024-05-28 15:31:25] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 4 ms to minimize.
[2024-05-28 15:31:25] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 4 ms to minimize.
[2024-05-28 15:31:25] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 4 ms to minimize.
[2024-05-28 15:31:26] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:31:26] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 4 ms to minimize.
[2024-05-28 15:31:26] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 4 ms to minimize.
[2024-05-28 15:31:26] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2024-05-28 15:31:26] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 4 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 4 ms to minimize.
[2024-05-28 15:31:27] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-05-28 15:31:28] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 20/1404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:31:28] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:31:28] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:31:28] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
SMT process timed out in 6137ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1203 transition count 1082
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 1102 transition count 1082
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 1102 transition count 981
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 1001 transition count 981
Discarding 139 places :
Symmetric choice reduction at 2 with 139 rule applications. Total rules 543 place count 862 transition count 842
Iterating global reduction 2 with 139 rules applied. Total rules applied 682 place count 862 transition count 842
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 682 place count 862 transition count 782
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 802 place count 802 transition count 782
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 2 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1402 place count 502 transition count 482
Partial Free-agglomeration rule applied 138 times.
Drop transitions (Partial Free agglomeration) removed 138 transitions
Iterating global reduction 2 with 138 rules applied. Total rules applied 1540 place count 502 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1541 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1542 place count 500 transition count 481
Applied a total of 1542 rules in 404 ms. Remains 500 /1203 variables (removed 703) and now considering 481/1183 (removed 702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 500/1203 places, 481/1183 transitions.
RANDOM walk for 337794 steps (1 resets) in 1667 ms. (202 steps per ms) remains 0/1 properties
Able to resolve query StableMarking after proving 662 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 9213 ms.
ITS solved all properties within timeout

BK_STOP 1716910290574

--------------------
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 StableMarking -timeout 180 -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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldIIPs-PT-020B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r364-tall-171683777100068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;