About the Execution of Marcie for Diffusion2D-PT-D10N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15932.000 | 1679123.00 | 1678980.00 | 69.90 | ?T??FFTFFFF????? | normal |
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)
..............
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is Diffusion2D-PT-D10N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r029kn-smll-146348014900142
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-0
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-1
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-15
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-2
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-3
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-4
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-5
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-6
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-7
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-8
FORMULA_NAME Diffusion2D-PT-D10N050-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1463512033955
Marcie rev. 8535M (built: crohr on 2016-04-27)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: Diffusion2D_PT_D10N050
(NrP: 100 NrTr: 684 NrArc: 1368)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
init dd package: 0m 3.909sec
RS generation: 0m 2.679sec
-> reachability set: #nodes 5050 (5.0e+03) #states 13,419,107,273,154,621,529,493,489,587,286,210,498,760 (40)
starting MCC model checker
--------------------------
checking: EF [~ [~ [1<=cAMP__7_1_]]]
normalized: E [true U 1<=cAMP__7_1_]
abstracting: (1<=cAMP__7_1_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m36.162sec
checking: EF [1<=cAMP__3_1_]
normalized: E [true U 1<=cAMP__3_1_]
abstracting: (1<=cAMP__3_1_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m33.235sec
checking: AG [cAMP__10_5_<=cAMP__1_10_]
normalized: ~ [E [true U ~ [cAMP__10_5_<=cAMP__1_10_]]]
abstracting: (cAMP__10_5_<=cAMP__1_10_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m39.347sec
checking: AG [~ [[~ [cAMP__1_4_<=cAMP__6_6_] | 1<=cAMP__2_5_]]]
normalized: ~ [E [true U [~ [cAMP__1_4_<=cAMP__6_6_] | 1<=cAMP__2_5_]]]
abstracting: (1<=cAMP__2_5_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
abstracting: (cAMP__1_4_<=cAMP__6_6_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m43.531sec
checking: AG [[cAMP__6_9_<=cAMP__6_3_ | cAMP__1_8_<=cAMP__10_6_]]
normalized: ~ [E [true U ~ [[cAMP__6_9_<=cAMP__6_3_ | cAMP__1_8_<=cAMP__10_6_]]]]
abstracting: (cAMP__1_8_<=cAMP__10_6_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
abstracting: (cAMP__6_9_<=cAMP__6_3_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 7m30.741sec
checking: EF [[~ [[2<=cAMP__6_7_ & cAMP__4_10_<=cAMP__4_6_]] & ~ [~ [2<=cAMP__7_2_]]]]
normalized: E [true U [2<=cAMP__7_2_ & ~ [[2<=cAMP__6_7_ & cAMP__4_10_<=cAMP__4_6_]]]]
abstracting: (cAMP__4_10_<=cAMP__4_6_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
abstracting: (2<=cAMP__6_7_) states: 1,490,876,692,328,533,590,933,205,581,754,544,518,500 (39)
abstracting: (2<=cAMP__7_2_) states: 1,490,876,692,328,533,590,933,205,581,754,544,518,500 (39)
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-10 CANNOT_COMPUTE
MC time: 1m29.849sec
checking: AG [~ [[2<=cAMP__9_2_ | [1<=cAMP__10_3_ & cAMP__2_10_<=cAMP__9_3_]]]]
normalized: ~ [E [true U [2<=cAMP__9_2_ | [1<=cAMP__10_3_ & cAMP__2_10_<=cAMP__9_3_]]]]
before gc: list nodes free: 15
after gc: idd nodes used:5116, unused:63994884; list nodes free:691774253
abstracting: (cAMP__2_10_<=cAMP__9_3_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
abstracting: (1<=cAMP__10_3_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
abstracting: (2<=cAMP__9_2_) states: 1,490,876,692,328,533,590,933,205,581,754,544,518,500 (39)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m 1.767sec
checking: AG [[~ [[2<=cAMP__2_5_ | 1<=cAMP__3_5_]] | [~ [1<=cAMP__8_4_] | ~ [1<=cAMP__9_3_]]]]
normalized: ~ [E [true U ~ [[[~ [1<=cAMP__9_3_] | ~ [1<=cAMP__8_4_]] | ~ [[2<=cAMP__2_5_ | 1<=cAMP__3_5_]]]]]]
abstracting: (1<=cAMP__3_5_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
abstracting: (2<=cAMP__2_5_) states: 1,490,876,692,328,533,590,933,205,581,754,544,518,500 (39)
abstracting: (1<=cAMP__8_4_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
abstracting: (1<=cAMP__9_3_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 0.669sec
checking: AG [[~ [[cAMP__4_1_<=cAMP__5_2_ & 3<=cAMP__8_9_]] & ~ [[1<=cAMP__9_8_ & 3<=cAMP__2_2_]]]]
normalized: ~ [E [true U ~ [[~ [[1<=cAMP__9_8_ & 3<=cAMP__2_2_]] & ~ [[cAMP__4_1_<=cAMP__5_2_ & 3<=cAMP__8_9_]]]]]]
abstracting: (3<=cAMP__8_9_) states: 486,816,879,127,684,437,855,740,598,123,932,904,000 (38)
abstracting: (cAMP__4_1_<=cAMP__5_2_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
abstracting: (3<=cAMP__2_2_) states: 486,816,879,127,684,437,855,740,598,123,932,904,000 (38)
abstracting: (1<=cAMP__9_8_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 8m44.667sec
checking: EF [[[1<=cAMP__7_4_ | [cAMP__3_1_<=cAMP__9_6_ & 3<=cAMP__1_8_]] & 3<=cAMP__8_10_]]
normalized: E [true U [3<=cAMP__8_10_ & [1<=cAMP__7_4_ | [cAMP__3_1_<=cAMP__9_6_ & 3<=cAMP__1_8_]]]]
abstracting: (3<=cAMP__1_8_) states: 486,816,879,127,684,437,855,740,598,123,932,904,000 (38)
abstracting: (cAMP__3_1_<=cAMP__9_6_) states: 10,038,979,828,127,960,156,387,191,575,854,140,896,012 (40)
abstracting: (1<=cAMP__7_4_) states: 4,503,056,131,931,081,050,165,600,532,646,379,362,000 (39)
abstracting: (3<=cAMP__8_10_) states: 486,816,879,127,684,437,855,740,598,123,932,904,000 (38)
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-9 CANNOT_COMPUTE
MC time: 1m19.477sec
checking: AG [[[cAMP__5_1_<=cAMP__3_4_ | cAMP__10_5_<=cAMP__8_9_] & cAMP__9_1_<=cAMP__5_10_]]
normalized: ~ [E [true U ~ [[cAMP__9_1_<=cAMP__5_10_ & [cAMP__5_1_<=cAMP__3_4_ | cAMP__10_5_<=cAMP__8_9_]]]]]
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-5 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: EF [[~ [~ [cAMP__5_5_<=cAMP__8_1_]] & [~ [cAMP__6_10_<=cAMP__8_9_] & [2<=cAMP__8_3_ & cAMP__7_7_<=cAMP__2_6_]]]]
normalized: E [true U [cAMP__5_5_<=cAMP__8_1_ & [[2<=cAMP__8_3_ & cAMP__7_7_<=cAMP__2_6_] & ~ [cAMP__6_10_<=cAMP__8_9_]]]]
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-6 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: EF [[cAMP__5_8_<=cAMP__10_5_ & [[cAMP__8_3_<=cAMP__2_1_ & 3<=cAMP__3_2_] | [1<=cAMP__1_2_ & 2<=cAMP__8_8_]]]]
normalized: E [true U [cAMP__5_8_<=cAMP__10_5_ & [[cAMP__8_3_<=cAMP__2_1_ & 3<=cAMP__3_2_] | [1<=cAMP__1_2_ & 2<=cAMP__8_8_]]]]
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-11 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: AG [[cAMP__2_10_<=cAMP__2_4_ | [[cAMP__8_8_<=cAMP__9_6_ & 3<=cAMP__10_6_] & [cAMP__6_6_<=cAMP__8_6_ & 1<=cAMP__1_10_]]]]
normalized: ~ [E [true U ~ [[cAMP__2_10_<=cAMP__2_4_ | [[cAMP__6_6_<=cAMP__8_6_ & 1<=cAMP__1_10_] & [cAMP__8_8_<=cAMP__9_6_ & 3<=cAMP__10_6_]]]]]]
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-7 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: AG [[[[2<=cAMP__5_8_ | 3<=cAMP__2_4_] & [2<=cAMP__9_4_ & cAMP__9_4_<=cAMP__3_2_]] | [[cAMP__8_1_<=cAMP__10_10_ & cAMP__7_7_<=cAMP__9_1_] | cAMP__2_4_<=cAMP__10_5_]]]
normalized: ~ [E [true U ~ [[[[2<=cAMP__9_4_ & cAMP__9_4_<=cAMP__3_2_] & [2<=cAMP__5_8_ | 3<=cAMP__2_4_]] | [cAMP__2_4_<=cAMP__10_5_ | [cAMP__8_1_<=cAMP__10_10_ & cAMP__7_7_<=cAMP__9_1_]]]]]]
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-0 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: EF [[[[cAMP__2_5_<=cAMP__8_6_ | 1<=cAMP__3_9_] | [cAMP__1_2_<=cAMP__2_7_ | cAMP__2_3_<=cAMP__8_3_]] & [~ [cAMP__10_10_<=cAMP__9_6_] & [2<=cAMP__10_2_ & cAMP__8_8_<=cAMP__2_8_]]]]
normalized: E [true U [[[2<=cAMP__10_2_ & cAMP__8_8_<=cAMP__2_8_] & ~ [cAMP__10_10_<=cAMP__9_6_]] & [[cAMP__1_2_<=cAMP__2_7_ | cAMP__2_3_<=cAMP__8_3_] | [cAMP__2_5_<=cAMP__8_6_ | 1<=cAMP__3_9_]]]]
FORMULA Diffusion2D-PT-D10N050-ReachabilityCardinality-8 CANNOT_COMPUTE
MC time: 0m 0.000sec
Total processing time: 27m58.697sec
BK_STOP 1463513713078
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
2050 2050 2500 2850 3400 3950 4100 4600
iterations count:8700 (12), effective:99 (0)
initing FirstDep: 0m 0.001sec
8169 7434 6895 6405 5915 5474 5082 5042
iterations count:8631 (12), effective:99 (0)
8966 8182 7594 7104 6614 5977 5732 5242
iterations count:8631 (12), effective:99 (0)
22975 15188 8599 5007 5018 5028 5031 5042
iterations count:8629 (12), effective:99 (0)
7918 7134 6644 6105 5468 5028 5031 5041
iterations count:8686 (12), effective:99 (0)
36556 29081 22756 18731 18778 18092 17504 17064 11324 6158 5014 5036
iterations count:12511 (18), effective:158 (0)
std::bad_alloc
10814 27052 14572 7636 5001 5010 5021 5029 5032 5045
iterations count:10375 (15), effective:135 (0)
5400 4837 5401 4876 4898 4914 6334 7011 6423 5835 5394 4966 4987 5005 5038
iterations count:15191 (22), effective:204 (0)
10416 9844 9316 9008 8524 8084 7908 54106 42928 36097 28645 22435 16846 12499 5856
iterations count:15851 (23), effective:193 (0)
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
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="Diffusion2D-PT-D10N050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/Diffusion2D-PT-D10N050.tgz
mv Diffusion2D-PT-D10N050 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is Diffusion2D-PT-D10N050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r029kn-smll-146348014900142"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;