Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715100269.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-010B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 167K Mar 5 18:23 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 ShieldIIPt-PT-010B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679270731174

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 00:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:05:33] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-20 00:05:33] [INFO ] Transformed 703 places.
[2023-03-20 00:05:33] [INFO ] Transformed 653 transitions.
[2023-03-20 00:05:33] [INFO ] Found NUPN structural information;
[2023-03-20 00:05:33] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 653 rows 703 cols
[2023-03-20 00:05:33] [INFO ] Computed 91 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :15
FORMULA ShieldIIPt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-20 00:05:33] [INFO ] Invariant cache hit.
[2023-03-20 00:05:34] [INFO ] [Real]Absence check using 91 positive place invariants in 50 ms returned sat
[2023-03-20 00:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:05:34] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-20 00:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:05:35] [INFO ] [Nat]Absence check using 91 positive place invariants in 247 ms returned sat
[2023-03-20 00:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:05:35] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-03-20 00:05:35] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2023-03-20 00:05:35] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 1 ms to minimize.
[2023-03-20 00:05:36] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 12 ms to minimize.
[2023-03-20 00:05:36] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 20 ms to minimize.
[2023-03-20 00:05:36] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 15 ms to minimize.
[2023-03-20 00:05:36] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 27 ms to minimize.
[2023-03-20 00:05:37] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 15 ms to minimize.
[2023-03-20 00:05:37] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 0 ms to minimize.
[2023-03-20 00:05:37] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 0 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 0 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-20 00:05:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3307 ms
[2023-03-20 00:05:38] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-20 00:05:39] [INFO ] Added : 115 causal constraints over 23 iterations in 1063 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 703 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 651/651 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 701 transition count 479
Reduce places removed 171 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 944 edges and 530 vertex of which 527 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 176 rules applied. Total rules applied 348 place count 527 transition count 473
Reduce places removed 5 places and 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 353 place count 522 transition count 471
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 357 place count 520 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 359 place count 518 transition count 467
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 42 Pre rules applied. Total rules applied 359 place count 518 transition count 425
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 443 place count 476 transition count 425
Discarding 68 places :
Symmetric choice reduction at 5 with 68 rule applications. Total rules 511 place count 408 transition count 357
Iterating global reduction 5 with 68 rules applied. Total rules applied 579 place count 408 transition count 357
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 579 place count 408 transition count 329
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 635 place count 380 transition count 329
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 5 with 332 rules applied. Total rules applied 967 place count 214 transition count 163
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1021 place count 187 transition count 182
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1022 place count 187 transition count 181
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1031 place count 187 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1032 place count 186 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1034 place count 184 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1034 place count 184 transition count 179
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1036 place count 183 transition count 179
Applied a total of 1036 rules in 228 ms. Remains 183 /703 variables (removed 520) and now considering 179/651 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 183/703 places, 179/651 transitions.
// Phase 1: matrix 179 rows 183 cols
[2023-03-20 00:05:40] [INFO ] Computed 87 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 186 resets, run finished after 2800 ms. (steps per millisecond=357 ) properties (out of 1) seen :1
FORMULA ShieldIIPt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9474 ms.
ITS solved all properties within timeout

BK_STOP 1679270743238

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-010B, 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 r391-oct2-167903715100269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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