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 188K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 11K 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.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 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 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HouseConstruction-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265400286
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527452387496


BK_STOP 1527452534634

--------------------
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 HouseConstruction-PT-050 as instance name.
Using HouseConstruction 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 1109922, 'Memory': 15936.35, 'Tool': 'itstools'}, {'Time': 1117318, 'Memory': 15939.04, 'Tool': 'itstools'}, {'Time': 1370684, 'Memory': 15945.46, 'Tool': 'lola'}, {'Time': 1384792, 'Memory': 15945.98, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.234937229823357x far from the best tool itstools.
LTLFireability lola HouseConstruction-PT-050...

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


checking for too many tokens
===========================================================================================
HouseConstruction-PT-050: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ HouseConstruction-PT-050 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-050-LTLFireability.task
lola: A (FIREABLE(t12)) : A ((G (FIREABLE(t2)) U FIREABLE(t16))) : A (G ((X (FIREABLE(t6)) U X (G (FIREABLE(t8)))))) : A (X (G (X (X (FIREABLE(t8)))))) : A (X (G ((X (FIREABLE(t14)) U G (FIREABLE(t12)))))) : A (F (X (G (G (X (FIREABLE(t4))))))) : A (FIREABLE(t13)) : A (X (F (F (G (X (FIREABLE(t8))))))) : A (X (F ((F (FIREABLE(t12)) U G (FIREABLE(t15)))))) : A (FIREABLE(t13)) : A ((FIREABLE(t8) U (F (FIREABLE(t2)) U G (FIREABLE(t3))))) : A (FIREABLE(t2)) : A (G ((X (FIREABLE(t11)) U FIREABLE(t16)))) : A (X (FIREABLE(t10))) : A ((F ((FIREABLE(t11) U FIREABLE(t5))) U F ((FIREABLE(t8) U FIREABLE(t12))))) : A (G (FIREABLE(t14)))
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(t12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(t2)) U FIREABLE(t16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (FIREABLE(t2)) U FIREABLE(t16)))
lola: processed formula: A ((G (FIREABLE(t2)) U FIREABLE(t16)))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X (FIREABLE(t6)) U X (G (FIREABLE(t8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((FIREABLE(t6) U G (FIREABLE(t8))))))
lola: processed formula: A (G (X ((FIREABLE(t6) U G (FIREABLE(t8))))))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (X (FIREABLE(t8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X (FIREABLE(t8))))))
lola: processed formula: A (X (G (X (X (FIREABLE(t8))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((X (FIREABLE(t14)) U G (FIREABLE(t12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((X (FIREABLE(t14)) U G (FIREABLE(t12))))))
lola: processed formula: A (X (G ((X (FIREABLE(t14)) U G (FIREABLE(t12))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 28 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (G (X (FIREABLE(t4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (G (X (FIREABLE(t4)))))))
lola: processed formula: A (F (X (G (G (X (FIREABLE(t4)))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 1001 markings, 1001 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t13)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G (X (FIREABLE(t8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X (FIREABLE(t8))))))
lola: processed formula: A (X (F (G (X (FIREABLE(t8))))))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 902 markings, 903 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F (FIREABLE(t12)) U G (FIREABLE(t15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((F (FIREABLE(t12)) U G (FIREABLE(t15))))))
lola: processed formula: A (X (F ((F (FIREABLE(t12)) U G (FIREABLE(t15))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t13)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t8) U (F (FIREABLE(t2)) U G (FIREABLE(t3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(t8) U (F (FIREABLE(t2)) U G (FIREABLE(t3)))))
lola: processed formula: A ((FIREABLE(t8) U (F (FIREABLE(t2)) U G (FIREABLE(t3)))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 3482 markings, 5529 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t2)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X (FIREABLE(t11)) U FIREABLE(t16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X (FIREABLE(t11)) U FIREABLE(t16))))
lola: processed formula: A (G ((X (FIREABLE(t11)) U FIREABLE(t16))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t10)))
lola: processed formula: A (X (FIREABLE(t10)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 901 markings, 901 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((FIREABLE(t11) U FIREABLE(t5))) U F ((FIREABLE(t8) U FIREABLE(t12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((FIREABLE(t11) U FIREABLE(t5))) U F ((FIREABLE(t8) U FIREABLE(t12)))))
lola: processed formula: A ((F ((FIREABLE(t11) U FIREABLE(t5))) U F ((FIREABLE(t8) U FIREABLE(t12)))))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 2763015 markings, 3648923 edges, 552603 markings/sec, 0 secs
lola: 5519290 markings, 7606876 edges, 551255 markings/sec, 5 secs
lola: 8163236 markings, 11405781 edges, 528789 markings/sec, 10 secs
lola: 10840393 markings, 15250994 edges, 535431 markings/sec, 15 secs
lola: 13357842 markings, 18868999 edges, 503490 markings/sec, 20 secs
lola: 16176182 markings, 22914152 edges, 563668 markings/sec, 25 secs
lola: 18960499 markings, 26911298 edges, 556863 markings/sec, 30 secs
lola: 21782486 markings, 30964709 edges, 564397 markings/sec, 35 secs
lola: 24444623 markings, 34789855 edges, 532427 markings/sec, 40 secs
lola: 27245856 markings, 38818173 edges, 560247 markings/sec, 45 secs
lola: 30080396 markings, 42887306 edges, 566908 markings/sec, 50 secs
lola: 32900779 markings, 46936115 edges, 564077 markings/sec, 55 secs
lola: 35726526 markings, 50997791 edges, 565149 markings/sec, 60 secs
lola: 38571165 markings, 55081273 edges, 568928 markings/sec, 65 secs
lola: 41407044 markings, 59150797 edges, 567176 markings/sec, 70 secs
lola: 44251293 markings, 63233225 edges, 568850 markings/sec, 75 secs
lola: 47101162 markings, 67327476 edges, 569974 markings/sec, 80 secs
lola: 49990254 markings, 71470670 edges, 577818 markings/sec, 85 secs
lola: 52894556 markings, 75627967 edges, 580860 markings/sec, 90 secs
lola: 55842879 markings, 79843994 edges, 589665 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 56093656 markings, 80199010 edges
lola: ========================================
lola: subprocess 15 will run for 3439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t14)))
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 72 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no yes no
FORMULA HouseConstruction-PT-050-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLFireability-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="HouseConstruction-PT-050"
export BK_EXAMINATION="LTLFireability"
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/HouseConstruction-PT-050.tgz
mv HouseConstruction-PT-050 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 HouseConstruction-PT-050, 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 r214-smll-152732265400286"
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 ;