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.r168-tall-174881266900393.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 PolyORBNT-COL-S10J80, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266900393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 95K 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 1748902775185

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 22:19:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 22:19:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:19:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 22:19:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 22:19:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2025-06-02 22:19:37] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 22 ms.
[2025-06-02 22:19:37] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2025-06-02 22:19:37] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 5 ms.
RANDOM walk for 40008 steps (2281 resets) in 1138 ms. (35 steps per ms) remains 11/46 properties
BEST_FIRST walk for 6629 steps (137 resets) in 70 ms. (93 steps per ms) remains 0/11 properties
Able to resolve query StableMarking after proving 47 properties.
[2025-06-02 22:19:38] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 234 ms.
[2025-06-02 22:19:38] [INFO ] Unfolded 48 HLPN properties in 3 ms.
Deduced a syphon composed of 80 places in 36 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2237 resets) in 3022 ms. (13 steps per ms) remains 10/48 properties
BEST_FIRST walk for 40004 steps (420 resets) in 341 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (419 resets) in 301 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (420 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (415 resets) in 259 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (422 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (416 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (419 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (408 resets) in 213 ms. (186 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (415 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
[2025-06-02 22:19:39] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2025-06-02 22:19:40] [INFO ] Computed 192 invariants in 202 ms
[2025-06-02 22:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 586/591 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 164/755 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 810/1565 variables, 81/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 36/1601 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1601 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 11/1612 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1613 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1613 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3381/4994 variables, 1613/1805 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4994 variables, 1/1806 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4994 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/4995 variables, 1/1807 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4995 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/4995 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4995/4995 variables, and 1807 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2654 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1614/1614 constraints, ReadFeed: 1/1 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, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 586/591 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 164/755 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 810/1565 variables, 81/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 36/1601 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1601 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 11/1612 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1613 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1613 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3381/4994 variables, 1613/1805 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4994 variables, 1/1806 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4994 variables, 3/1809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4994 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 8031ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1604 transition count 3304
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 182 place count 1518 transition count 3304
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 182 place count 1518 transition count 3219
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 352 place count 1433 transition count 3219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 353 place count 1432 transition count 3218
Iterating global reduction 2 with 1 rules applied. Total rules applied 354 place count 1432 transition count 3218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 358 place count 1430 transition count 3216
Applied a total of 358 rules in 706 ms. Remains 1430 /1614 variables (removed 184) and now considering 3216/3390 (removed 174) transitions.
Running 3205 sub problems to find dead transitions.
[2025-06-02 22:19:48] [INFO ] Flow matrix only has 3207 transitions (discarded 9 similar events)
// Phase 1: matrix 3207 rows 1430 cols
[2025-06-02 22:19:48] [INFO ] Computed 182 invariants in 125 ms
[2025-06-02 22:19:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1420 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 3205 unsolved
SMT process timed out in 43380ms, After SMT, problems are : Problem set: 0 solved, 3205 unsolved
Search for dead transitions found 0 dead transitions in 43430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44174 ms. Remains : 1430/1614 places, 3216/3390 transitions.
RANDOM walk for 1423 steps (98 resets) in 52 ms. (26 steps per ms) remains 0/5 properties
Able to resolve query StableMarking after proving 48 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 55664 ms.
ITS solved all properties within timeout

BK_STOP 1748902832145

--------------------
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="PolyORBNT-COL-S10J80"
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 PolyORBNT-COL-S10J80, 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 r168-tall-174881266900393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;