Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool smart
Input is CircadianClock-PT-000001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r026-ebro-152646304300478
=====================================================================

--------------------
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 CircadianClock-PT-000001-UpperBounds-00
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-01
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-02
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-03
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-04
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-05
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-06
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-07
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-08
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-09
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-10
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-11
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-12
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-13
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-14
FORMULA_NAME CircadianClock-PT-000001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526504823099

======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CircadianClock (PT), instance 000001
Examination UpperBounds
Parser /home/mcc/BenchKit/bin/parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin/upper_bound/smart

PNML FILE: model.pnml
Petri model created: 14 places, 16 transitions, 58 arcs.
Bounds file is: UpperBounds.xml
P8 --> T16 : 1
Pre[0,5]: 1
P10 --> T16 : 1
Pre[0,10]: 1
T16: P9' := P9 + 1
IM[0,11]: 1
T16: P10' := P10 - 1
IM[0,10]: -1
P7 --> T15 : 1
Pre[1,1]: 1
P14 --> T15 : 1
Pre[1,8]: 1
T15: P1' := P1 + 1
IM[1,9]: 1
T15: P14' := P14 - 1
IM[1,8]: -1
P6 --> T14 : 1
Pre[2,6]: 1
P11 --> T14 : 1
Pre[2,4]: 1
T14: P8' := P8 + 1
IM[2,5]: 1
T14: P11' := P11 - 1
IM[2,4]: -1
P5 --> T13 : 1
Pre[3,7]: 1
P11 --> T13 : 1
Pre[3,4]: 1
T13: P8' := P8 + 1
IM[3,5]: 1
T13: P11' := P11 - 1
IM[3,4]: -1
P4 --> T12 : 1
Pre[4,2]: 1
P12 --> T12 : 1
Pre[4,0]: 1
T12: P7' := P7 + 1
IM[4,1]: 1
T12: P12' := P12 - 1
IM[4,0]: -1
P3 --> T11 : 1
Pre[5,3]: 1
P12 --> T11 : 1
Pre[5,0]: 1
T11: P7' := P7 + 1
IM[5,1]: 1
T11: P12' := P12 - 1
IM[5,0]: -1
P6 --> T10 : 1
Pre[6,6]: 1
P14 --> T10 : 1
Pre[6,8]: 1
T10: P1' := P1 + 1
IM[6,9]: 1
T10: P6' := P6 - 1
IM[6,6]: -1
T10: P5' := P5 + 1
IM[6,7]: 1
T10: P14' := P14 - 1
IM[6,8]: -1
P4 --> T9 : 1
Pre[7,2]: 1
P14 --> T9 : 1
Pre[7,8]: 1
T9: P4' := P4 - 1
IM[7,2]: -1
T9: P3' := P3 + 1
IM[7,3]: 1
T9: P1' := P1 + 1
IM[7,9]: 1
T9: P14' := P14 - 1
IM[7,8]: -1
P9 --> T8 : 1
Pre[8,11]: 1
T8: P9' := P9 - 1
IM[8,11]: -1
T8: P10' := P10 + 1
IM[8,10]: 1
P8 --> T7 : 1
Pre[9,5]: 1
T7: P8' := P8 - 1
IM[9,5]: -1
T7: P11' := P11 + 1
IM[9,4]: 1
P7 --> T6 : 1
Pre[10,1]: 1
T6: P7' := P7 - 1
IM[10,1]: -1
T6: P12' := P12 + 1
IM[10,0]: 1
P2 --> T5 : 1
Pre[11,13]: 1
P10 --> T5 : 1
Pre[11,10]: 1
T5: P9' := P9 + 1
IM[11,11]: 1
T5: P2' := P2 - 1
IM[11,13]: -1
T5: P10' := P10 - 1
IM[11,10]: -1
T5: P13' := P13 + 1
IM[11,12]: 1
P1 --> T4 : 1
Pre[12,9]: 1
T4: P1' := P1 - 1
IM[12,9]: -1
T4: P14' := P14 + 1
IM[12,8]: 1
P1 --> T3 : 1
Pre[13,9]: 1
P9 --> T3 : 1
Pre[13,11]: 1
P13 --> T3 : 1
Pre[13,12]: 1
T3: P1' := P1 - 1
IM[13,9]: -1
T3: P9' := P9 - 1
IM[13,11]: -1
T3: P2' := P2 + 1
IM[13,13]: 1
T3: P13' := P13 - 1
IM[13,12]: -1
T3: P10' := P10 + 1
IM[13,10]: 1
T3: P14' := P14 + 1
IM[13,8]: 1
P1 --> T2 : 1
Pre[14,9]: 1
P5 --> T2 : 1
Pre[14,7]: 1
T2: P1' := P1 - 1
IM[14,9]: -1
T2: P5' := P5 - 1
IM[14,7]: -1
T2: P6' := P6 + 1
IM[14,6]: 1
T2: P14' := P14 + 1
IM[14,8]: 1
P3 --> T1 : 1
Pre[15,3]: 1
P1 --> T1 : 1
Pre[15,9]: 1
T1: P3' := P3 - 1
IM[15,3]: -1
T1: P4' := P4 + 1
IM[15,2]: 1
T1: P1' := P1 - 1
IM[15,9]: -1
T1: P14' := P14 + 1
IM[15,8]: 1


Decreasing places (index:name):

Increasing places (index:name):

Disabled transitions:

Done with translating model within variable-ordering code
Done generating initial forcegiven
Done generating initial soupsgiven
Done computing soupscore
Done generating soupsorder
Done computing soupscore
Done generating soupsorder
Done computing soupscore
Done generating soupsorder
Done computing soupscore
Done generating soupsorder
Done computing soupscore
Done generating soupsorder
Done computing soupscore
Done with building new variable-ordering
Finalized T16
Disabled? False
Enabling: (1<=P8&1<=P10)
Firing: P9' := P9 + 1; P10' := P10 - 1
Finalized T15
Disabled? False
Enabling: (1<=P7&1<=P14)
Firing: P1' := P1 + 1; P14' := P14 - 1
Finalized T14
Disabled? False
Enabling: (1<=P6&1<=P11)
Firing: P8' := P8 + 1; P11' := P11 - 1
Finalized T13
Disabled? False
Enabling: (1<=P5&1<=P11)
Firing: P8' := P8 + 1; P11' := P11 - 1
Finalized T12
Disabled? False
Enabling: (1<=P4&1<=P12)
Firing: P7' := P7 + 1; P12' := P12 - 1
Finalized T11
Disabled? False
Enabling: (1<=P3&1<=P12)
Firing: P7' := P7 + 1; P12' := P12 - 1
Finalized T10
Disabled? False
Enabling: (1<=P6&1<=P14)
Firing: P1' := P1 + 1; P6' := P6 - 1; P5' := P5 + 1; P14' := P14 - 1
Finalized T9
Disabled? False
Enabling: (1<=P4&1<=P14)
Firing: P4' := P4 - 1; P3' := P3 + 1; P1' := P1 + 1; P14' := P14 - 1
Finalized T8
Disabled? False
Enabling: 1<=P9
Firing: P9' := P9 - 1; P10' := P10 + 1
Finalized T7
Disabled? False
Enabling: 1<=P8
Firing: P8' := P8 - 1; P11' := P11 + 1
Finalized T6
Disabled? False
Enabling: 1<=P7
Firing: P7' := P7 - 1; P12' := P12 + 1
Finalized T5
Disabled? False
Enabling: (1<=P2&1<=P10)
Firing: P9' := P9 + 1; P2' := P2 - 1; P10' := P10 - 1; P13' := P13 + 1
Finalized T4
Disabled? False
Enabling: 1<=P1
Firing: P1' := P1 - 1; P14' := P14 + 1
Finalized T3
Disabled? False
Enabling: (1<=P1&1<=P9&1<=P13)
Firing: P1' := P1 - 1; P9' := P9 - 1; P2' := P2 + 1; P13' := P13 - 1; P10' := P10 + 1; P14' := P14 + 1
Finalized T2
Disabled? False
Enabling: (1<=P1&1<=P5)
Firing: P1' := P1 - 1; P5' := P5 - 1; P6' := P6 + 1; P14' := P14 + 1
Finalized T1
Disabled? False
Enabling: (1<=P3&1<=P1)
Firing: P3' := P3 - 1; P4' := P4 + 1; P1' := P1 - 1; P14' := P14 + 1
FORMULA CircadianClock-PT-000001-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-01 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-04 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CircadianClock-PT-000001-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1526504825037

--------------------
content from stderr:

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="CircadianClock-PT-000001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smart"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000001.tgz
mv CircadianClock-PT-000001 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool smart"
echo " Input is CircadianClock-PT-000001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r026-ebro-152646304300478"
echo "====================================================================="
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
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 ;