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

About the Execution of M4M.struct for DLCshifumi-PT-4a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
482.190 360757.00 321009.00 1761.50 FFFF?FFFFFFFFFTF 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 2.1M
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 9.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K 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.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DLCshifumi-PT-4a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266500216
=====================================================================


--------------------
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 DLCshifumi-PT-4a-LTLFireability-00
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-01
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-02
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-03
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-04
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-05
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-06
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-07
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-08
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-09
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-10
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-11
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-12
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-13
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-14
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527454386385


BK_STOP 1527454747142

--------------------
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 DLCshifumi-PT-4a as instance name.
Using DLCshifumi as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 21899, 'Memory': 165.69, 'Tool': 'lola'}, {'Time': 22088, 'Memory': 166.87, 'Tool': 'lola'}, {'Time': 163683, 'Memory': 2141.34, 'Tool': 'itstools'}, {'Time': 176827, 'Memory': 2150.86, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola DLCshifumi-PT-4a...

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


checking for too many tokens
===========================================================================================
DLCshifumi-PT-4a: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ DLCshifumi-PT-4a @ 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: 8682/65536 symbol table entries, 2367 collisions
lola: preprocessing...
lola: finding significant places
lola: 1178 places, 7504 transitions, 487 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6411 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-4a-LTLFireability.task
lola: A (FIREABLE(t3711)) : A (F (((FIREABLE(t2562) U FIREABLE(t4693)) U X (X (FIREABLE(t5047)))))) : A (G (F ((FIREABLE(t1757) U F (FIREABLE(t3221)))))) : A (G (F ((FIREABLE(t4142) U F (FIREABLE(t1435)))))) : A (G (G (F (G (FIREABLE(t269)))))) : A ((G (FIREABLE(t126)) U X (F (F (FIREABLE(t1198)))))) : A (F (X (FIREABLE(t3215)))) : A (G (FIREABLE(t6504))) : A (FIREABLE(t4574)) : A (F ((G (G (FIREABLE(t6401))) U (FIREABLE(t5564) U FIREABLE(t4388))))) : A (FIREABLE(t7162)) : A (X ((G (G (FIREABLE(t5901))) U X (G (FIREABLE(t7383)))))) : A (((FIREABLE(t3116) U G (FIREABLE(t2380))) U FIREABLE(t3420))) : A (F (F (FIREABLE(t614)))) : A (F (FIREABLE(t1628))) : A (X (((FIREABLE(t1952) U FIREABLE(t6648)) U (FIREABLE(t3663) U FIREABLE(t218)))))
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 (FIREABLE(t3711))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t3711)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: processed formula with 0 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t2562) U FIREABLE(t4693)) U X (X (FIREABLE(t5047))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(t2562) U FIREABLE(t4693)) U X (X (FIREABLE(t5047))))))
lola: processed formula: A (F (((FIREABLE(t2562) U FIREABLE(t4693)) U X (X (FIREABLE(t5047))))))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 23 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(t1757) U F (FIREABLE(t3221))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(t1757) U F (FIREABLE(t3221))))))
lola: processed formula: A (G (F ((FIREABLE(t1757) U F (FIREABLE(t3221))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 23 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(t4142) U F (FIREABLE(t1435))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(t4142) U F (FIREABLE(t1435))))))
lola: processed formula: A (G (F ((FIREABLE(t4142) U F (FIREABLE(t1435))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 13 markings, 12 edges, 3 markings/sec, 0 secs
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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G (FIREABLE(t269))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t269))))
lola: processed formula: A (F (G (FIREABLE(t269))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 18 markings, 17 edges, 4 markings/sec, 0 secs
lola: 26 markings, 30 edges, 2 markings/sec, 5 secs
lola: 31 markings, 43 edges, 1 markings/sec, 10 secs
lola: 39 markings, 69 edges, 2 markings/sec, 15 secs
lola: 55 markings, 142 edges, 3 markings/sec, 20 secs
lola: 63 markings, 192 edges, 2 markings/sec, 25 secs
lola: 81 markings, 299 edges, 4 markings/sec, 30 secs
lola: 84 markings, 339 edges, 1 markings/sec, 35 secs
lola: 97 markings, 440 edges, 3 markings/sec, 40 secs
lola: 108 markings, 534 edges, 2 markings/sec, 45 secs
lola: 117 markings, 628 edges, 2 markings/sec, 50 secs
lola: 127 markings, 725 edges, 2 markings/sec, 55 secs
lola: 135 markings, 795 edges, 2 markings/sec, 60 secs
lola: 142 markings, 865 edges, 1 markings/sec, 65 secs
lola: 150 markings, 934 edges, 2 markings/sec, 70 secs
lola: 158 markings, 1007 edges, 2 markings/sec, 75 secs
lola: 172 markings, 1135 edges, 3 markings/sec, 80 secs
lola: 180 markings, 1202 edges, 2 markings/sec, 85 secs
lola: 188 markings, 1273 edges, 2 markings/sec, 90 secs
lola: 194 markings, 1336 edges, 1 markings/sec, 95 secs
lola: 206 markings, 1430 edges, 2 markings/sec, 100 secs
lola: 215 markings, 1516 edges, 2 markings/sec, 105 secs
lola: 223 markings, 1586 edges, 2 markings/sec, 110 secs
lola: 230 markings, 1681 edges, 1 markings/sec, 115 secs
lola: 239 markings, 1753 edges, 2 markings/sec, 120 secs
lola: 247 markings, 1824 edges, 2 markings/sec, 125 secs
lola: 253 markings, 1888 edges, 1 markings/sec, 130 secs
lola: 268 markings, 2016 edges, 3 markings/sec, 135 secs
lola: 276 markings, 2083 edges, 2 markings/sec, 140 secs
lola: 284 markings, 2154 edges, 2 markings/sec, 145 secs
lola: 292 markings, 2242 edges, 2 markings/sec, 150 secs
lola: 297 markings, 2294 edges, 1 markings/sec, 155 secs
lola: 306 markings, 2380 edges, 2 markings/sec, 160 secs
lola: 316 markings, 2480 edges, 2 markings/sec, 165 secs
lola: 324 markings, 2552 edges, 2 markings/sec, 170 secs
lola: 331 markings, 2619 edges, 1 markings/sec, 175 secs
lola: 341 markings, 2711 edges, 2 markings/sec, 180 secs
lola: 350 markings, 2805 edges, 2 markings/sec, 185 secs
lola: 358 markings, 2883 edges, 2 markings/sec, 190 secs
lola: 367 markings, 2955 edges, 2 markings/sec, 195 secs
lola: 375 markings, 3026 edges, 2 markings/sec, 200 secs
lola: 384 markings, 3121 edges, 2 markings/sec, 205 secs
lola: 393 markings, 3215 edges, 2 markings/sec, 210 secs
lola: 401 markings, 3282 edges, 2 markings/sec, 215 secs
lola: 409 markings, 3353 edges, 2 markings/sec, 220 secs
lola: 418 markings, 3472 edges, 2 markings/sec, 225 secs
lola: 423 markings, 3509 edges, 1 markings/sec, 230 secs
lola: 431 markings, 3579 edges, 2 markings/sec, 235 secs
lola: 441 markings, 3679 edges, 2 markings/sec, 240 secs
lola: 449 markings, 3751 edges, 2 markings/sec, 245 secs
lola: 457 markings, 3834 edges, 2 markings/sec, 250 secs
lola: 469 markings, 3940 edges, 2 markings/sec, 255 secs
lola: 475 markings, 4003 edges, 1 markings/sec, 260 secs
lola: 483 markings, 4080 edges, 2 markings/sec, 265 secs
lola: 493 markings, 4171 edges, 2 markings/sec, 270 secs
lola: 501 markings, 4241 edges, 2 markings/sec, 275 secs
lola: 509 markings, 4318 edges, 2 markings/sec, 280 secs
lola: 518 markings, 4412 edges, 2 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(t126)) U X (F (F (FIREABLE(t1198))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (FIREABLE(t126)) U X (F (FIREABLE(t1198)))))
lola: processed formula: A ((G (FIREABLE(t126)) U X (F (FIREABLE(t1198)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 22 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (FIREABLE(t3215))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (FIREABLE(t3215))))
lola: processed formula: A (F (X (FIREABLE(t3215))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 23 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t6504)))
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 64 bytes per marking, with 25 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t4574))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t4574)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: processed formula with 0 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 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G (G (FIREABLE(t6401))) U (FIREABLE(t5564) U FIREABLE(t4388)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G (G (FIREABLE(t6401))) U (FIREABLE(t5564) U FIREABLE(t4388)))))
lola: processed formula: A (F ((G (G (FIREABLE(t6401))) U (FIREABLE(t5564) U FIREABLE(t4388)))))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 24 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 10 will run for 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t7162))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t7162)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: processed formula with 0 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 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G (G (FIREABLE(t5901))) U X (G (FIREABLE(t7383))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G (G (FIREABLE(t5901))) U X (G (FIREABLE(t7383))))))
lola: processed formula: A (X ((G (G (FIREABLE(t5901))) U X (G (FIREABLE(t7383))))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 21 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: 101 markings, 1799 edges
lola: ========================================
lola: subprocess 12 will run for 807 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t3116) U G (FIREABLE(t2380))) U FIREABLE(t3420)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(t3116) U G (FIREABLE(t2380))) U FIREABLE(t3420)))
lola: processed formula: A (((FIREABLE(t3116) U G (FIREABLE(t2380))) U FIREABLE(t3420)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 22 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 13 will run for 1075 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (FIREABLE(t614))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t614)))
lola: processed formula: A (F (FIREABLE(t614)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 24 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 14 will run for 1612 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t1628)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t1628)))
lola: processed formula: A (F (FIREABLE(t1628)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 24 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3224 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(t1952) U FIREABLE(t6648)) U (FIREABLE(t3663) U FIREABLE(t218)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((FIREABLE(t1952) U FIREABLE(t6648)) U (FIREABLE(t3663) U FIREABLE(t218)))))
lola: processed formula: A (X (((FIREABLE(t1952) U FIREABLE(t6648)) U (FIREABLE(t3663) U FIREABLE(t218)))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 1178 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4a-LTLFireability.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 22 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: 21 markings, 21 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown no no no no no no no no no yes no
FORMULA DLCshifumi-PT-4a-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4a-LTLFireability-15 FALSE 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="DLCshifumi-PT-4a"
export BK_EXAMINATION="LTLFireability"
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/DLCshifumi-PT-4a.tgz
mv DLCshifumi-PT-4a 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 DLCshifumi-PT-4a, examination is LTLFireability"
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-152732266500216"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;