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.r069-tall-171620504100261.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 CSRepetitions-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504100261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 136K Apr 12 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 12 09:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 574K Apr 12 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 491K Apr 12 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Apr 12 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 392K Apr 12 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 424K 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 CSRepetitions-PT-07-UpperBounds-00
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-01
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-02
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-03
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-04
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-05
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-06
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-07
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-08
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-09
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-10
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-11
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-12
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-13
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-14
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716423029239

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 00:10:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 00:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:10:30] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-23 00:10:30] [INFO ] Transformed 498 places.
[2024-05-23 00:10:30] [INFO ] Transformed 833 transitions.
[2024-05-23 00:10:30] [INFO ] Parsed PT model containing 498 places and 833 transitions and 3087 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[7, 0, 0, 49, 0, 1, 1, 1, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[7, 0, 0, 49, 0, 1, 1, 1, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 833 rows 498 cols
[2024-05-23 00:10:30] [INFO ] Computed 56 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 0, 0, 49, 0, 1, 1, 1, 0, 1, 0] Max Struct:[+inf, +inf, 49, 49, 343, 1, 1, 1, +inf, 1, +inf]
FORMULA CSRepetitions-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-06 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (95 resets) in 168 ms. (59 steps per ms)
FORMULA CSRepetitions-PT-07-UpperBounds-04 49 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-03 49 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 147 ms. (337 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 7, 7, 6] Max Struct:[+inf, +inf, 343, +inf, +inf]
[2024-05-23 00:10:31] [INFO ] Invariant cache hit.
[2024-05-23 00:10:31] [INFO ] [Real]Absence check using 56 positive place invariants in 22 ms returned sat
[2024-05-23 00:10:31] [INFO ] [Real]Absence check using state equation in 196 ms returned unsat
[2024-05-23 00:10:31] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-23 00:10:31] [INFO ] [Real]Absence check using state equation in 192 ms returned unsat
[2024-05-23 00:10:31] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned unsat
[2024-05-23 00:10:32] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2024-05-23 00:10:32] [INFO ] [Real]Absence check using state equation in 161 ms returned unsat
[2024-05-23 00:10:32] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2024-05-23 00:10:32] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 00:10:32] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-23 00:10:32] [INFO ] [Real]Added 49 Read/Feed constraints in 11 ms returned sat
[2024-05-23 00:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:10:32] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-23 00:10:32] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-23 00:10:32] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-23 00:10:33] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-23 00:10:33] [INFO ] Added : 3 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 177 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 7, 7, 6] Max Struct:[7, 7, 7, 7, +inf]
FORMULA CSRepetitions-PT-07-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 833/833 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 498 transition count 785
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 400 transition count 736
Discarding 336 places :
Symmetric choice reduction at 1 with 336 rule applications. Total rules 531 place count 64 transition count 400
Iterating global reduction 1 with 336 rules applied. Total rules applied 867 place count 64 transition count 400
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 907 place count 24 transition count 120
Iterating global reduction 1 with 40 rules applied. Total rules applied 947 place count 24 transition count 120
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 987 place count 24 transition count 80
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 1008 place count 10 transition count 73
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (trivial) has 16 edges and 10 vertex of which 9 / 10 are part of one of the 1 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 55 rules applied. Total rules applied 1063 place count 2 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1079 place count 2 transition count 3
Applied a total of 1079 rules in 125 ms. Remains 2 /498 variables (removed 496) and now considering 3/833 (removed 830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 2/498 places, 3/833 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 3 rows 2 cols
[2024-05-23 00:10:33] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000006 steps (30131 resets) in 250 ms. (3984 steps per ms)
BEST_FIRST walk for 1000001 steps (10767 resets) in 188 ms. (5291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-23 00:10:34] [INFO ] Invariant cache hit.
[2024-05-23 00:10:34] [INFO ] [Real]Absence check using state equation in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[7]
FORMULA CSRepetitions-PT-07-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 3647 ms.
ITS solved all properties within timeout

BK_STOP 1716423034112

--------------------
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="CSRepetitions-PT-07"
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 CSRepetitions-PT-07, 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 r069-tall-171620504100261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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