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.r408-tall-171690546600248.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 StigmergyElection-PT-11a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-tall-171690546600248
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 153M 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 1717104028976

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:20:35] [INFO ] Load time of PNML (sax parser for PT used): 5412 ms
[2024-05-30 21:20:35] [INFO ] Transformed 156 places.
[2024-05-30 21:20:36] [INFO ] Transformed 136650 transitions.
[2024-05-30 21:20:36] [INFO ] Found NUPN structural information;
[2024-05-30 21:20:36] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 6379 ms.
Structural test allowed to assert that 24 places are NOT stable. Took 99 ms.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
RANDOM walk for 40000 steps (10 resets) in 13261 ms. (3 steps per ms) remains 31/132 properties
BEST_FIRST walk for 4004 steps (0 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 56 ms. (70 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (0 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
[2024-05-30 21:20:41] [INFO ] Flow matrix only has 4272 transitions (discarded 33 similar events)
// Phase 1: matrix 4272 rows 156 cols
[2024-05-30 21:20:41] [INFO ] Computed 12 invariants in 60 ms
[2024-05-30 21:20:42] [INFO ] State equation strengthened by 4148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 96/127 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 96/136 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 29/156 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 29/168 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 4271/4427 variables, 156/324 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4427 variables, 4147/4471 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4427 variables, 0/4471 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 1/4428 variables, 1/4472 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4428/4428 variables, and 4472 constraints, problems are : Problem set: 0 solved, 31 unsolved in 5057 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 156/156 constraints, ReadFeed: 4148/4148 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 96/127 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 96/136 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-30 21:20:49] [INFO ] Deduced a trap composed of 12 places in 1129 ms of which 14 ms to minimize.
[2024-05-30 21:20:50] [INFO ] Deduced a trap composed of 14 places in 945 ms of which 3 ms to minimize.
[2024-05-30 21:20:51] [INFO ] Deduced a trap composed of 12 places in 879 ms of which 2 ms to minimize.
[2024-05-30 21:20:52] [INFO ] Deduced a trap composed of 12 places in 955 ms of which 2 ms to minimize.
[2024-05-30 21:20:52] [INFO ] Deduced a trap composed of 13 places in 833 ms of which 1 ms to minimize.
[2024-05-30 21:20:53] [INFO ] Deduced a trap composed of 12 places in 671 ms of which 1 ms to minimize.
SMT process timed out in 11741ms, After SMT, problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Graph (complete) has 584 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.33 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 153 transition count 4246
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 131 transition count 4213
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 123 place count 120 transition count 4213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 123 place count 120 transition count 4200
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 149 place count 107 transition count 4200
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 163 place count 93 transition count 4186
Iterating global reduction 3 with 14 rules applied. Total rules applied 177 place count 93 transition count 4186
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 191 place count 79 transition count 4172
Iterating global reduction 3 with 14 rules applied. Total rules applied 205 place count 79 transition count 4172
Ensure Unique test removed 2049 transitions
Reduce isomorphic transitions removed 2049 transitions.
Iterating post reduction 3 with 2049 rules applied. Total rules applied 2254 place count 79 transition count 2123
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2276 place count 68 transition count 2112
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2287 place count 57 transition count 2101
Iterating global reduction 4 with 11 rules applied. Total rules applied 2298 place count 57 transition count 2101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2299 place count 57 transition count 2100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2300 place count 57 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2301 place count 56 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2302 place count 55 transition count 2099
Performed 11 Post agglomeration using F-continuation condition with reduction of 2035 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 2326 place count 42 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2337 place count 42 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2338 place count 42 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2339 place count 42 transition count 41
Applied a total of 2339 rules in 2249 ms. Remains 42 /156 variables (removed 114) and now considering 41/4305 (removed 4264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2266 ms. Remains : 42/156 places, 41/4305 transitions.
RANDOM walk for 1476 steps (227 resets) in 12 ms. (113 steps per ms) remains 0/31 properties
Able to resolve query StableMarking after proving 133 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 25742 ms.
ITS solved all properties within timeout

BK_STOP 1717104055963

--------------------
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="StigmergyElection-PT-11a"
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 StigmergyElection-PT-11a, 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 r408-tall-171690546600248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-11a.tgz
mv StigmergyElection-PT-11a 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 ;