About the Execution of Marcie for ResAllocation-PT-R100C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5879.688 | 14955.00 | 15050.00 | 0.00 | FTTFTFTTTFFFTFFT | normal |
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.r321-tall-167889192600774.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 marcie
Input is ResAllocation-PT-R100C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192600774
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 422K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678942805594
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=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ResAllocation_PT_R100C002
(NrP: 400 NrTr: 202 NrArc: 1000)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.009sec
net check time: 0m 0.000sec
init dd package: 0m 2.886sec
RS generation: 0m 1.519sec
-> reachability set: #nodes 1106 (1.1e+03) #states 64,650,180,611,639,699,476,331,863,474,176 (31)
starting MCC model checker
--------------------------
checking: AG [p_1_35<=1]
normalized: ~ [E [true U ~ [p_1_35<=1]]]
abstracting: (p_1_35<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [1<=r_0_65]
normalized: ~ [E [true U ~ [1<=r_0_65]]]
abstracting: (1<=r_0_65)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.415sec
checking: AG [p_1_53<=1]
normalized: ~ [E [true U ~ [p_1_53<=1]]]
abstracting: (p_1_53<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [p_1_60<=p_1_20]]
normalized: E [true U ~ [p_1_60<=p_1_20]]
abstracting: (p_1_60<=p_1_20)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.454sec
checking: AG [p_0_20<=r_0_73]
normalized: ~ [E [true U ~ [p_0_20<=r_0_73]]]
abstracting: (p_0_20<=r_0_73)
states: 51,656,761,959,300,348,110,990,655,619,072 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.259sec
checking: EF [~ [p_1_12<=p_0_38]]
normalized: E [true U ~ [p_1_12<=p_0_38]]
abstracting: (p_1_12<=p_0_38)
states: 60,213,403,510,840,896,571,093,402,255,360 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.069sec
checking: AG [p_0_26<=p_1_26]
normalized: ~ [E [true U ~ [p_0_26<=p_1_26]]]
abstracting: (p_0_26<=p_1_26)
states: 40,881,731,857,360,398,198,268,678,373,376 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: AG [[~ [1<=r_1_76] | p_0_66<=p_0_18]]
normalized: ~ [E [true U ~ [[~ [1<=r_1_76] | p_0_66<=p_0_18]]]]
abstracting: (p_0_66<=p_0_18)
states: 59,104,209,235,641,195,844,783,786,950,656 (31)
abstracting: (1<=r_1_76)
states: 39,930,993,907,189,226,147,146,150,969,344 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.577sec
checking: EF [~ [[p_0_10<=r_0_49 & 1<=r_0_15]]]
normalized: E [true U ~ [[p_0_10<=r_0_49 & 1<=r_0_15]]]
abstracting: (1<=r_0_15)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p_0_10<=r_0_49)
states: 50,072,198,709,015,061,359,119,776,612,352 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.985sec
checking: AG [[p_1_98<=r_1_36 & p_0_64<=p_1_79]]
normalized: ~ [E [true U ~ [[p_1_98<=r_1_36 & p_0_64<=p_1_79]]]]
abstracting: (p_0_64<=p_1_79)
states: 55,459,713,759,985,036,315,480,765,235,200 (31)
abstracting: (p_1_98<=r_1_36)
states: 58,628,840,260,555,609,819,222,523,248,640 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.386sec
checking: EF [[[[p_1_40<=1 | r_0_6<=0] & ~ [p_0_47<=r_0_5]] & [[1<=r_1_12 & p_1_78<=p_1_2] | r_0_0<=0]]]
normalized: E [true U [[[1<=r_1_12 & p_1_78<=p_1_2] | r_0_0<=0] & [~ [p_0_47<=r_0_5] & [p_1_40<=1 | r_0_6<=0]]]]
abstracting: (r_0_6<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (p_1_40<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_0_47<=r_0_5)
states: 56,093,539,060,099,151,016,229,116,837,888 (31)
abstracting: (r_0_0<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (p_1_78<=p_1_2)
states: 39,930,993,907,189,226,147,146,150,969,344 (31)
abstracting: (1<=r_1_12)
states: 60,213,403,510,840,896,571,093,402,255,360 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.257sec
checking: EF [[[~ [1<=p_0_14] | ~ [[[~ [1<=r_1_92] | ~ [1<=p_0_51]] & [1<=r_0_17 | [[r_1_86<=0 & [p_0_97<=r_0_69 & p_1_90<=1]] | ~ [1<=p_1_25]]]]]] & ~ [p_1_10<=1]]]
normalized: E [true U [~ [p_1_10<=1] & [~ [[[[~ [1<=p_1_25] | [[p_0_97<=r_0_69 & p_1_90<=1] & r_1_86<=0]] | 1<=r_0_17] & [~ [1<=p_0_51] | ~ [1<=r_1_92]]]] | ~ [1<=p_0_14]]]]
abstracting: (1<=p_0_14)
states: 27,571,400,554,963,989,482,553,294,716,928 (31)
abstracting: (1<=r_1_92)
states: 34,860,391,506,276,308,541,159,338,147,840 (31)
abstracting: (1<=p_0_51)
states: 15,845,632,502,852,867,518,708,790,067,200 (31)
abstracting: (1<=r_0_17)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (r_1_86<=0)
states: 27,888,313,205,021,046,832,927,470,518,272 (31)
abstracting: (p_1_90<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_0_97<=r_0_69)
states: 64,016,355,311,525,584,775,583,511,871,488 (31)
abstracting: (1<=p_1_25)
states: 8,556,641,551,540,548,460,102,746,636,288 (30)
abstracting: (p_1_10<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [[[~ [[[~ [1<=r_0_24] & [p_0_62<=p_0_40 | p_0_49<=1]] | ~ [[r_1_50<=0 & 1<=p_0_87]]]] | [[1<=p_0_50 | ~ [p_1_66<=p_1_24]] & p_0_67<=1]] & ~ [[~ [[[[[1<=p_0_65 | p_1_84<=p_0_74] & ~ [p_0_99<=0]] | ~ [p_1_97<=1]] & ~ [[1<=r_0_9 & ~ [1<=p_1_67]]]]] & ~ [[~ [p_0_64<=r_0_33] & [~ [r_0_36<=1] & 1<=r_0_2]]]]]]]
normalized: E [true U [~ [[~ [[[~ [r_0_36<=1] & 1<=r_0_2] & ~ [p_0_64<=r_0_33]]] & ~ [[~ [[~ [1<=p_1_67] & 1<=r_0_9]] & [~ [p_1_97<=1] | [~ [p_0_99<=0] & [1<=p_0_65 | p_1_84<=p_0_74]]]]]]] & [[[~ [p_1_66<=p_1_24] | 1<=p_0_50] & p_0_67<=1] | ~ [[~ [[r_1_50<=0 & 1<=p_0_87]] | [[p_0_62<=p_0_40 | p_0_49<=1] & ~ [1<=r_0_24]]]]]]]
abstracting: (1<=r_0_24)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p_0_49<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_0_62<=p_0_40)
states: 58,470,383,935,527,081,144,035,435,347,968 (31)
abstracting: (1<=p_0_87)
states: 4,436,777,100,798,802,905,238,461,218,816 (30)
abstracting: (r_1_50<=0)
states: 16,479,457,802,966,982,219,457,141,669,888 (31)
abstracting: (p_0_67<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=p_0_50)
states: 16,162,545,152,909,924,869,082,965,868,544 (31)
abstracting: (p_1_66<=p_1_24)
states: 47,219,984,858,501,545,205,752,194,400,256 (31)
abstracting: (p_1_84<=p_0_74)
states: 39,138,712,282,046,582,771,210,711,465,984 (31)
abstracting: (1<=p_0_65)
states: 11,408,855,402,054,064,613,470,328,848,384 (31)
abstracting: (p_0_99<=0)
states: 64,016,355,311,525,584,775,583,511,871,488 (31)
abstracting: (p_1_97<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=r_0_9)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p_1_67)
states: 21,866,972,853,936,957,175,818,130,292,736 (31)
abstracting: (p_0_64<=r_0_33)
states: 58,787,296,585,584,138,494,409,611,149,312 (31)
abstracting: (1<=r_0_2)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (r_0_36<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.595sec
checking: EF [~ [[[r_1_46<=r_0_17 | p_1_29<=r_1_42] & [~ [[p_0_18<=p_0_63 & [1<=r_0_16 & ~ [[r_1_82<=r_1_24 & 1<=p_0_6]]]]] | [[[[~ [r_0_6<=0] & [p_0_79<=1 & p_0_34<=r_0_92]] & [~ [p_1_2<=p_0_29] & [p_1_58<=r_1_32 & p_1_72<=0]]] | ~ [[r_1_82<=0 | 1<=p_0_97]]] | r_0_72<=1]]]]]
normalized: E [true U ~ [[[r_1_46<=r_0_17 | p_1_29<=r_1_42] & [[[[[[p_1_58<=r_1_32 & p_1_72<=0] & ~ [p_1_2<=p_0_29]] & [~ [r_0_6<=0] & [p_0_79<=1 & p_0_34<=r_0_92]]] | ~ [[r_1_82<=0 | 1<=p_0_97]]] | r_0_72<=1] | ~ [[[~ [[r_1_82<=r_1_24 & 1<=p_0_6]] & 1<=r_0_16] & p_0_18<=p_0_63]]]]]]
abstracting: (p_0_18<=p_0_63)
states: 44,367,771,007,988,029,052,384,612,188,160 (31)
abstracting: (1<=r_0_16)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p_0_6)
states: 30,106,701,755,420,448,285,546,701,127,680 (31)
abstracting: (r_1_82<=r_1_24)
states: 60,530,316,160,897,953,921,467,578,056,704 (31)
abstracting: (r_0_72<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=p_0_97)
states: 1,267,650,600,228,229,401,496,703,205,376 (30)
abstracting: (r_1_82<=0)
states: 26,620,662,604,792,817,431,430,767,312,896 (31)
abstracting: (p_0_34<=r_0_92)
states: 53,875,150,509,699,749,563,609,886,228,480 (31)
abstracting: (p_0_79<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (r_0_6<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (p_1_2<=p_0_29)
states: 63,382,530,011,411,470,074,835,160,268,800 (31)
abstracting: (p_1_72<=0)
states: 41,198,644,507,417,455,548,642,854,174,720 (31)
abstracting: (p_1_58<=r_1_32)
states: 59,262,665,560,669,724,519,970,874,851,328 (31)
abstracting: (p_1_29<=r_1_42)
states: 59,738,034,535,755,310,545,532,138,553,344 (31)
abstracting: (r_1_46<=r_0_17)
states: 39,772,537,582,160,697,471,959,063,068,672 (31)
-> the formula is TRUE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.206sec
checking: AG [~ [[[~ [p_0_68<=0] & ~ [[[[[[r_1_12<=p_1_8 | r_1_63<=r_0_70] | ~ [r_0_67<=1]] | [[1<=p_1_96 & p_1_60<=1] | ~ [1<=p_0_44]]] | ~ [p_1_5<=0]] & ~ [p_0_40<=r_1_50]]]] | [[~ [[[1<=r_0_87 | p_0_80<=0] & ~ [r_1_18<=1]]] & [[~ [[~ [r_1_87<=1] | 1<=r_1_70]] & r_0_23<=0] | ~ [[~ [r_0_77<=1] | 1<=r_0_48]]]] | ~ [[[~ [r_0_26<=p_0_50] | p_0_44<=r_1_20] | ~ [[[[1<=p_0_48 | r_1_61<=r_1_30] & r_1_38<=r_0_70] | ~ [p_0_11<=1]]]]]]]]]
normalized: ~ [E [true U [[~ [[[~ [r_0_26<=p_0_50] | p_0_44<=r_1_20] | ~ [[[[1<=p_0_48 | r_1_61<=r_1_30] & r_1_38<=r_0_70] | ~ [p_0_11<=1]]]]] | [~ [[~ [r_1_18<=1] & [1<=r_0_87 | p_0_80<=0]]] & [[~ [[~ [r_1_87<=1] | 1<=r_1_70]] & r_0_23<=0] | ~ [[~ [r_0_77<=1] | 1<=r_0_48]]]]] | [~ [p_0_68<=0] & ~ [[[[[[1<=p_1_96 & p_1_60<=1] | ~ [1<=p_0_44]] | [~ [r_0_67<=1] | [r_1_12<=p_1_8 | r_1_63<=r_0_70]]] | ~ [p_1_5<=0]] & ~ [p_0_40<=r_1_50]]]]]]]
abstracting: (p_0_40<=r_1_50)
states: 62,907,161,036,325,884,049,273,896,566,784 (31)
abstracting: (p_1_5<=0)
states: 62,431,792,061,240,298,023,712,632,864,768 (31)
abstracting: (r_1_63<=r_0_70)
states: 42,307,838,782,617,156,274,952,469,479,424 (31)
abstracting: (r_1_12<=p_1_8)
states: 6,021,340,351,084,089,657,109,340,225,536 (30)
abstracting: (r_0_67<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=p_0_44)
states: 18,064,021,053,252,268,971,328,020,676,608 (31)
abstracting: (p_1_60<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=p_1_96)
states: 31,057,439,705,591,620,336,669,228,531,712 (31)
abstracting: (p_0_68<=0)
states: 54,192,063,159,756,806,913,984,062,029,824 (31)
abstracting: (1<=r_0_48)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (r_0_77<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (r_0_23<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (1<=r_1_70)
states: 41,832,469,807,531,570,249,391,205,777,408 (31)
abstracting: (r_1_87<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_0_80<=0)
states: 57,995,014,960,441,495,118,474,171,645,952 (31)
abstracting: (1<=r_0_87)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (r_1_18<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_0_11<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (r_1_38<=r_0_70)
states: 38,346,430,656,903,939,395,275,271,962,624 (31)
abstracting: (r_1_61<=r_1_30)
states: 59,579,578,210,726,781,870,345,050,652,672 (31)
abstracting: (1<=p_0_48)
states: 16,796,370,453,024,039,569,831,317,471,232 (31)
abstracting: (p_0_44<=r_1_20)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (r_0_26<=p_0_50)
states: 40,723,275,532,331,869,523,081,590,472,704 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.643sec
checking: AG [~ [[r_0_80<=0 | [[[[[1<=p_1_8 & [[r_1_24<=r_1_99 | p_0_81<=0] & ~ [1<=r_1_55]]] | [1<=p_0_80 & [[1<=r_0_24 & 1<=r_0_34] | [1<=r_0_28 & p_1_39<=p_0_34]]]] | ~ [[[p_0_96<=0 & [1<=r_0_75 & p_1_87<=p_0_6]] & [[1<=r_0_93 & p_1_64<=p_0_90] & [p_1_46<=0 | r_0_1<=p_1_33]]]]] | 1<=p_1_24] & [~ [[[~ [r_0_76<=p_1_24] | [r_0_57<=1 | [1<=p_1_57 & p_0_4<=p_1_77]]] | 1<=p_0_95]] & [1<=p_1_40 | ~ [r_1_19<=1]]]]]]]
normalized: ~ [E [true U [[[~ [[[[[1<=p_1_57 & p_0_4<=p_1_77] | r_0_57<=1] | ~ [r_0_76<=p_1_24]] | 1<=p_0_95]] & [~ [r_1_19<=1] | 1<=p_1_40]] & [[~ [[[[1<=r_0_75 & p_1_87<=p_0_6] & p_0_96<=0] & [[1<=r_0_93 & p_1_64<=p_0_90] & [p_1_46<=0 | r_0_1<=p_1_33]]]] | [[[[1<=r_0_24 & 1<=r_0_34] | [1<=r_0_28 & p_1_39<=p_0_34]] & 1<=p_0_80] | [[[r_1_24<=r_1_99 | p_0_81<=0] & ~ [1<=r_1_55]] & 1<=p_1_8]]] | 1<=p_1_24]] | r_0_80<=0]]]
abstracting: (r_0_80<=0)
states: 32,642,002,955,876,907,088,540,107,538,432 (31)
abstracting: (1<=p_1_24)
states: 8,239,728,901,483,491,109,728,570,834,944 (30)
abstracting: (1<=p_1_8)
states: 3,169,126,500,570,573,503,741,758,013,440 (30)
abstracting: (1<=r_1_55)
states: 46,586,159,558,387,430,505,003,842,797,568 (31)
abstracting: (p_0_81<=0)
states: 58,311,927,610,498,552,468,848,347,447,296 (31)
abstracting: (r_1_24<=r_1_99)
states: 36,761,867,406,618,652,643,404,392,955,904 (31)
abstracting: (1<=p_0_80)
states: 6,655,165,651,198,204,357,857,691,828,224 (30)
abstracting: (p_1_39<=p_0_34)
states: 52,607,499,909,471,520,162,113,183,023,104 (31)
abstracting: (1<=r_0_28)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=r_0_34)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=r_0_24)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (r_0_1<=p_1_33)
states: 38,029,518,006,846,882,044,901,096,161,280 (31)
abstracting: (p_1_46<=0)
states: 49,438,373,408,900,946,658,371,425,009,664 (31)
abstracting: (p_1_64<=p_0_90)
states: 43,733,945,707,873,914,351,636,260,585,472 (31)
abstracting: (1<=r_0_93)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p_0_96<=0)
states: 63,065,617,361,354,412,724,460,984,467,456 (31)
abstracting: (p_1_87<=p_0_6)
states: 49,438,373,408,900,946,658,371,425,009,664 (31)
abstracting: (1<=r_0_75)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p_1_40)
states: 13,310,331,302,396,408,715,715,383,656,448 (31)
abstracting: (r_1_19<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (1<=p_0_95)
states: 1,901,475,900,342,344,102,245,054,808,064 (30)
abstracting: (r_0_76<=p_1_24)
states: 36,761,867,406,618,652,643,404,392,955,904 (31)
abstracting: (r_0_57<=1)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_0_4<=p_1_77)
states: 45,635,421,608,216,258,453,881,315,393,536 (31)
abstracting: (1<=p_1_57)
states: 18,697,846,353,366,383,672,076,372,279,296 (31)
-> the formula is FALSE
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.202sec
totally nodes used: 6293715 (6.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8639383 25745588 34384971
used/not used/entry size/cache size: 25328800 41780064 16 1024MB
basic ops cache: hits/miss/sum: 1554163 5050292 6604455
used/not used/entry size/cache size: 5432690 11344526 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 11614 40761 52375
used/not used/entry size/cache size: 40666 8347942 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61427921
1 5137665
2 481880
3 54156
4 6453
5 726
6 61
7 2
8 0
9 0
>= 10 0
Total processing time: 0m14.895sec
BK_STOP 1678942820549
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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.004sec
iterations count:35849 (177), effective:10100 (50)
initing FirstDep: 0m 0.000sec
iterations count:2818 (13), effective:696 (3)
iterations count:3506 (17), effective:881 (4)
iterations count:2639 (13), effective:704 (3)
iterations count:15780 (78), effective:4004 (19)
iterations count:1418 (7), effective:405 (2)
iterations count:7788 (38), effective:2503 (12)
iterations count:19655 (97), effective:5030 (24)
iterations count:3086 (15), effective:775 (3)
iterations count:4149 (20), effective:1312 (6)
iterations count:15900 (78), effective:5211 (25)
iterations count:24272 (120), effective:6233 (30)
iterations count:4325 (21), effective:1111 (5)
iterations count:1273 (6), effective:291 (1)
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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is ResAllocation-PT-R100C002, 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 r321-tall-167889192600774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "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
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;