About the Execution of Marcie+red for PermAdmissibility-PT-20
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.r266-smll-167863541100541.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PermAdmissibility-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541100541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 230K Feb 26 01:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 26 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 374K Feb 26 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-20-UpperBounds-00
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-01
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-02
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-03
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-04
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-05
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-06
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-07
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-08
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-09
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-10
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-11
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-12
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-13
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-14
FORMULA_NAME PermAdmissibility-PT-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679135508801
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=PermAdmissibility-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 10:31:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 10:31:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:31:52] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-18 10:31:52] [INFO ] Transformed 168 places.
[2023-03-18 10:31:52] [INFO ] Transformed 592 transitions.
[2023-03-18 10:31:52] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 592 rows 168 cols
[2023-03-18 10:31:52] [INFO ] Computed 32 place invariants in 53 ms
Incomplete random walk after 10005 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :360
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :193
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :78
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :192
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :110
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :120
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :136
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :145
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :149
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :127
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :132
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :186
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :154
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :121
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :79
[2023-03-18 10:31:52] [INFO ] Invariant cache hit.
[2023-03-18 10:31:52] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 28 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 11 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 33 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 32 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 26 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 28 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 25 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 21 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned unsat
[2023-03-18 10:31:53] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 31 ms returned unsat
[2023-03-18 10:31:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 30 ms returned unsat
[2023-03-18 10:31:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 21 ms returned unsat
[2023-03-18 10:31:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [20, 20, 40, 40, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20] Max seen :[20, 20, 40, 40, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
FORMULA PermAdmissibility-PT-20-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-03 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-02 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-20-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2501 ms.
ITS solved all properties within timeout
BK_STOP 1679135515363
--------------------
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="PermAdmissibility-PT-20"
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 PermAdmissibility-PT-20, 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 r266-smll-167863541100541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 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 '
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 ;