About the Execution of Irma.full for ClientsAndServers-PT-N0020P2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
14239.400 | 465276.00 | 428528.00 | 1694.40 | FFFFFFF?FFTFFTTT | 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)
......................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is ClientsAndServers-PT-N0020P2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260300035
=====================================================================
--------------------
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 ClientsAndServers-PT-N0020P2-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527362165374
BK_STOP 1527362630650
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ClientsAndServers-PT-N0020P2 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 363834, 'Memory': 8101.65, 'Tool': 'lola'}, {'Time': 3512295, 'Memory': 7611.98, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ClientsAndServers-PT-N0020P2...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ClientsAndServers-PT-N0020P2: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0020P2: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ ClientsAndServers-PT-N0020P2 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: A (X (F (G (X ((1 <= SF)))))) : A (G ((F ((CA <= Ci)) U G ((3 <= CA))))) : A (X (X (G ((1 <= MpG))))) : A (X (G (X (X ((MpA <= MwU)))))) : A (F ((G ((Cb <= StF)) U (Uf <= CR)))) : A (X (((SpG <= CwG) U F ((Si <= SwA))))) : A (G ((F ((Si <= SF)) U X ((3 <= CR))))) : A (G (F (F (X ((1 <= MwU)))))) : A ((F (F ((3 <= CF))) U G (F ((MpA <= SG))))) : A ((3 <= SpA)) : A (X (((MtF <= CR) U (SpG <= StF)))) : A ((Ci <= MtF)) : A (F (F (X (F ((2 <= SwG)))))) : A (F ((CR <= SpG))) : A (F (G ((1 <= Mi)))) : A (F (X ((2 <= Uf))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((1 <= SF))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X ((1 <= SF))))))
lola: processed formula: A (X (F (G (X ((1 <= SF))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1146 markings, 1147 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((CA <= Ci)) U G ((3 <= CA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((CA <= Ci)) U G ((3 <= CA)))))
lola: processed formula: A (G ((F ((CA <= Ci)) U G ((3 <= CA)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 812 markings, 812 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= MpG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G ((1 <= MpG)))))
lola: processed formula: A (X (X (G ((1 <= MpG)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1145 markings, 1145 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (X ((MpA <= MwU))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X ((MpA <= MwU))))))
lola: processed formula: A (X (G (X (X ((MpA <= MwU))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19259 markings, 30396 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Cb <= StF)) U (Uf <= CR))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((Cb <= StF)) U (Uf <= CR))))
lola: processed formula: A (F ((G ((Cb <= StF)) U (Uf <= CR))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1246 markings, 1246 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((SpG <= CwG) U F ((Si <= SwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((SpG <= CwG) U F ((Si <= SwA)))))
lola: processed formula: A (X (((SpG <= CwG) U F ((Si <= SwA)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1359 markings, 1410 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((Si <= SF)) U X ((3 <= CR)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((Si <= SF)) U X ((3 <= CR)))))
lola: processed formula: A (G ((F ((Si <= SF)) U X ((3 <= CR)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1439 markings, 1534 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (X ((1 <= MwU))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((1 <= MwU)))))
lola: processed formula: A (G (F (X ((1 <= MwU)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1984865 markings, 5461609 edges, 396973 markings/sec, 0 secs
lola: 3670540 markings, 10665120 edges, 337135 markings/sec, 5 secs
lola: 5011998 markings, 15120510 edges, 268292 markings/sec, 10 secs
lola: 6436656 markings, 19853640 edges, 284932 markings/sec, 15 secs
lola: 7844608 markings, 24572718 edges, 281590 markings/sec, 20 secs
lola: 9241419 markings, 29282453 edges, 279362 markings/sec, 25 secs
lola: 10629232 markings, 33960083 edges, 277563 markings/sec, 30 secs
lola: 12028296 markings, 38677427 edges, 279813 markings/sec, 35 secs
lola: 13366374 markings, 43406662 edges, 267616 markings/sec, 40 secs
lola: 14392249 markings, 47360122 edges, 205175 markings/sec, 45 secs
lola: 15416004 markings, 51026340 edges, 204751 markings/sec, 50 secs
lola: 16570381 markings, 55177666 edges, 230875 markings/sec, 55 secs
lola: 17781697 markings, 59435753 edges, 242263 markings/sec, 60 secs
lola: 18958791 markings, 63621338 edges, 235419 markings/sec, 65 secs
lola: 20116781 markings, 67778924 edges, 231598 markings/sec, 70 secs
lola: 21276738 markings, 71948009 edges, 231991 markings/sec, 75 secs
lola: 22433410 markings, 76100769 edges, 231334 markings/sec, 80 secs
lola: 23595943 markings, 80277111 edges, 232507 markings/sec, 85 secs
lola: 24730737 markings, 84394383 edges, 226959 markings/sec, 90 secs
lola: 25881193 markings, 88528714 edges, 230091 markings/sec, 95 secs
lola: 27012692 markings, 92634115 edges, 226300 markings/sec, 100 secs
lola: 28147550 markings, 96750008 edges, 226972 markings/sec, 105 secs
lola: 29279701 markings, 100857802 edges, 226430 markings/sec, 110 secs
lola: 30414110 markings, 104975310 edges, 226882 markings/sec, 115 secs
lola: 31544523 markings, 109045359 edges, 226083 markings/sec, 120 secs
lola: 32689278 markings, 113191487 edges, 228951 markings/sec, 125 secs
lola: 33837418 markings, 117355742 edges, 229628 markings/sec, 130 secs
lola: 34990547 markings, 121540004 edges, 230626 markings/sec, 135 secs
lola: 36151485 markings, 125757920 edges, 232188 markings/sec, 140 secs
lola: 37277781 markings, 129883169 edges, 225259 markings/sec, 145 secs
lola: 38424012 markings, 134041308 edges, 229246 markings/sec, 150 secs
lola: 39568206 markings, 138195436 edges, 228839 markings/sec, 155 secs
lola: 40717249 markings, 142363552 edges, 229809 markings/sec, 160 secs
lola: 41642379 markings, 146725512 edges, 185026 markings/sec, 165 secs
lola: 42502765 markings, 150705764 edges, 172077 markings/sec, 170 secs
lola: 43374603 markings, 154032653 edges, 174368 markings/sec, 175 secs
lola: 44240792 markings, 157364263 edges, 173238 markings/sec, 180 secs
lola: 45105178 markings, 160689483 edges, 172877 markings/sec, 185 secs
lola: 45957467 markings, 163990906 edges, 170458 markings/sec, 190 secs
lola: 46810831 markings, 167290478 edges, 170673 markings/sec, 195 secs
lola: 47661873 markings, 170591145 edges, 170208 markings/sec, 200 secs
lola: 48522668 markings, 173915276 edges, 172159 markings/sec, 205 secs
lola: 49376714 markings, 177228047 edges, 170809 markings/sec, 210 secs
lola: 50210774 markings, 180574280 edges, 166812 markings/sec, 215 secs
lola: 51275727 markings, 184859606 edges, 212991 markings/sec, 220 secs
lola: 52395058 markings, 188938904 edges, 223866 markings/sec, 225 secs
lola: 53445111 markings, 192820782 edges, 210011 markings/sec, 230 secs
lola: 54449809 markings, 196614713 edges, 200940 markings/sec, 235 secs
lola: 55458232 markings, 200416376 edges, 201685 markings/sec, 240 secs
lola: 56463460 markings, 204214791 edges, 201046 markings/sec, 245 secs
lola: 57468949 markings, 208015038 edges, 201098 markings/sec, 250 secs
lola: 58481793 markings, 211835176 edges, 202569 markings/sec, 255 secs
lola: 59486853 markings, 215641450 edges, 201012 markings/sec, 260 secs
lola: 60434008 markings, 219325095 edges, 189431 markings/sec, 265 secs
lola: 61438339 markings, 223112611 edges, 200866 markings/sec, 270 secs
lola: 62451068 markings, 226940339 edges, 202546 markings/sec, 275 secs
lola: 63405077 markings, 230658118 edges, 190802 markings/sec, 280 secs
lola: 64409228 markings, 234443252 edges, 200830 markings/sec, 285 secs
lola: 65387746 markings, 238216948 edges, 195704 markings/sec, 290 secs
lola: 66363321 markings, 241940959 edges, 195115 markings/sec, 295 secs
lola: 67388492 markings, 245820464 edges, 205034 markings/sec, 300 secs
lola: 68327201 markings, 249468331 edges, 187742 markings/sec, 305 secs
lola: 69352391 markings, 253341053 edges, 205038 markings/sec, 310 secs
lola: 70297029 markings, 257020103 edges, 188928 markings/sec, 315 secs
lola: 71330928 markings, 260929717 edges, 206780 markings/sec, 320 secs
lola: 72257059 markings, 264531750 edges, 185226 markings/sec, 325 secs
lola: 73270054 markings, 268384116 edges, 202599 markings/sec, 330 secs
lola: 74202548 markings, 271996160 edges, 186499 markings/sec, 335 secs
lola: 75150849 markings, 275683466 edges, 189660 markings/sec, 340 secs
lola: 76143774 markings, 279433075 edges, 198585 markings/sec, 345 secs
lola: 77092190 markings, 283131235 edges, 189683 markings/sec, 350 secs
lola: 78093087 markings, 286904385 edges, 200179 markings/sec, 355 secs
lola: 79043834 markings, 290610632 edges, 190149 markings/sec, 360 secs
lola: 80041658 markings, 294419674 edges, 199565 markings/sec, 365 secs
lola: 80989275 markings, 298064096 edges, 189523 markings/sec, 370 secs
lola: 81928635 markings, 301725497 edges, 187872 markings/sec, 375 secs
lola: 82928207 markings, 305502139 edges, 199914 markings/sec, 380 secs
lola: 83870456 markings, 309168384 edges, 188450 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((3 <= CF))) U G (F ((MpA <= SG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((3 <= CF)) U G (F ((MpA <= SG)))))
lola: processed formula: A ((F ((3 <= CF)) U G (F ((MpA <= SG)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2562 markings, 2971 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= SpA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= SpA)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((MtF <= CR) U (SpG <= StF))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((MtF <= CR) U (SpG <= StF))))
lola: processed formula: A (X (((MtF <= CR) U (SpG <= StF))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Ci <= MtF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ci <= MtF)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((2 <= SwG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((2 <= SwG)))))
lola: processed formula: A (F (X (F ((2 <= SwG)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1417 markings, 1417 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CR <= SpG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CR <= SpG)))
lola: processed formula: A (F ((CR <= SpG)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= Mi))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((1 <= Mi))))
lola: processed formula: A (F (G ((1 <= Mi))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3619374 markings, 4309330 edges, 723875 markings/sec, 0 secs
lola: 7203100 markings, 8582239 edges, 716745 markings/sec, 5 secs
lola: 10755920 markings, 12819834 edges, 710564 markings/sec, 10 secs
lola: 13461693 markings, 16421890 edges, 541155 markings/sec, 15 secs
lola: 15580609 markings, 19971691 edges, 423783 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 15678966 markings, 20137100 edges
lola: ========================================
lola: subprocess 15 will run for 3121 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= Uf))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= Uf))))
lola: processed formula: A (F (X ((2 <= Uf))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown no no yes no no yes yes yes
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P2-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="ClientsAndServers-PT-N0020P2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
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/ClientsAndServers-PT-N0020P2.tgz
mv ClientsAndServers-PT-N0020P2 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 irma4mcc-full"
echo " Input is ClientsAndServers-PT-N0020P2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-152732260300035"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;