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

About the Execution of M4M.struct for CircularTrains-PT-384

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15895.530 220524.00 182553.00 2203.90 TFFFTFTFF?FFTFFF 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 460K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 293K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is CircularTrains-PT-384, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266200011
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527414427748


BK_STOP 1527414648272

--------------------
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 CircularTrains-PT-384 as instance name.
Using CircularTrains 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': True, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 394595, 'Memory': 15933.98, 'Tool': 'lola'}, {'Time': 397353, 'Memory': 15952.48, 'Tool': 'lola'}, {'Time': 3508175, 'Memory': 15814.67, 'Tool': 'itstools'}, {'Time': 3509329, 'Memory': 15782.73, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola CircularTrains-PT-384...

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


checking for too many tokens
===========================================================================================
CircularTrains-PT-384: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ CircularTrains-PT-384 @ 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: 1152/65536 symbol table entries, 116 collisions
lola: preprocessing...
lola: finding significant places
lola: 768 places, 384 transitions, 383 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 768 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-384-LTLCardinality.task
lola: A (G (G (F ((Section_140 <= F44))))) : A (G (F ((3 <= Section_178)))) : A (G ((G ((Section_191 <= F264)) U G ((1 <= Section_289))))) : A (G (F (F (G ((1 <= Section_65)))))) : A ((F202 <= Section_75)) : A ((2 <= Section_188)) : A (F (X (((Section_135 <= Section_223) U (F210 <= Section_6))))) : A (((2 <= Section_239) U ((2 <= F292) U (2 <= F316)))) : A (F (G ((3 <= Section_296)))) : A (G ((G ((Section_290 <= F84)) U F ((Section_197 <= Section_152))))) : A ((2 <= Section_161)) : A (X ((G ((1 <= Section_232)) U G ((1 <= F42))))) : A ((G (G ((F382 <= Section_86))) U ((3 <= Section_37) U (Section_282 <= F49)))) : A (X (F (X (G ((3 <= F305)))))) : A ((1 <= Section_365)) : A (F (G (((Section_103 <= F176) U (1 <= Section_375)))))
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 (G (G (F ((Section_140 <= F44)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((Section_140 <= F44)))))
lola: processed formula: A (G (G (F ((Section_140 <= F44)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 102798 markings, 115045 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Section_178))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((3 <= Section_178))))
lola: processed formula: A (G (F ((3 <= Section_178))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 12539 markings, 12539 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((Section_191 <= F264)) U G ((1 <= Section_289)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((Section_191 <= F264)) U G ((1 <= Section_289)))))
lola: processed formula: A (G ((G ((Section_191 <= F264)) U G ((1 <= Section_289)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 28 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: 45644 markings, 45784 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G ((1 <= Section_65))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((1 <= Section_65))))
lola: processed formula: A (F (G ((1 <= Section_65))))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 12608 markings, 12609 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F202 <= Section_75))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (F202 <= Section_75)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 ((2 <= Section_188))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Section_188)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((Section_135 <= Section_223) U (F210 <= Section_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((Section_135 <= Section_223) U (F210 <= Section_6)))))
lola: processed formula: A (F (X (((Section_135 <= Section_223) U (F210 <= Section_6)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 129 markings, 128 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Section_239) U ((2 <= F292) U (2 <= F316))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= Section_239) U ((2 <= F292) U (2 <= F316))))
lola: processed formula: A (((2 <= Section_239) U ((2 <= F292) U (2 <= F316))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 12663 markings, 12663 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= Section_296))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((3 <= Section_296))))
lola: processed formula: A (F (G ((3 <= Section_296))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 12557 markings, 12558 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((Section_290 <= F84)) U F ((Section_197 <= Section_152)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((Section_290 <= F84)) U F ((Section_197 <= Section_152)))))
lola: processed formula: A (G ((G ((Section_290 <= F84)) U F ((Section_197 <= Section_152)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 1013363 markings, 1021885 edges, 202673 markings/sec, 0 secs
lola: 1952044 markings, 1971805 edges, 187736 markings/sec, 5 secs
lola: 2912136 markings, 2947946 edges, 192018 markings/sec, 10 secs
lola: 3866326 markings, 3935954 edges, 190838 markings/sec, 15 secs
lola: 4850672 markings, 4933323 edges, 196869 markings/sec, 20 secs
lola: 5793152 markings, 5894932 edges, 188496 markings/sec, 25 secs
lola: 6722682 markings, 6847095 edges, 185906 markings/sec, 30 secs
lola: 7700843 markings, 7871553 edges, 195632 markings/sec, 35 secs
lola: 8629904 markings, 8817060 edges, 185812 markings/sec, 40 secs
lola: 9565642 markings, 9772322 edges, 187148 markings/sec, 45 secs
lola: 10551308 markings, 10885964 edges, 197133 markings/sec, 50 secs
lola: 11519037 markings, 11933543 edges, 193546 markings/sec, 55 secs
lola: 12462079 markings, 12883640 edges, 188608 markings/sec, 60 secs
lola: 13414418 markings, 13940375 edges, 190468 markings/sec, 65 secs
lola: 14323783 markings, 14874446 edges, 181873 markings/sec, 70 secs
lola: 15271151 markings, 15923548 edges, 189474 markings/sec, 75 secs
lola: 16212122 markings, 16897873 edges, 188194 markings/sec, 80 secs
lola: 17149860 markings, 17858601 edges, 187548 markings/sec, 85 secs
lola: 18045314 markings, 18778246 edges, 179091 markings/sec, 90 secs
lola: 19058906 markings, 19891788 edges, 202718 markings/sec, 95 secs
lola: 20006479 markings, 20879452 edges, 189515 markings/sec, 100 secs
lola: 20944750 markings, 21904206 edges, 187654 markings/sec, 105 secs
lola: 21910232 markings, 23095644 edges, 193096 markings/sec, 110 secs
lola: 22862437 markings, 24070930 edges, 190441 markings/sec, 115 secs
lola: 23766048 markings, 24997918 edges, 180722 markings/sec, 120 secs
lola: 24676371 markings, 25924272 edges, 182065 markings/sec, 125 secs
lola: 25685682 markings, 27178957 edges, 201862 markings/sec, 130 secs
lola: 26645327 markings, 28169079 edges, 191929 markings/sec, 135 secs
lola: 27508740 markings, 29051217 edges, 172683 markings/sec, 140 secs
lola: 28404066 markings, 29984082 edges, 179065 markings/sec, 145 secs
lola: 29362766 markings, 31118687 edges, 191740 markings/sec, 150 secs
lola: 30316350 markings, 32231596 edges, 190717 markings/sec, 155 secs
lola: 31207914 markings, 33148941 edges, 178313 markings/sec, 160 secs
lola: 32099618 markings, 34120337 edges, 178341 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 561 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= Section_161))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Section_161)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 11 will run for 673 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((1 <= Section_232)) U G ((1 <= F42)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((1 <= Section_232)) U G ((1 <= F42)))))
lola: processed formula: A (X ((G ((1 <= Section_232)) U G ((1 <= F42)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 12709 markings, 12709 edges
lola: ========================================
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((F382 <= Section_86))) U ((3 <= Section_37) U (Section_282 <= F49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((F382 <= Section_86))) U ((3 <= Section_37) U (Section_282 <= F49))))
lola: processed formula: A ((G (G ((F382 <= Section_86))) U ((3 <= Section_37) U (Section_282 <= F49))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 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 13 will run for 1122 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (G ((3 <= F305))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (G ((3 <= F305))))))
lola: processed formula: A (X (F (X (G ((3 <= F305))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 12709 markings, 12709 edges
lola: ========================================
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= Section_365))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Section_365)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 15 will run for 3367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((Section_103 <= F176) U (1 <= Section_375)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((Section_103 <= F176) U (1 <= Section_375)))))
lola: processed formula: A (F (G (((Section_103 <= F176) U (1 <= Section_375)))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 45669 markings, 48399 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no yes no no unknown no no yes no no no
FORMULA CircularTrains-PT-384-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-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 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="CircularTrains-PT-384"
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/CircularTrains-PT-384.tgz
mv CircularTrains-PT-384 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 CircularTrains-PT-384, 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-152732266200011"
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 ;