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.r098-smll-174860112400258.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 FlexibleBarrier-PT-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112400258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.6K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 69K 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 1748687266827

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 10:27:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 10:27:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 10:27:49] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2025-05-31 10:27:49] [INFO ] Transformed 268 places.
[2025-05-31 10:27:49] [INFO ] Transformed 305 transitions.
[2025-05-31 10:27:49] [INFO ] Found NUPN structural information;
[2025-05-31 10:27:49] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 413 ms.
Graph (trivial) has 254 edges and 268 vertex of which 26 / 268 are part of one of the 4 SCC in 8 ms
Free SCC test removed 22 places
Structural test allowed to assert that 90 places are NOT stable. Took 47 ms.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
RANDOM walk for 40000 steps (1165 resets) in 3601 ms. (11 steps per ms) remains 25/178 properties
BEST_FIRST walk for 4002 steps (22 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (21 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (21 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (22 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (22 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (20 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (21 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (20 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (20 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (22 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
[2025-05-31 10:27:51] [INFO ] Flow matrix only has 279 transitions (discarded 3 similar events)
// Phase 1: matrix 279 rows 246 cols
[2025-05-31 10:27:51] [INFO ] Computed 6 invariants in 26 ms
[2025-05-31 10:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 225/246 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 225/252 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 278/524 variables, 246/498 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/525 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/525 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 499 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1879 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 225/246 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 225/252 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-05-31 10:27:53] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 58 ms to minimize.
[2025-05-31 10:27:54] [INFO ] Deduced a trap composed of 72 places in 230 ms of which 5 ms to minimize.
[2025-05-31 10:27:54] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 5 ms to minimize.
[2025-05-31 10:27:54] [INFO ] Deduced a trap composed of 91 places in 195 ms of which 4 ms to minimize.
[2025-05-31 10:27:54] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 4 ms to minimize.
[2025-05-31 10:27:55] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 5 ms to minimize.
[2025-05-31 10:27:55] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 5 ms to minimize.
[2025-05-31 10:27:55] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 5 ms to minimize.
[2025-05-31 10:27:55] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 4 ms to minimize.
[2025-05-31 10:27:56] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 5 ms to minimize.
[2025-05-31 10:27:56] [INFO ] Deduced a trap composed of 81 places in 213 ms of which 4 ms to minimize.
[2025-05-31 10:27:56] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 4 ms to minimize.
[2025-05-31 10:27:56] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 13/265 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-05-31 10:27:57] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2025-05-31 10:27:57] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2025-05-31 10:27:57] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2025-05-31 10:27:57] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2025-05-31 10:27:57] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2025-05-31 10:27:57] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 278/524 variables, 246/517 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 21/538 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/525 variables, and 538 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5012 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 246/246 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 19/19 constraints]
After SMT, in 6988ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 282/282 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 246 transition count 206
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 174 transition count 206
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 148 place count 174 transition count 196
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 164 transition count 196
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 232 place count 100 transition count 132
Iterating global reduction 2 with 64 rules applied. Total rules applied 296 place count 100 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 296 place count 100 transition count 128
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 304 place count 96 transition count 128
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 307 place count 96 transition count 125
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 315 place count 88 transition count 117
Iterating global reduction 3 with 8 rules applied. Total rules applied 323 place count 88 transition count 117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 331 place count 88 transition count 109
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 363 place count 72 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 368 place count 72 transition count 88
Free-agglomeration rule applied 28 times.
Iterating global reduction 5 with 28 rules applied. Total rules applied 396 place count 72 transition count 60
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 433 place count 44 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 434 place count 44 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 43 transition count 50
Applied a total of 435 rules in 109 ms. Remains 43 /246 variables (removed 203) and now considering 50/282 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 43/246 places, 50/282 transitions.
RANDOM walk for 987 steps (0 resets) in 12 ms. (75 steps per ms) remains 0/21 properties
Able to resolve query StableMarking after proving 180 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 9093 ms.
ITS solved all properties within timeout

BK_STOP 1748687278609

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r098-smll-174860112400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 ;