Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696100661.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-060, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100661
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.4M Mar 5 18:22 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 CANConstruction-PT-060-UpperBounds-00
FORMULA_NAME CANConstruction-PT-060-UpperBounds-01
FORMULA_NAME CANConstruction-PT-060-UpperBounds-02
FORMULA_NAME CANConstruction-PT-060-UpperBounds-03
FORMULA_NAME CANConstruction-PT-060-UpperBounds-04
FORMULA_NAME CANConstruction-PT-060-UpperBounds-05
FORMULA_NAME CANConstruction-PT-060-UpperBounds-06
FORMULA_NAME CANConstruction-PT-060-UpperBounds-07
FORMULA_NAME CANConstruction-PT-060-UpperBounds-08
FORMULA_NAME CANConstruction-PT-060-UpperBounds-09
FORMULA_NAME CANConstruction-PT-060-UpperBounds-10
FORMULA_NAME CANConstruction-PT-060-UpperBounds-11
FORMULA_NAME CANConstruction-PT-060-UpperBounds-12
FORMULA_NAME CANConstruction-PT-060-UpperBounds-13
FORMULA_NAME CANConstruction-PT-060-UpperBounds-14
FORMULA_NAME CANConstruction-PT-060-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678739246338

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:27:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:27:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:27:28] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2023-03-13 20:27:28] [INFO ] Transformed 7922 places.
[2023-03-13 20:27:28] [INFO ] Transformed 14880 transitions.
[2023-03-13 20:27:28] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 14880 rows 7922 cols
[2023-03-13 20:27:28] [INFO ] Computed 121 place invariants in 201 ms
FORMULA CANConstruction-PT-060-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 15) seen :2
FORMULA CANConstruction-PT-060-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :1
FORMULA CANConstruction-PT-060-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
[2023-03-13 20:27:29] [INFO ] Invariant cache hit.
[2023-03-13 20:27:30] [INFO ] [Real]Absence check using 61 positive place invariants in 235 ms returned sat
[2023-03-13 20:27:30] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 38 ms returned sat
[2023-03-13 20:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:27:34] [INFO ] [Real]Absence check using state equation in 3871 ms returned unknown
[2023-03-13 20:27:34] [INFO ] [Real]Absence check using 61 positive place invariants in 190 ms returned sat
[2023-03-13 20:27:34] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 37 ms returned sat
[2023-03-13 20:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:27:39] [INFO ] [Real]Absence check using state equation in 4203 ms returned unknown
[2023-03-13 20:27:39] [INFO ] [Real]Absence check using 61 positive place invariants in 188 ms returned sat
[2023-03-13 20:27:40] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 38 ms returned sat
[2023-03-13 20:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:27:44] [INFO ] [Real]Absence check using state equation in 4048 ms returned unknown
[2023-03-13 20:27:45] [INFO ] [Real]Absence check using 61 positive place invariants in 188 ms returned sat
[2023-03-13 20:27:45] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 71 ms returned sat
[2023-03-13 20:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:27:49] [INFO ] [Real]Absence check using state equation in 3954 ms returned unknown
[2023-03-13 20:27:49] [INFO ] [Real]Absence check using 61 positive place invariants in 162 ms returned sat
[2023-03-13 20:27:50] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 34 ms returned sat
[2023-03-13 20:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:27:54] [INFO ] [Real]Absence check using state equation in 4106 ms returned unknown
[2023-03-13 20:27:55] [INFO ] [Real]Absence check using 61 positive place invariants in 176 ms returned sat
[2023-03-13 20:27:55] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 42 ms returned sat
[2023-03-13 20:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:27:59] [INFO ] [Real]Absence check using state equation in 4077 ms returned unknown
[2023-03-13 20:28:00] [INFO ] [Real]Absence check using 61 positive place invariants in 249 ms returned sat
[2023-03-13 20:28:00] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 45 ms returned sat
[2023-03-13 20:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:28:04] [INFO ] [Real]Absence check using state equation in 4022 ms returned unknown
[2023-03-13 20:28:04] [INFO ] [Real]Absence check using 61 positive place invariants in 179 ms returned sat
[2023-03-13 20:28:04] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 51 ms returned sat
[2023-03-13 20:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:28:09] [INFO ] [Real]Absence check using state equation in 4181 ms returned unknown
[2023-03-13 20:28:10] [INFO ] [Real]Absence check using 61 positive place invariants in 206 ms returned sat
[2023-03-13 20:28:10] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 49 ms returned sat
[2023-03-13 20:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:28:14] [INFO ] [Real]Absence check using state equation in 3802 ms returned unknown
[2023-03-13 20:28:15] [INFO ] [Real]Absence check using 61 positive place invariants in 156 ms returned sat
[2023-03-13 20:28:15] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 35 ms returned sat
[2023-03-13 20:28:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:28:19] [INFO ] [Real]Absence check using state equation in 4081 ms returned unknown
[2023-03-13 20:28:20] [INFO ] [Real]Absence check using 61 positive place invariants in 252 ms returned sat
[2023-03-13 20:28:20] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 45 ms returned sat
[2023-03-13 20:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:28:24] [INFO ] [Real]Absence check using state equation in 3899 ms returned unknown
[2023-03-13 20:28:24] [INFO ] [Real]Absence check using 61 positive place invariants in 156 ms returned sat
[2023-03-13 20:28:24] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 65 ms returned sat
[2023-03-13 20:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:28:29] [INFO ] [Real]Absence check using state equation in 4210 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7922 transition count 14460
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7502 transition count 14460
Discarding 3473 places :
Symmetric choice reduction at 2 with 3473 rule applications. Total rules 4313 place count 4029 transition count 7514
Iterating global reduction 2 with 3473 rules applied. Total rules applied 7786 place count 4029 transition count 7514
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 17 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 7906 place count 3969 transition count 7454
Free-agglomeration rule applied 106 times.
Iterating global reduction 2 with 106 rules applied. Total rules applied 8012 place count 3969 transition count 7348
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 2 with 106 rules applied. Total rules applied 8118 place count 3863 transition count 7348
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 8132 place count 3863 transition count 7348
Applied a total of 8132 rules in 3811 ms. Remains 3863 /7922 variables (removed 4059) and now considering 7348/14880 (removed 7532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3814 ms. Remains : 3863/7922 places, 7348/14880 transitions.
// Phase 1: matrix 7348 rows 3863 cols
[2023-03-13 20:28:33] [INFO ] Computed 121 place invariants in 126 ms
Incomplete random walk after 1000000 steps, including 2400 resets, run finished after 13107 ms. (steps per millisecond=76 ) properties (out of 12) seen :12
FORMULA CANConstruction-PT-060-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 78529 ms.
ITS solved all properties within timeout

BK_STOP 1678739326494

--------------------
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.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="CANConstruction-PT-060"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CANConstruction-PT-060, 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 r042-tajo-167813696100661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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