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 15M
-rw-r--r-- 1 mcc users 3.9K May 30 21:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 30 21:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 29 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.4K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 28 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.1K May 28 06:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 28 06:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 27 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 2 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 15M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RERS17pb113-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900384
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527793198795

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-1 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-1 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RERS17pb113-PT-1 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 31992/65536 symbol table entries, 6831 collisions
lola: preprocessing...
lola: Size of bit vector: 639
lola: finding significant places
lola: 639 places, 31353 transitions, 614 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 47274 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb113-PT-1-LTLFireability.task
lola: A (F (F (X ((FIREABLE(t_14677_a9_SIGCONT) U FIREABLE(t_18526_a50_SIGDEADLK)))))) : A (F (G (G (X (F (FIREABLE(t_22304_a4_SIGUSR2))))))) : A (FIREABLE(t_2945_a76_SIGTTIN)) : A (F (((FIREABLE(t_29286_a26_SIGPWR) U FIREABLE(t_12977_a36_SIGDEADLK)) U F (G (FIREABLE(t_19470_a20_SIGLOST)))))) : A (X (X (X (F (F (FIREABLE(t_10060_a40_SIGTRAP))))))) : A (FIREABLE(t_4806_a29_SIGCHLD)) : A (F (FIREABLE(t_8756_a55_SIGPROF))) : A (X (X (F ((FIREABLE(t_22233_a4_SIGUSR2) U FIREABLE(t_11366_a17_SIGCONT)))))) : A (FIREABLE(t_12871_a36_SIGDEADLK)) : A (X (FIREABLE(t_23911_a19_SIGPROF))) : A (X (FIREABLE(t_25158_a28_SIGPWR))) : A ((G (F (X (FIREABLE(t_6153_a32_SIGWINCH)))) U FIREABLE(t_24903_a3_SIGBUS))) : A (G (((FIREABLE(t_23371_a11_SIGINFO) U FIREABLE(t_2177_a71_SIGPOLL)) U F (FIREABLE(t_12277_a33_SIGTTOU))))) : A (F (FIREABLE(t_2442_a65_SIGUSR1))) : A (X (X ((F (FIREABLE(t_25999_a28_SIGPWR)) U G (FIREABLE(t_16459_a18_SIGFPE)))))) : A (F (X ((X (FIREABLE(t_5012_a62_SIGHUP)) U G (FIREABLE(t_2486_a65_SIGUSR1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_2945_a76_SIGTTIN)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_2945_a76_SIGTTIN)
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_4806_a29_SIGCHLD)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_4806_a29_SIGCHLD)
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_12871_a36_SIGDEADLK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_12871_a36_SIGDEADLK)
lola: processed formula length: 31
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-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: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t_18526_a50_SIGDEADLK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t_18526_a50_SIGDEADLK))))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (FIREABLE(t_11366_a17_SIGCONT)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (FIREABLE(t_11366_a17_SIGCONT)))))
lola: processed formula length: 45
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F (FIREABLE(t_10060_a40_SIGTRAP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F (FIREABLE(t_10060_a40_SIGTRAP))))))
lola: processed formula length: 49
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t_23911_a19_SIGPROF)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(t_23911_a19_SIGPROF)))
lola: processed formula length: 37
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t_25158_a28_SIGPWR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(t_25158_a28_SIGPWR)))
lola: processed formula length: 36
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F (FIREABLE(t_25999_a28_SIGPWR)) U G (FIREABLE(t_16459_a18_SIGFPE))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F (FIREABLE(t_25999_a28_SIGPWR)) U G (FIREABLE(t_16459_a18_SIGFPE))))))
lola: processed formula length: 81
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_2442_a65_SIGUSR1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t_2442_a65_SIGUSR1)
lola: processed formula length: 32
lola: 25 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 290 markings, 289 edges, 58 markings/sec, 0 secs
lola: 571 markings, 570 edges, 56 markings/sec, 5 secs
lola: 860 markings, 859 edges, 58 markings/sec, 10 secs
lola: 1144 markings, 1143 edges, 57 markings/sec, 15 secs
lola: 1420 markings, 1419 edges, 55 markings/sec, 20 secs
lola: 1713 markings, 1712 edges, 59 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1810 markings, 1809 edges

FORMULA RERS17pb113-PT-1-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_8756_a55_SIGPROF)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t_8756_a55_SIGPROF)
lola: processed formula length: 32
lola: 25 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 283 markings, 282 edges, 57 markings/sec, 0 secs
lola: 577 markings, 576 edges, 59 markings/sec, 5 secs
lola: 874 markings, 873 edges, 59 markings/sec, 10 secs
lola: 1179 markings, 1178 edges, 61 markings/sec, 15 secs
lola: 1488 markings, 1487 edges, 62 markings/sec, 20 secs
lola: 1792 markings, 1791 edges, 61 markings/sec, 25 secs
lola: 2102 markings, 2101 edges, 62 markings/sec, 30 secs
lola: 2401 markings, 2400 edges, 60 markings/sec, 35 secs
lola: 2698 markings, 2697 edges, 59 markings/sec, 40 secs
lola: 3000 markings, 2999 edges, 60 markings/sec, 45 secs
lola: 3302 markings, 3301 edges, 60 markings/sec, 50 secs
lola: 3595 markings, 3594 edges, 59 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3828 markings, 3827 edges

FORMULA RERS17pb113-PT-1-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_12277_a33_SIGTTOU))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_12277_a33_SIGTTOU))))
lola: processed formula length: 41
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 306 markings, 305 edges, 61 markings/sec, 0 secs
lola: 593 markings, 592 edges, 57 markings/sec, 5 secs
lola: 895 markings, 894 edges, 60 markings/sec, 10 secs
lola: 1188 markings, 1187 edges, 59 markings/sec, 15 secs
lola: 1488 markings, 1487 edges, 60 markings/sec, 20 secs
lola: 1780 markings, 1779 edges, 58 markings/sec, 25 secs
lola: 2068 markings, 2067 edges, 58 markings/sec, 30 secs
lola: 2367 markings, 2366 edges, 60 markings/sec, 35 secs
lola: 2657 markings, 2656 edges, 58 markings/sec, 40 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: 2819 markings, 2819 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_19470_a20_SIGLOST))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_19470_a20_SIGLOST))))
lola: processed formula length: 41
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 281 markings, 280 edges, 56 markings/sec, 0 secs
lola: 570 markings, 569 edges, 58 markings/sec, 5 secs
lola: 859 markings, 858 edges, 58 markings/sec, 10 secs
lola: 1150 markings, 1149 edges, 58 markings/sec, 15 secs
lola: 1440 markings, 1439 edges, 58 markings/sec, 20 secs
lola: 1725 markings, 1724 edges, 57 markings/sec, 25 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: 1811 markings, 1812 edges

FORMULA RERS17pb113-PT-1-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_22304_a4_SIGUSR2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_22304_a4_SIGUSR2))))
lola: processed formula length: 40
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 267 markings, 266 edges, 53 markings/sec, 0 secs
lola: 556 markings, 555 edges, 58 markings/sec, 5 secs
lola: 820 markings, 819 edges, 53 markings/sec, 10 secs
lola: 1087 markings, 1086 edges, 53 markings/sec, 15 secs
lola: 1359 markings, 1358 edges, 54 markings/sec, 20 secs
lola: 1642 markings, 1641 edges, 57 markings/sec, 25 secs
lola: 1925 markings, 1924 edges, 57 markings/sec, 30 secs
lola: 2210 markings, 2209 edges, 57 markings/sec, 35 secs
lola: 2494 markings, 2493 edges, 57 markings/sec, 40 secs
lola: 2774 markings, 2773 edges, 56 markings/sec, 45 secs
lola: 3053 markings, 3052 edges, 56 markings/sec, 50 secs
lola: 3341 markings, 3340 edges, 58 markings/sec, 55 secs
lola: 3626 markings, 3625 edges, 57 markings/sec, 60 secs
lola: 3895 markings, 3894 edges, 54 markings/sec, 65 secs
lola: 4164 markings, 4163 edges, 54 markings/sec, 70 secs
lola: 4422 markings, 4421 edges, 52 markings/sec, 75 secs
lola: 4681 markings, 4680 edges, 52 markings/sec, 80 secs
lola: 4960 markings, 4959 edges, 56 markings/sec, 85 secs
lola: 5217 markings, 5216 edges, 51 markings/sec, 90 secs
lola: 5484 markings, 5483 edges, 53 markings/sec, 95 secs
lola: 5761 markings, 5760 edges, 55 markings/sec, 100 secs
lola: 6025 markings, 6024 edges, 53 markings/sec, 105 secs
lola: 6285 markings, 6284 edges, 52 markings/sec, 110 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: 6440 markings, 6440 edges

FORMULA RERS17pb113-PT-1-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_2486_a65_SIGUSR1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_2486_a65_SIGUSR1))))
lola: processed formula length: 40
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 288 markings, 287 edges, 58 markings/sec, 0 secs
lola: 586 markings, 585 edges, 60 markings/sec, 5 secs
lola: 891 markings, 890 edges, 61 markings/sec, 10 secs
lola: 1196 markings, 1195 edges, 61 markings/sec, 15 secs
lola: 1493 markings, 1492 edges, 59 markings/sec, 20 secs
lola: 1799 markings, 1798 edges, 61 markings/sec, 25 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: 1811 markings, 1812 edges

FORMULA RERS17pb113-PT-1-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t_24903_a3_SIGBUS) OR (G (F (FIREABLE(t_6153_a32_SIGWINCH))) AND F (FIREABLE(t_24903_a3_SIGBUS)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(t_24903_a3_SIGBUS) OR (G (F (FIREABLE(t_6153_a32_SIGWINCH))) AND F (FIREABLE(t_24903_a3_SIGBUS)))))
lola: processed formula length: 112
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 279 markings, 278 edges, 56 markings/sec, 0 secs
lola: 596 markings, 595 edges, 63 markings/sec, 5 secs
lola: 872 markings, 871 edges, 55 markings/sec, 10 secs
lola: 1187 markings, 1186 edges, 63 markings/sec, 15 secs
lola: 1465 markings, 1464 edges, 56 markings/sec, 20 secs
lola: 1754 markings, 1753 edges, 58 markings/sec, 25 secs
lola: 2034 markings, 2033 edges, 56 markings/sec, 30 secs
lola: 2302 markings, 2301 edges, 54 markings/sec, 35 secs
lola: 2574 markings, 2573 edges, 54 markings/sec, 40 secs
lola: 2864 markings, 2863 edges, 58 markings/sec, 45 secs
lola: 3149 markings, 3148 edges, 57 markings/sec, 50 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: 3243 markings, 3243 edges

FORMULA RERS17pb113-PT-1-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no no no no
lola: ========================================
lola: memory consumption: 86260 KB
lola: time consumption: 392 seconds

BK_STOP 1527793591753

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb113-PT-1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lola"
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/RERS17pb113-PT-1.tgz
mv RERS17pb113-PT-1 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 lola"
echo " Input is RERS17pb113-PT-1, 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 r280-csrt-152749169900384"
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 ;