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.r157-smll-171636265400293.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 FMS-PT-00010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265400293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 22:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 22:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 11 22:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FMS-PT-00010-UpperBounds-00
FORMULA_NAME FMS-PT-00010-UpperBounds-01
FORMULA_NAME FMS-PT-00010-UpperBounds-02
FORMULA_NAME FMS-PT-00010-UpperBounds-03
FORMULA_NAME FMS-PT-00010-UpperBounds-04
FORMULA_NAME FMS-PT-00010-UpperBounds-05
FORMULA_NAME FMS-PT-00010-UpperBounds-06
FORMULA_NAME FMS-PT-00010-UpperBounds-07
FORMULA_NAME FMS-PT-00010-UpperBounds-08
FORMULA_NAME FMS-PT-00010-UpperBounds-09
FORMULA_NAME FMS-PT-00010-UpperBounds-10
FORMULA_NAME FMS-PT-00010-UpperBounds-11
FORMULA_NAME FMS-PT-00010-UpperBounds-12
FORMULA_NAME FMS-PT-00010-UpperBounds-13
FORMULA_NAME FMS-PT-00010-UpperBounds-14
FORMULA_NAME FMS-PT-00010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716556393006

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 13:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 13:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:13:15] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-24 13:13:15] [INFO ] Transformed 22 places.
[2024-05-24 13:13:15] [INFO ] Transformed 20 transitions.
[2024-05-24 13:13:15] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 10, 0, 10, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 10, 0, 10, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 13:13:15] [INFO ] Computed 6 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 10, 0, 10, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[10, 10, 3, 10, 10, 10, 10, 10, 10, 10, 10, 3, 10, 10, 1, 10]
FORMULA FMS-PT-00010-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10009 steps (2 resets) in 50 ms. (196 steps per ms)
FORMULA FMS-PT-00010-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 103 ms. (480 steps per ms)
FORMULA FMS-PT-00010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 4, 3] Max Struct:[10, 10, 10, 10]
[2024-05-24 13:13:16] [INFO ] Invariant cache hit.
[2024-05-24 13:13:16] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-05-24 13:13:16] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-24 13:13:16] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 13:13:16] [INFO ] Added : 9 causal constraints over 2 iterations in 73 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 13:13:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:13:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 13:13:16] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 13:13:16] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 13:13:16] [INFO ] Added : 9 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2024-05-24 13:13:16] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 13:13:16] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 13:13:16] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 13:13:16] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 10 ms.
[2024-05-24 13:13:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:13:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 13:13:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 13:13:16] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 13:13:16] [INFO ] Added : 7 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 13:13:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 13:13:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 13:13:16] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 13:13:17] [INFO ] Added : 4 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2024-05-24 13:13:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:13:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 13:13:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 13:13:17] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 13:13:17] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2024-05-24 13:13:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 13:13:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 13:13:17] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 13:13:17] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2024-05-24 13:13:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:13:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 13:13:17] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 13:13:17] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 13:13:17] [INFO ] Added : 5 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 4, 3] Max Struct:[10, 10, 10, 10]
FORMULA FMS-PT-00010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FMS-PT-00010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FMS-PT-00010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[10]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 29 edges and 22 vertex of which 19 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 19 transition count 13
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 8 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 23 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 6 transition count 5
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 24 place count 6 transition count 2
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 31 place count 2 transition count 2
Applied a total of 31 rules in 84 ms. Remains 2 /22 variables (removed 20) and now considering 2/20 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 2/22 places, 2/20 transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 13:13:17] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[10]
FORMULA FMS-PT-00010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000002 steps (2 resets) in 292 ms. (3412 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 2687 ms.
ITS solved all properties within timeout

BK_STOP 1716556398161

--------------------
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 UpperBounds -timeout 360 -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="FMS-PT-00010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 FMS-PT-00010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265400293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00010.tgz
mv FMS-PT-00010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;