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-167813696100669.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-070, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 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 7.3M 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-070-UpperBounds-00
FORMULA_NAME CANConstruction-PT-070-UpperBounds-01
FORMULA_NAME CANConstruction-PT-070-UpperBounds-02
FORMULA_NAME CANConstruction-PT-070-UpperBounds-03
FORMULA_NAME CANConstruction-PT-070-UpperBounds-04
FORMULA_NAME CANConstruction-PT-070-UpperBounds-05
FORMULA_NAME CANConstruction-PT-070-UpperBounds-06
FORMULA_NAME CANConstruction-PT-070-UpperBounds-07
FORMULA_NAME CANConstruction-PT-070-UpperBounds-08
FORMULA_NAME CANConstruction-PT-070-UpperBounds-09
FORMULA_NAME CANConstruction-PT-070-UpperBounds-10
FORMULA_NAME CANConstruction-PT-070-UpperBounds-11
FORMULA_NAME CANConstruction-PT-070-UpperBounds-12
FORMULA_NAME CANConstruction-PT-070-UpperBounds-13
FORMULA_NAME CANConstruction-PT-070-UpperBounds-14
FORMULA_NAME CANConstruction-PT-070-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678739737283

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-070
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:35:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:35:39] [INFO ] Load time of PNML (sax parser for PT used): 443 ms
[2023-03-13 20:35:39] [INFO ] Transformed 10642 places.
[2023-03-13 20:35:39] [INFO ] Transformed 20160 transitions.
[2023-03-13 20:35:39] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 602 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-13 20:35:39] [INFO ] Computed 141 place invariants in 375 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 16) seen :4
FORMULA CANConstruction-PT-070-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
[2023-03-13 20:35:40] [INFO ] Invariant cache hit.
[2023-03-13 20:35:42] [INFO ] [Real]Absence check using 71 positive place invariants in 391 ms returned sat
[2023-03-13 20:35:42] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 67 ms returned sat
[2023-03-13 20:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:35:45] [INFO ] [Real]Absence check using state equation in 3549 ms returned unknown
[2023-03-13 20:35:46] [INFO ] [Real]Absence check using 71 positive place invariants in 311 ms returned sat
[2023-03-13 20:35:46] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 48 ms returned sat
[2023-03-13 20:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:35:50] [INFO ] [Real]Absence check using state equation in 3739 ms returned unknown
[2023-03-13 20:35:51] [INFO ] [Real]Absence check using 71 positive place invariants in 228 ms returned sat
[2023-03-13 20:35:51] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 47 ms returned sat
[2023-03-13 20:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:35:55] [INFO ] [Real]Absence check using state equation in 3785 ms returned unknown
[2023-03-13 20:35:56] [INFO ] [Real]Absence check using 71 positive place invariants in 214 ms returned sat
[2023-03-13 20:35:56] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 47 ms returned sat
[2023-03-13 20:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:00] [INFO ] [Real]Absence check using state equation in 3902 ms returned unknown
[2023-03-13 20:36:01] [INFO ] [Real]Absence check using 71 positive place invariants in 214 ms returned sat
[2023-03-13 20:36:01] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 47 ms returned sat
[2023-03-13 20:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:05] [INFO ] [Real]Absence check using state equation in 3927 ms returned unknown
[2023-03-13 20:36:06] [INFO ] [Real]Absence check using 71 positive place invariants in 216 ms returned sat
[2023-03-13 20:36:06] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 47 ms returned sat
[2023-03-13 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:10] [INFO ] [Real]Absence check using state equation in 3816 ms returned unknown
[2023-03-13 20:36:12] [INFO ] [Real]Absence check using 71 positive place invariants in 237 ms returned sat
[2023-03-13 20:36:12] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 53 ms returned sat
[2023-03-13 20:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:15] [INFO ] [Real]Absence check using state equation in 3542 ms returned unknown
[2023-03-13 20:36:16] [INFO ] [Real]Absence check using 71 positive place invariants in 238 ms returned sat
[2023-03-13 20:36:16] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 51 ms returned sat
[2023-03-13 20:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:20] [INFO ] [Real]Absence check using state equation in 3838 ms returned unknown
[2023-03-13 20:36:21] [INFO ] [Real]Absence check using 71 positive place invariants in 256 ms returned sat
[2023-03-13 20:36:22] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-13 20:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:25] [INFO ] [Real]Absence check using state equation in 3716 ms returned unknown
[2023-03-13 20:36:27] [INFO ] [Real]Absence check using 71 positive place invariants in 273 ms returned sat
[2023-03-13 20:36:27] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 69 ms returned sat
[2023-03-13 20:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:30] [INFO ] [Real]Absence check using state equation in 3589 ms returned unknown
[2023-03-13 20:36:32] [INFO ] [Real]Absence check using 71 positive place invariants in 254 ms returned sat
[2023-03-13 20:36:32] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 83 ms returned sat
[2023-03-13 20:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:35] [INFO ] [Real]Absence check using state equation in 3653 ms returned unknown
[2023-03-13 20:36:36] [INFO ] [Real]Absence check using 71 positive place invariants in 206 ms returned sat
[2023-03-13 20:36:36] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 44 ms returned sat
[2023-03-13 20:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:36:40] [INFO ] [Real]Absence check using state equation in 3954 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 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10642 transition count 19670
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10152 transition count 19670
Discarding 4753 places :
Symmetric choice reduction at 2 with 4753 rule applications. Total rules 5733 place count 5399 transition count 10164
Iterating global reduction 2 with 4753 rules applied. Total rules applied 10486 place count 5399 transition count 10164
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 7 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 10626 place count 5329 transition count 10094
Free-agglomeration rule applied 126 times.
Iterating global reduction 2 with 126 rules applied. Total rules applied 10752 place count 5329 transition count 9968
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 10878 place count 5203 transition count 9968
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 10892 place count 5203 transition count 9968
Applied a total of 10892 rules in 5746 ms. Remains 5203 /10642 variables (removed 5439) and now considering 9968/20160 (removed 10192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5748 ms. Remains : 5203/10642 places, 9968/20160 transitions.
// Phase 1: matrix 9968 rows 5203 cols
[2023-03-13 20:36:46] [INFO ] Computed 141 place invariants in 127 ms
Incomplete random walk after 1000000 steps, including 2066 resets, run finished after 17838 ms. (steps per millisecond=56 ) properties (out of 12) seen :12
FORMULA CANConstruction-PT-070-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 85762 ms.
ITS solved all properties within timeout

BK_STOP 1678739824765

--------------------
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-070"
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-070, 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-167813696100669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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