About the Execution of smart for GPPP-PT-C1000N0000000100
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 196K
-rw-r--r-- 1 mcc users 3.4K 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 3.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool smart
Input is GPPP-PT-C1000N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r086-blw7-152649992000345
=====================================================================
--------------------
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 GPPP-PT-C1000N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526590082174
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running GPPP (PT), instance C1000N0000000100
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: 33 places, 22 transitions, 83 arcs.
Bounds file is: UpperBounds.xml
P10 --> T22 : 1
Pre[0,26]: 1
P11 --> T22 : 1
Pre[0,28]: 1
T22: P10' := P10 - 1
IM[0,26]: -1
T22: P11' := P11 - 1
IM[0,28]: -1
T22: P12' := P12 + 1
IM[0,29]: 1
T22: P13' := P13 + 1
IM[0,25]: 1
P25 --> T21 : 1
Pre[1,9]: 1
T21: P20' := P20 + 7000
IM[1,11]: 7000
T21: P25' := P25 - 1
IM[1,9]: -1
T21: P27' := P27 + 4000
IM[1,16]: 4000
T21: P1' := P1 + 7000
IM[1,13]: 7000
P2 --> T20 : 7000
Pre[2,10]: 7000
P26 --> T20 : 7000
Pre[2,8]: 7000
T20: P2' := P2 - 7000
IM[2,10]: -7000
T20: P25' := P25 + 1
IM[2,9]: 1
T20: P26' := P26 - 7000
IM[2,8]: -7000
P24 --> T19 : 1
Pre[3,7]: 1
P4 --> T19 : 1
Pre[3,15]: 1
T19: P24' := P24 - 1
IM[3,7]: -1
T19: P26' := P26 + 1
IM[3,8]: 1
T19: P4' := P4 - 1
IM[3,15]: -1
T19: P3' := P3 + 1
IM[3,14]: 1
P23 --> T18 : 1
Pre[4,0]: 1
P20 --> T18 : 1
Pre[4,11]: 1
T18: P24' := P24 + 1
IM[4,7]: 1
T18: P23' := P23 - 1
IM[4,0]: -1
T18: P20' := P20 - 1
IM[4,11]: -1
T18: P2' := P2 + 1
IM[4,10]: 1
P22 --> T17 : 1
Pre[5,1]: 1
T17: P23' := P23 + 1
IM[5,0]: 1
T17: P22' := P22 - 1
IM[5,1]: -1
P21 --> T16 : 1
Pre[6,6]: 1
T16: P22' := P22 + 1
IM[6,1]: 1
T16: P21' := P21 - 1
IM[6,6]: -1
P20 --> T15 : 1
Pre[7,11]: 1
P19 --> T15 : 1
Pre[7,12]: 1
T15: P21' := P21 + 1
IM[7,6]: 1
T15: P20' := P20 - 1
IM[7,11]: -1
T15: P2' := P2 + 1
IM[7,10]: 1
T15: P19' := P19 - 1
IM[7,12]: -1
P14 --> T14 : 1
Pre[8,30]: 1
P10 --> T14 : 1
Pre[8,26]: 1
T14: P14' := P14 - 1
IM[8,30]: -1
T14: P15' := P15 + 1
IM[8,20]: 1
T14: P10' := P10 - 1
IM[8,26]: -1
T14: P13' := P13 + 1
IM[8,25]: 1
P12 --> T13 : 1
Pre[9,29]: 1
P13 --> T13 : 1
Pre[9,25]: 1
P32 --> T13 : 7000
Pre[9,31]: 7000
T13: P12' := P12 - 1
IM[9,29]: -1
T13: P13' := P13 - 1
IM[9,25]: -1
T13: P14' := P14 + 1
IM[9,30]: 1
T13: P15' := P15 + 1
IM[9,20]: 1
T13: P32' := P32 - 7000
IM[9,31]: -7000
T13: P33' := P33 + 7000
IM[9,32]: 7000
P9 --> T12 : 1
Pre[10,22]: 1
P30 --> T12 : 2000
Pre[10,27]: 2000
T12: P9' := P9 - 1
IM[10,22]: -1
T12: P11' := P11 + 1
IM[10,28]: 1
T12: P30' := P30 - 2000
IM[10,27]: -2000
T12: P31' := P31 + 2000
IM[10,23]: 2000
P9 --> T11 : 1
Pre[11,22]: 1
P31 --> T11 : 1
Pre[11,23]: 1
T11: P9' := P9 - 1
IM[11,22]: -1
T11: P10' := P10 + 1
IM[11,26]: 1
T11: P31' := P31 - 1
IM[11,23]: -1
T11: P30' := P30 + 1
IM[11,27]: 1
P5 --> T10 : 2
Pre[12,4]: 2
P16 --> T10 : 1
Pre[12,17]: 1
P29 --> T10 : 1
Pre[12,19]: 1
T10: P5' := P5 - 2
IM[12,4]: -2
T10: P6' := P6 + 2
IM[12,5]: 2
T10: P16' := P16 - 1
IM[12,17]: -1
T10: P9' := P9 + 1
IM[12,22]: 1
T10: P29' := P29 - 1
IM[12,19]: -1
T10: P28' := P28 + 1
IM[12,18]: 1
P8 --> T9 : 2
Pre[13,2]: 2
T9: P7' := P7 + 1
IM[13,3]: 1
T9: P8' := P8 - 2
IM[13,2]: -2
P7 --> T8 : 1
Pre[14,3]: 1
P6 --> T8 : 1
Pre[14,5]: 1
T8: P7' := P7 - 1
IM[14,3]: -1
T8: P8' := P8 + 2
IM[14,2]: 2
T8: P6' := P6 - 1
IM[14,5]: -1
T8: P5' := P5 + 1
IM[14,4]: 1
P2 --> T7 : 1
Pre[15,10]: 1
P27 --> T7 : 1
Pre[15,16]: 1
T7: P2' := P2 - 1
IM[15,10]: -1
T7: P27' := P27 - 1
IM[15,16]: -1
T7: P16' := P16 + 1
IM[15,17]: 1
T7: P20' := P20 + 1
IM[15,11]: 1
P16 --> T6 : 1
Pre[16,17]: 1
P28 --> T6 : 3000
Pre[16,18]: 3000
T6: P16' := P16 - 1
IM[16,17]: -1
T6: P15' := P15 + 1
IM[16,20]: 1
T6: P28' := P28 - 3000
IM[16,18]: -3000
T6: P29' := P29 + 3000
IM[16,19]: 3000
P15 --> T5 : 1
Pre[17,20]: 1
P2 --> T5 : 1
Pre[17,10]: 1
T5: P17' := P17 + 1
IM[17,21]: 1
T5: P15' := P15 - 1
IM[17,20]: -1
T5: P2' := P2 - 1
IM[17,10]: -1
T5: P20' := P20 + 1
IM[17,11]: 1
P17 --> T4 : 1
Pre[18,21]: 1
T4: P13' := P13 + 1
IM[18,25]: 1
T4: P18' := P18 + 1
IM[18,24]: 1
T4: P17' := P17 - 1
IM[18,21]: -1
P13 --> T3 : 1
Pre[19,25]: 1
T3: P13' := P13 - 1
IM[19,25]: -1
T3: P18' := P18 + 1
IM[19,24]: 1
P18 --> T2 : 1
Pre[20,24]: 1
T2: P13' := P13 + 1
IM[20,25]: 1
T2: P18' := P18 - 1
IM[20,24]: -1
P13 --> T1 : 1
Pre[21,25]: 1
P3 --> T1 : 1
Pre[21,14]: 1
P1 --> T1 : 1
Pre[21,13]: 1
P33 --> T1 : 1
Pre[21,32]: 1
T1: P13' := P13 - 1
IM[21,25]: -1
T1: P3' := P3 - 1
IM[21,14]: -1
T1: P1' := P1 - 1
IM[21,13]: -1
T1: P19' := P19 + 1
IM[21,12]: 1
T1: P4' := P4 + 1
IM[21,15]: 1
T1: P32' := P32 + 1
IM[21,31]: 1
T1: P33' := P33 - 1
IM[21,32]: -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 T22
Disabled? False
Enabling: (1<=P10&1<=P11)
Firing: P10' := P10 - 1; P11' := P11 - 1; P12' := P12 + 1; P13' := P13 + 1
Finalized T21
Disabled? False
Enabling: 1<=P25
Firing: P20' := P20 + 7000; P25' := P25 - 1; P27' := P27 + 4000; P1' := P1 + 7000
Finalized T20
Disabled? False
Enabling: (7000<=P2&7000<=P26)
Firing: P2' := P2 - 7000; P25' := P25 + 1; P26' := P26 - 7000
Finalized T19
Disabled? False
Enabling: (1<=P24&1<=P4)
Firing: P24' := P24 - 1; P26' := P26 + 1; P4' := P4 - 1; P3' := P3 + 1
Finalized T18
Disabled? False
Enabling: (1<=P23&1<=P20)
Firing: P24' := P24 + 1; P23' := P23 - 1; P20' := P20 - 1; P2' := P2 + 1
Finalized T17
Disabled? False
Enabling: 1<=P22
Firing: P23' := P23 + 1; P22' := P22 - 1
Finalized T16
Disabled? False
Enabling: 1<=P21
Firing: P22' := P22 + 1; P21' := P21 - 1
Finalized T15
Disabled? False
Enabling: (1<=P20&1<=P19)
Firing: P21' := P21 + 1; P20' := P20 - 1; P2' := P2 + 1; P19' := P19 - 1
Finalized T14
Disabled? False
Enabling: (1<=P14&1<=P10)
Firing: P14' := P14 - 1; P15' := P15 + 1; P10' := P10 - 1; P13' := P13 + 1
Finalized T13
Disabled? False
Enabling: (1<=P12&1<=P13&7000<=P32)
Firing: P12' := P12 - 1; P13' := P13 - 1; P14' := P14 + 1; P15' := P15 + 1; P32' := P32 - 7000; P33' := P33 + 7000
Finalized T12
Disabled? False
Enabling: (1<=P9&2000<=P30)
Firing: P9' := P9 - 1; P11' := P11 + 1; P30' := P30 - 2000; P31' := P31 + 2000
Finalized T11
Disabled? False
Enabling: (1<=P9&1<=P31)
Firing: P9' := P9 - 1; P10' := P10 + 1; P31' := P31 - 1; P30' := P30 + 1
Finalized T10
Disabled? False
Enabling: (2<=P5&1<=P16&1<=P29)
Firing: P5' := P5 - 2; P6' := P6 + 2; P16' := P16 - 1; P9' := P9 + 1; P29' := P29 - 1; P28' := P28 + 1
Finalized T9
Disabled? False
Enabling: 2<=P8
Firing: P7' := P7 + 1; P8' := P8 - 2
Finalized T8
Disabled? False
Enabling: (1<=P7&1<=P6)
Firing: P7' := P7 - 1; P8' := P8 + 2; P6' := P6 - 1; P5' := P5 + 1
Finalized T7
Disabled? False
Enabling: (1<=P2&1<=P27)
Firing: P2' := P2 - 1; P27' := P27 - 1; P16' := P16 + 1; P20' := P20 + 1
Finalized T6
Disabled? False
Enabling: (1<=P16&3000<=P28)
Firing: P16' := P16 - 1; P15' := P15 + 1; P28' := P28 - 3000; P29' := P29 + 3000
Finalized T5
Disabled? False
Enabling: (1<=P15&1<=P2)
Firing: P17' := P17 + 1; P15' := P15 - 1; P2' := P2 - 1; P20' := P20 + 1
Finalized T4
Disabled? False
Enabling: 1<=P17
Firing: P13' := P13 + 1; P18' := P18 + 1; P17' := P17 - 1
Finalized T3
Disabled? False
Enabling: 1<=P13
Firing: P13' := P13 - 1; P18' := P18 + 1
Finalized T2
Disabled? False
Enabling: 1<=P18
Firing: P13' := P13 + 1; P18' := P18 - 1
Finalized T1
Disabled? False
Enabling: (1<=P13&1<=P3&1<=P1&1<=P33)
Firing: P13' := P13 - 1; P3' := P3 - 1; P1' := P1 - 1; P19' := P19 + 1; P4' := P4 + 1; P32' := P32 + 1; P33' := P33 - 1
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-00 7000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-01 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-02 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-03 407 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-04 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-05 407 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-06 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-07 407 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-08 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-09 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-10 200 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-11 2000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-14 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1526590588389
--------------------
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="GPPP-PT-C1000N0000000100"
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/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 GPPP-PT-C1000N0000000100, 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 r086-blw7-152649992000345"
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 '
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 ;