Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902009500068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ShieldRVs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 244K May 29 14: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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1749106392126

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:53:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-05 06:53:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:53:13] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-05 06:53:13] [INFO ] Transformed 803 places.
[2025-06-05 06:53:13] [INFO ] Transformed 903 transitions.
[2025-06-05 06:53:13] [INFO ] Found NUPN structural information;
[2025-06-05 06:53:13] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 235 ms.
Structural test allowed to assert that 381 places are NOT stable. Took 11 ms.
RANDOM walk for 40000 steps (44 resets) in 2146 ms. (18 steps per ms) remains 5/422 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
// Phase 1: matrix 903 rows 803 cols
[2025-06-05 06:53:14] [INFO ] Computed 81 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 74/79 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 724/803 variables, 76/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 724/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 903/1706 variables, 803/1687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 1687 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1065 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 803/803 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 74/79 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 724/803 variables, 76/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 724/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-05 06:53:16] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 33 ms to minimize.
[2025-06-05 06:53:16] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 4 ms to minimize.
[2025-06-05 06:53:16] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 7 ms to minimize.
[2025-06-05 06:53:16] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 3 ms to minimize.
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 4 ms to minimize.
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 4 ms to minimize.
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 4 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 4 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 4 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 3 ms to minimize.
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 20/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 7 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 6223ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 803 transition count 822
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 722 transition count 822
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 722 transition count 722
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 622 transition count 722
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 497 place count 487 transition count 587
Iterating global reduction 2 with 135 rules applied. Total rules applied 632 place count 487 transition count 587
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 632 place count 487 transition count 527
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 752 place count 427 transition count 527
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 1032 place count 287 transition count 387
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 1074 place count 287 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1075 place count 286 transition count 386
Applied a total of 1075 rules in 180 ms. Remains 286 /803 variables (removed 517) and now considering 386/903 (removed 517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 286/803 places, 386/903 transitions.
RANDOM walk for 12756 steps (49 resets) in 288 ms. (44 steps per ms) remains 0/5 properties
Able to resolve query StableMarking after proving 423 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 7781 ms.
ITS solved all properties within timeout

BK_STOP 1749106401216

--------------------
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="ShieldRVs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldRVs-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 r224-tall-174902009500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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