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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 503K May 29 14:32 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 1749025661145

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 08:27:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-04 08:27:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:27:42] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-06-04 08:27:42] [INFO ] Transformed 1803 places.
[2025-06-04 08:27:42] [INFO ] Transformed 1773 transitions.
[2025-06-04 08:27:42] [INFO ] Found NUPN structural information;
[2025-06-04 08:27:42] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 326 ms.
Structural test allowed to assert that 812 places are NOT stable. Took 17 ms.
RANDOM walk for 40000 steps (8 resets) in 3068 ms. (13 steps per ms) remains 9/991 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
// Phase 1: matrix 1773 rows 1803 cols
[2025-06-04 08:27:44] [INFO ] Computed 271 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 150/159 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1644/1803 variables, 262/430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 1644/2074 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1803 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1773/3576 variables, 1803/3877 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3576 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/3576 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3576/3576 variables, and 3877 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2187 ms.
Refiners :[Domain max(s): 1803/1803 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 1803/1803 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 150/159 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1644/1803 variables, 262/430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 1644/2074 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 40 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 5 ms to minimize.
[2025-06-04 08:27:47] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 3 ms to minimize.
[2025-06-04 08:27:48] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2025-06-04 08:27:48] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2025-06-04 08:27:48] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2025-06-04 08:27:48] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2025-06-04 08:27:48] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2025-06-04 08:27:48] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2025-06-04 08:27:49] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2025-06-04 08:27:49] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2025-06-04 08:27:49] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2025-06-04 08:27:49] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2025-06-04 08:27:49] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 3 ms to minimize.
[2025-06-04 08:27:49] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 3 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1803 variables, 20/2094 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2025-06-04 08:27:50] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2025-06-04 08:27:51] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-04 08:27:51] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2025-06-04 08:27:51] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2025-06-04 08:27:51] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1803/3576 variables, and 2102 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5013 ms.
Refiners :[Domain max(s): 1803/1803 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/1803 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 28/28 constraints]
After SMT, in 7303ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1803 transition count 1622
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1652 transition count 1622
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1652 transition count 1471
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1501 transition count 1471
Discarding 201 places :
Symmetric choice reduction at 2 with 201 rule applications. Total rules 805 place count 1300 transition count 1270
Iterating global reduction 2 with 201 rules applied. Total rules applied 1006 place count 1300 transition count 1270
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 1006 place count 1300 transition count 1180
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1186 place count 1210 transition count 1180
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 3 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 2086 place count 760 transition count 730
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 208 times.
Drop transitions (Partial Free agglomeration) removed 208 transitions
Iterating global reduction 2 with 208 rules applied. Total rules applied 2294 place count 760 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2295 place count 759 transition count 729
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2296 place count 758 transition count 729
Applied a total of 2296 rules in 533 ms. Remains 758 /1803 variables (removed 1045) and now considering 729/1773 (removed 1044) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 758/1803 places, 729/1773 transitions.
RANDOM walk for 11341 steps (0 resets) in 222 ms. (50 steps per ms) remains 0/9 properties
Able to resolve query StableMarking after proving 992 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 9795 ms.
ITS solved all properties within timeout

BK_STOP 1749025672260

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-030B"
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 ShieldIIPs-PT-030B, 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 r210-tall-174894547200233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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