fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r214-smll-152732265000053
Last Updated
June 26, 2018

About the Execution of M4M.full for ClientsAndServers-PT-N5000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.250 459389.00 344926.00 3408.90 TFFFTTFF??FFFFFT 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 168K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.8K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K 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 mcc4mcc-full
Input is ClientsAndServers-PT-N5000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265000053
=====================================================================


--------------------
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-N5000P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527410072083


BK_STOP 1527410531472

--------------------
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-N5000P0 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': 502861, 'Memory': 14538.94, 'Tool': 'lola'}, {'Time': 914341, 'Memory': 2223.98, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ClientsAndServers-PT-N5000P0...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ClientsAndServers-PT-N5000P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N5000P0: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ ClientsAndServers-PT-N5000P0 @ 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-N5000P0-LTLCardinality.task
lola: A (F ((StF <= MpA))) : A ((Ci <= CA)) : A ((2 <= SR)) : A (X (((2 <= CG) U F ((Uf <= SR))))) : A ((SwG <= Ci)) : A (X ((Cb <= MpA))) : A ((F (X ((SwA <= Uf))) U X ((Mi <= CG)))) : A ((2 <= CF)) : A (G ((F ((3 <= Uf)) U X ((CF <= CwA))))) : A (F ((F ((3 <= CwA)) U F ((1 <= SF))))) : A ((F (X ((Si <= SpA))) U (3 <= SG))) : A (X (G (X (G ((3 <= SG)))))) : A ((1 <= CR)) : A (((2 <= SA) U X (X ((2 <= SwA))))) : A (X (X (X (X ((3 <= CF)))))) : A ((MwU <= SpG))
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 ((StF <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((StF <= MpA)))
lola: processed formula: A (F ((StF <= MpA)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Ci <= CA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ci <= CA)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= SR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SR)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= CG) U F ((Uf <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= CG) U F ((Uf <= SR)))))
lola: processed formula: A (X (((2 <= CG) U F ((Uf <= SR)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 260013 markings, 260013 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((SwG <= Ci))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SwG <= Ci)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Cb <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Cb <= MpA)))
lola: processed formula: A (X ((Cb <= MpA)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((SwA <= Uf))) U X ((Mi <= CG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((SwA <= Uf))) U X ((Mi <= CG))))
lola: processed formula: A ((F (X ((SwA <= Uf))) U X ((Mi <= CG))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 500001 markings, 500002 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CF)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((3 <= Uf)) U X ((CF <= CwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((3 <= Uf)) U X ((CF <= CwA)))))
lola: processed formula: A (G ((F ((3 <= Uf)) U X ((CF <= CwA)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 3290258 markings, 5570918 edges, 658052 markings/sec, 0 secs
lola: 5836763 markings, 11689583 edges, 509301 markings/sec, 5 secs
lola: 8421263 markings, 18390862 edges, 516900 markings/sec, 10 secs
lola: 10987811 markings, 25311251 edges, 513310 markings/sec, 15 secs
lola: 13431602 markings, 31618655 edges, 488758 markings/sec, 20 secs
lola: 16103238 markings, 38136543 edges, 534327 markings/sec, 25 secs
lola: 18415047 markings, 44479947 edges, 462362 markings/sec, 30 secs
lola: 20989448 markings, 50906096 edges, 514880 markings/sec, 35 secs
lola: 23222864 markings, 56846241 edges, 446683 markings/sec, 40 secs
lola: 26108564 markings, 63881314 edges, 577140 markings/sec, 45 secs
lola: 28979075 markings, 71336725 edges, 574102 markings/sec, 50 secs
lola: 31507151 markings, 77948231 edges, 505615 markings/sec, 55 secs
lola: 34219901 markings, 84618306 edges, 542550 markings/sec, 60 secs
lola: 36576911 markings, 90970407 edges, 471402 markings/sec, 65 secs
lola: 38724590 markings, 97223147 edges, 429536 markings/sec, 70 secs
lola: 40989754 markings, 103410286 edges, 453033 markings/sec, 75 secs
lola: 43383301 markings, 109852971 edges, 478709 markings/sec, 80 secs
lola: 45585150 markings, 116156082 edges, 440370 markings/sec, 85 secs
lola: 47912387 markings, 122258936 edges, 465447 markings/sec, 90 secs
lola: 50734180 markings, 128242870 edges, 564359 markings/sec, 95 secs
lola: 52915511 markings, 134536888 edges, 436266 markings/sec, 100 secs
lola: 54956468 markings, 140951465 edges, 408191 markings/sec, 105 secs
lola: 57301655 markings, 148131168 edges, 469037 markings/sec, 110 secs
lola: 59302148 markings, 154157321 edges, 400099 markings/sec, 115 secs
lola: 61924229 markings, 160811697 edges, 524416 markings/sec, 120 secs
lola: 64044908 markings, 166674797 edges, 424136 markings/sec, 125 secs
lola: 66647294 markings, 173235344 edges, 520477 markings/sec, 130 secs
lola: 68735191 markings, 178877254 edges, 417579 markings/sec, 135 secs
lola: 70702652 markings, 185224623 edges, 393492 markings/sec, 140 secs
lola: 72545350 markings, 191538376 edges, 368540 markings/sec, 145 secs
lola: 74946480 markings, 197642769 edges, 480226 markings/sec, 150 secs
lola: 77034916 markings, 203286799 edges, 417687 markings/sec, 155 secs
lola: 79453037 markings, 209192111 edges, 483624 markings/sec, 160 secs
lola: 81457376 markings, 215695772 edges, 400868 markings/sec, 165 secs
lola: 83555016 markings, 222034731 edges, 419528 markings/sec, 170 secs
lola: 85377002 markings, 228329924 edges, 364397 markings/sec, 175 secs
lola: 87488213 markings, 234505853 edges, 422242 markings/sec, 180 secs
lola: 89454338 markings, 240533000 edges, 393225 markings/sec, 185 secs
lola: 91637084 markings, 246634637 edges, 436549 markings/sec, 190 secs
lola: 93740207 markings, 253274393 edges, 420625 markings/sec, 195 secs
lola: 95940340 markings, 259958635 edges, 440027 markings/sec, 200 secs
lola: 97221935 markings, 264005489 edges, 256319 markings/sec, 205 secs
lola: 97226363 markings, 264019767 edges, 886 markings/sec, 210 secs
lola: 97232195 markings, 264038552 edges, 1166 markings/sec, 215 secs
lola: 97236923 markings, 264053817 edges, 946 markings/sec, 220 secs
lola: 97236943 markings, 264053857 edges, 4 markings/sec, 225 secs
lola: 97238569 markings, 264059095 edges, 325 markings/sec, 230 secs
lola: 97238578 markings, 264059134 edges, 2 markings/sec, 235 secs
lola: 97241375 markings, 264068133 edges, 559 markings/sec, 240 secs
lola: 97241378 markings, 264068146 edges, 1 markings/sec, 245 secs
lola: 97241381 markings, 264068164 edges, 1 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= CwA)) U F ((1 <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((3 <= CwA)) U F ((1 <= SF)))))
lola: processed formula: A (F ((F ((3 <= CwA)) U F ((1 <= SF)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 4973526 markings, 4973526 edges, 994705 markings/sec, 0 secs
lola: 10080404 markings, 10080403 edges, 1021376 markings/sec, 5 secs
lola: 15171760 markings, 15171760 edges, 1018271 markings/sec, 10 secs
lola: 19969677 markings, 19969676 edges, 959583 markings/sec, 15 secs
lola: 25182057 markings, 25182057 edges, 1042476 markings/sec, 20 secs
lola: 29638599 markings, 29638599 edges, 891308 markings/sec, 25 secs
lola: 34754032 markings, 34754031 edges, 1023087 markings/sec, 30 secs
lola: 39467671 markings, 39467671 edges, 942728 markings/sec, 35 secs
lola: 43823491 markings, 43823491 edges, 871164 markings/sec, 40 secs
lola: 48019080 markings, 48019080 edges, 839118 markings/sec, 45 secs
lola: 52542873 markings, 52542873 edges, 904759 markings/sec, 50 secs
lola: 55896944 markings, 55896944 edges, 670814 markings/sec, 55 secs
lola: 59357668 markings, 59357668 edges, 692145 markings/sec, 60 secs
lola: 62688750 markings, 62688750 edges, 666216 markings/sec, 65 secs
lola: 65942420 markings, 65942420 edges, 650734 markings/sec, 70 secs
lola: 69068795 markings, 69068795 edges, 625275 markings/sec, 75 secs
lola: 72054943 markings, 72054943 edges, 597230 markings/sec, 80 secs
lola: 75271144 markings, 75271144 edges, 643240 markings/sec, 85 secs
lola: 78381164 markings, 78381164 edges, 622004 markings/sec, 90 secs
lola: 81264398 markings, 81264398 edges, 576647 markings/sec, 95 secs
lola: 84338237 markings, 84338237 edges, 614768 markings/sec, 100 secs
lola: 87199119 markings, 87199119 edges, 572176 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((Si <= SpA))) U (3 <= SG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((Si <= SpA))) U (3 <= SG)))
lola: processed formula: A ((F (X ((Si <= SpA))) U (3 <= SG)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 509981 markings, 509982 edges
lola: ========================================
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (G ((3 <= SG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (G ((3 <= SG))))))
lola: processed formula: A (X (G (X (G ((3 <= SG))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 250001 markings, 250001 edges
lola: ========================================lola:
subprocess 12 will run for 781 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= CR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= CR)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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 1042 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= SA) U X (X ((2 <= SwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= SA) U X (X ((2 <= SwA)))))
lola: processed formula: A (((2 <= SA) U X (X ((2 <= SwA)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 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: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 14 will run for 1563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((3 <= CF))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (X ((3 <= CF))))))
lola: processed formula: A (X (X (X (X ((3 <= CF))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: 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: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 15 will run for 3126 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((MwU <= SpG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MwU <= SpG)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-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: RESULT
lola:
SUMMARY: yes no no no yes yes no no unknown unknown no no no no no yes
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-N5000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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-N5000P0.tgz
mv ClientsAndServers-PT-N5000P0 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-full"
echo " Input is ClientsAndServers-PT-N5000P0, 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 r214-smll-152732265000053"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;