About the Execution of M4M.struct for ClientsAndServers-PT-N2000P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15914.450 | 775960.00 | 714247.00 | 5269.20 | FT?FFTTF??FFFFFF | 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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K 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 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 mcc4mcc-structural
Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266200051
=====================================================================
--------------------
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-N2000P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527421072385
BK_STOP 1527421848345
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ClientsAndServers-PT-N2000P0 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': 667206, 'Memory': 15244.59, 'Tool': 'lola'}, {'Time': 3510197, 'Memory': 14030.67, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ClientsAndServers-PT-N2000P0...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ClientsAndServers-PT-N2000P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N2000P0: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ ClientsAndServers-PT-N2000P0 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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-N2000P0-LTLCardinality.task
lola: A ((F ((2 <= SA)) U (3 <= CR))) : A ((StR <= SG)) : A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi)))) : A ((3 <= CA)) : A (F (F (F (G ((SwA <= Cb)))))) : A ((StR <= MpA)) : A ((CF <= CR)) : A (G ((SpG <= SpA))) : A (F (G (X (X ((1 <= Mi)))))) : A (F (G (X (F ((1 <= CwA)))))) : A ((G ((Cb <= CG)) U F (G ((MwU <= SG))))) : A (X (X (G (X ((Ci <= CG)))))) : A ((2 <= CwA)) : A ((Ci <= StR)) : A (G (X (G ((1 <= SpA))))) : A (F (G (((MpG <= SF) U (2 <= CF)))))
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 ((F ((2 <= SA)) U (3 <= CR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= SA)) U (3 <= CR)))
lola: processed formula: A ((F ((2 <= SA)) U (3 <= CR)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 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: 100001 markings, 100001 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((StR <= SG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (StR <= SG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi))))
lola: processed formula: A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 2354160 markings, 5135593 edges, 470832 markings/sec, 0 secs
lola: 4420137 markings, 10048311 edges, 413195 markings/sec, 5 secs
lola: 6458891 markings, 14916610 edges, 407751 markings/sec, 10 secs
lola: 8419917 markings, 19659363 edges, 392205 markings/sec, 15 secs
lola: 10369764 markings, 24380176 edges, 389969 markings/sec, 20 secs
lola: 12315165 markings, 29085881 edges, 389080 markings/sec, 25 secs
lola: 14235741 markings, 33754183 edges, 384115 markings/sec, 30 secs
lola: 16020749 markings, 38175756 edges, 357002 markings/sec, 35 secs
lola: 17968411 markings, 42861484 edges, 389532 markings/sec, 40 secs
lola: 19780780 markings, 47301980 edges, 362474 markings/sec, 45 secs
lola: 21651266 markings, 51875478 edges, 374097 markings/sec, 50 secs
lola: 23373973 markings, 56175171 edges, 344541 markings/sec, 55 secs
lola: 25326006 markings, 60874038 edges, 390407 markings/sec, 60 secs
lola: 27076373 markings, 65251508 edges, 350073 markings/sec, 65 secs
lola: 29003116 markings, 69922237 edges, 385349 markings/sec, 70 secs
lola: 30817942 markings, 74396605 edges, 362965 markings/sec, 75 secs
lola: 32519035 markings, 78674321 edges, 340219 markings/sec, 80 secs
lola: 34428100 markings, 83286611 edges, 381813 markings/sec, 85 secs
lola: 36230263 markings, 87728985 edges, 360433 markings/sec, 90 secs
lola: 37918676 markings, 91976065 edges, 337683 markings/sec, 95 secs
lola: 39771629 markings, 96477602 edges, 370591 markings/sec, 100 secs
lola: 41620143 markings, 101020255 edges, 369703 markings/sec, 105 secs
lola: 43301236 markings, 105219497 edges, 336219 markings/sec, 110 secs
lola: 44944162 markings, 109371832 edges, 328585 markings/sec, 115 secs
lola: 46652760 markings, 113494909 edges, 341720 markings/sec, 120 secs
lola: 48540133 markings, 118145076 edges, 377475 markings/sec, 125 secs
lola: 50222254 markings, 122331728 edges, 336424 markings/sec, 130 secs
lola: 51822291 markings, 126366746 edges, 320007 markings/sec, 135 secs
lola: 53415547 markings, 130411330 edges, 318651 markings/sec, 140 secs
lola: 55446812 markings, 135279312 edges, 406253 markings/sec, 145 secs
lola: 57279962 markings, 139804388 edges, 366630 markings/sec, 150 secs
lola: 58939601 markings, 143960992 edges, 331928 markings/sec, 155 secs
lola: 60587336 markings, 148122349 edges, 329547 markings/sec, 160 secs
lola: 62212333 markings, 152252936 edges, 324999 markings/sec, 165 secs
lola: 64190609 markings, 156983508 edges, 395655 markings/sec, 170 secs
lola: 66024339 markings, 161525193 edges, 366746 markings/sec, 175 secs
lola: 67767852 markings, 165870990 edges, 348703 markings/sec, 180 secs
lola: 69432159 markings, 170067297 edges, 332861 markings/sec, 185 secs
lola: 71097873 markings, 174289293 edges, 333143 markings/sec, 190 secs
lola: 72766491 markings, 178532314 edges, 333724 markings/sec, 195 secs
lola: 74781925 markings, 183323877 edges, 403087 markings/sec, 200 secs
lola: 76611469 markings, 187861370 edges, 365909 markings/sec, 205 secs
lola: 78349882 markings, 192198762 edges, 347683 markings/sec, 210 secs
lola: 80017422 markings, 196403763 edges, 333508 markings/sec, 215 secs
lola: 81690507 markings, 200643843 edges, 334617 markings/sec, 220 secs
lola: 83348290 markings, 204857139 edges, 331557 markings/sec, 225 secs
lola: 85140583 markings, 209164094 edges, 358459 markings/sec, 230 secs
lola: 86954474 markings, 213647137 edges, 362778 markings/sec, 235 secs
lola: 88660554 markings, 217884227 edges, 341216 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= CA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= CA)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (G ((SwA <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((SwA <= Cb))))
lola: processed formula: A (F (G ((SwA <= Cb))))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 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: 72015 markings, 72016 edges
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((StR <= MpA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (StR <= MpA)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((CF <= CR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CF <= CR)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SpG <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((1 <= Mi))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((1 <= Mi))))))
lola: processed formula: A (F (G (X (X ((1 <= Mi))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 3473427 markings, 6424241 edges, 694685 markings/sec, 0 secs
lola: 6248696 markings, 12879274 edges, 555054 markings/sec, 5 secs
lola: 8868073 markings, 18623108 edges, 523875 markings/sec, 10 secs
lola: 11284810 markings, 24470341 edges, 483347 markings/sec, 15 secs
lola: 13690194 markings, 30221390 edges, 481077 markings/sec, 20 secs
lola: 16652079 markings, 37162440 edges, 592377 markings/sec, 25 secs
lola: 19141675 markings, 43508538 edges, 497919 markings/sec, 30 secs
lola: 21656708 markings, 49597241 edges, 503007 markings/sec, 35 secs
lola: 23833521 markings, 55123605 edges, 435363 markings/sec, 40 secs
lola: 26162405 markings, 60953611 edges, 465777 markings/sec, 45 secs
lola: 28587715 markings, 66563350 edges, 485062 markings/sec, 50 secs
lola: 30959367 markings, 72447074 edges, 474330 markings/sec, 55 secs
lola: 33238493 markings, 78246212 edges, 455825 markings/sec, 60 secs
lola: 35372127 markings, 84157293 edges, 426727 markings/sec, 65 secs
lola: 37589897 markings, 89918093 edges, 443554 markings/sec, 70 secs
lola: 39821453 markings, 95898298 edges, 446311 markings/sec, 75 secs
lola: 42028014 markings, 102273440 edges, 441312 markings/sec, 80 secs
lola: 44245613 markings, 108543023 edges, 443520 markings/sec, 85 secs
lola: 46595649 markings, 114473145 edges, 470007 markings/sec, 90 secs
lola: 49031410 markings, 120220572 edges, 487152 markings/sec, 95 secs
lola: 51100413 markings, 125505089 edges, 413801 markings/sec, 100 secs
lola: 53112886 markings, 130861020 edges, 402495 markings/sec, 105 secs
lola: 54994230 markings, 136552549 edges, 376269 markings/sec, 110 secs
lola: 57123663 markings, 141913512 edges, 425887 markings/sec, 115 secs
lola: 59267219 markings, 147895203 edges, 428711 markings/sec, 120 secs
lola: 60981477 markings, 153342742 edges, 342852 markings/sec, 125 secs
lola: 63003005 markings, 159283031 edges, 404306 markings/sec, 130 secs
lola: 64946073 markings, 164849978 edges, 388614 markings/sec, 135 secs
lola: 66831424 markings, 170701564 edges, 377070 markings/sec, 140 secs
lola: 69196120 markings, 176241991 edges, 472939 markings/sec, 145 secs
lola: 71622124 markings, 183078322 edges, 485201 markings/sec, 150 secs
lola: 73847813 markings, 189480754 edges, 445138 markings/sec, 155 secs
lola: 75804043 markings, 194773516 edges, 391246 markings/sec, 160 secs
lola: 77767653 markings, 200234296 edges, 392722 markings/sec, 165 secs
lola: 79968265 markings, 205720839 edges, 440122 markings/sec, 170 secs
lola: 82050653 markings, 211204557 edges, 416478 markings/sec, 175 secs
lola: 83913387 markings, 216707313 edges, 372547 markings/sec, 180 secs
lola: 85830762 markings, 222386175 edges, 383475 markings/sec, 185 secs
lola: 87647708 markings, 227679410 edges, 363389 markings/sec, 190 secs
lola: 90081853 markings, 233249328 edges, 486829 markings/sec, 195 secs
lola: 92065252 markings, 239251903 edges, 396680 markings/sec, 200 secs
lola: 94133448 markings, 244726393 edges, 413639 markings/sec, 205 secs
lola: 96354230 markings, 250284832 edges, 444156 markings/sec, 210 secs
lola: 98440280 markings, 256108700 edges, 417210 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((1 <= CwA))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((1 <= CwA))))))
lola: processed formula: A (F (G (X (F ((1 <= CwA))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 2994358 markings, 6594942 edges, 598872 markings/sec, 0 secs
lola: 5477582 markings, 12598911 edges, 496645 markings/sec, 5 secs
lola: 8171564 markings, 19369823 edges, 538796 markings/sec, 10 secs
lola: 10358630 markings, 25267041 edges, 437413 markings/sec, 15 secs
lola: 12712912 markings, 31116043 edges, 470856 markings/sec, 20 secs
lola: 14780705 markings, 37018565 edges, 413559 markings/sec, 25 secs
lola: 16975911 markings, 43265367 edges, 439041 markings/sec, 30 secs
lola: 19144378 markings, 49094802 edges, 433693 markings/sec, 35 secs
lola: 21174374 markings, 54482136 edges, 405999 markings/sec, 40 secs
lola: 23135417 markings, 60117077 edges, 392209 markings/sec, 45 secs
lola: 24909120 markings, 65586091 edges, 354741 markings/sec, 50 secs
lola: 26725243 markings, 70987713 edges, 363225 markings/sec, 55 secs
lola: 28972621 markings, 77238847 edges, 449476 markings/sec, 60 secs
lola: 30874298 markings, 82709172 edges, 380335 markings/sec, 65 secs
lola: 32887452 markings, 88147003 edges, 402631 markings/sec, 70 secs
lola: 34624660 markings, 93532227 edges, 347442 markings/sec, 75 secs
lola: 36622670 markings, 98977064 edges, 399602 markings/sec, 80 secs
lola: 38713103 markings, 104626915 edges, 418087 markings/sec, 85 secs
lola: 40661720 markings, 110410350 edges, 389723 markings/sec, 90 secs
lola: 42904158 markings, 116160584 edges, 448488 markings/sec, 95 secs
lola: 44966120 markings, 122174741 edges, 412392 markings/sec, 100 secs
lola: 46720339 markings, 127845695 edges, 350844 markings/sec, 105 secs
lola: 48729885 markings, 133446145 edges, 401909 markings/sec, 110 secs
lola: 50536984 markings, 138923624 edges, 361420 markings/sec, 115 secs
lola: 52387812 markings, 144073078 edges, 370166 markings/sec, 120 secs
lola: 54043268 markings, 149279286 edges, 331091 markings/sec, 125 secs
lola: 55795916 markings, 154616165 edges, 350530 markings/sec, 130 secs
lola: 57887798 markings, 160349194 edges, 418376 markings/sec, 135 secs
lola: 59632404 markings, 165594458 edges, 348921 markings/sec, 140 secs
lola: 61493271 markings, 171291468 edges, 372173 markings/sec, 145 secs
lola: 63405818 markings, 176649599 edges, 382509 markings/sec, 150 secs
lola: 65267610 markings, 182141432 edges, 372358 markings/sec, 155 secs
lola: 66890799 markings, 187460184 edges, 324638 markings/sec, 160 secs
lola: 68711356 markings, 193193684 edges, 364111 markings/sec, 165 secs
lola: 70543585 markings, 198590498 edges, 366446 markings/sec, 170 secs
lola: 72322750 markings, 203948445 edges, 355833 markings/sec, 175 secs
lola: 74182044 markings, 209757162 edges, 371859 markings/sec, 180 secs
lola: 75922653 markings, 215147066 edges, 348122 markings/sec, 185 secs
lola: 77304190 markings, 220174243 edges, 276307 markings/sec, 190 secs
lola: 79002965 markings, 225705509 edges, 339755 markings/sec, 195 secs
lola: 80846664 markings, 231092245 edges, 368740 markings/sec, 200 secs
lola: 82621152 markings, 236209333 edges, 354898 markings/sec, 205 secs
lola: 84259731 markings, 241222853 edges, 327716 markings/sec, 210 secs
lola: 85827964 markings, 246563690 edges, 313647 markings/sec, 215 secs
lola: 87742686 markings, 252147608 edges, 382944 markings/sec, 220 secs
lola: 88328795 markings, 254020922 edges, 117222 markings/sec, 225 secs
lola: 88328808 markings, 254020961 edges, 3 markings/sec, 230 secs
lola: 88330121 markings, 254024822 edges, 263 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((Cb <= CG)) U F (G ((MwU <= SG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((Cb <= CG)) U F (G ((MwU <= SG)))))
lola: processed formula: A ((G ((Cb <= CG)) U F (G ((MwU <= SG)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 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: 104669 markings, 136860 edges
lola: ========================================
lola: subprocess 11 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((Ci <= CG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((Ci <= CG))))))
lola: processed formula: A (X (X (G (X ((Ci <= CG))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100001 edges
lola: ========================================
lola: subprocess 12 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CwA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CwA)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 13 will run for 936 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Ci <= StR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ci <= StR)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 14 will run for 1405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((1 <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G ((1 <= SpA)))))
lola: processed formula: A (G (X (G ((1 <= SpA)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100001 edges
lola: ========================================
lola: subprocess 15 will run for 2810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: processed formula: A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 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: 260000 markings, 292001 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no no yes yes no unknown unknown no no no no no no
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-15 FALSE 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-N2000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 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 mcc4mcc-structural"
echo " Input is ClientsAndServers-PT-N2000P0, 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 r215-smll-152732266200051"
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 ;