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 4.3K May 30 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 30 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 15:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 15:56 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.2K May 28 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 28 09:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 28 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.0K May 28 06:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 28 06:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:30 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:30 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K May 27 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 04:14 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-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900420
=====================================================================

--------------------
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 1527796702537

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-5 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-5 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RERS17pb113-PT-5 @ 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 (G (F ((FIREABLE(t_23664_a5_SIGINFO) U FIREABLE(t_23707_a5_SIGINFO)))))) : A (F ((G (X (FIREABLE(t_20100_a20_SIGLOST))) U FIREABLE(t_4526_a29_SIGCHLD)))) : A ((X ((FIREABLE(t_30505_a52_SIGFPE) U FIREABLE(t_5683_a32_SIGWINCH))) U (FIREABLE(t_19655_a20_SIGLOST) U F (FIREABLE(t_31090_a52_SIGFPE))))) : A (G (X (X (FIREABLE(t_14191_a9_SIGCONT))))) : A (X (G (X (G (F (FIREABLE(t_1143_a79_SIGKILL))))))) : A (FIREABLE(t_7064_a72_SIGFPE)) : A (F ((F (FIREABLE(t_918_a79_SIGKILL)) U (FIREABLE(t_23463_a11_SIGINFO) U FIREABLE(t_17088_a18_SIGFPE))))) : A (G (F (X (G (F (FIREABLE(t_17115_a18_SIGFPE))))))) : A ((X (X (G (FIREABLE(t_19858_a20_SIGLOST)))) U (F (FIREABLE(t_29781_a77_SIGTTIN)) U X (FIREABLE(t_10096_a40_SIGTRAP))))) : A (X (X ((FIREABLE(t_30585_a52_SIGFPE) U X (FIREABLE(t_9790_a45_SIGTSTP)))))) : A (X (FIREABLE(t_25577_a28_SIGPWR))) : A (F (G (G ((FIREABLE(t_16426_a18_SIGFPE) U FIREABLE(t_15085_a6_SIGUSR2)))))) : A (FIREABLE(t_21866_a4_SIGUSR2)) : A ((FIREABLE(t_15364_a6_SIGUSR2) U FIREABLE(t_27279_a34_SIGPROF))) : A ((X (FIREABLE(t_8907_a31_SIGQUIT)) U FIREABLE(t_26290_a60_SIGTERM))) : A ((FIREABLE(t_4772_a29_SIGCHLD) U F (X (F (FIREABLE(t_8754_a55_SIGPROF))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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_7064_a72_SIGFPE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_7064_a72_SIGFPE)
lola: processed formula length: 27
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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_21866_a4_SIGUSR2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_21866_a4_SIGUSR2)
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-12 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: A ((X (X (G (FIREABLE(t_19858_a20_SIGLOST)))) U (F (FIREABLE(t_29781_a77_SIGTTIN)) U X (FIREABLE(t_10096_a40_SIGTRAP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G (FIREABLE(t_19858_a20_SIGLOST)))) U (F (FIREABLE(t_29781_a77_SIGTTIN)) U X (FIREABLE(t_10096_a40_SIGTRAP)))))
lola: processed formula length: 121
lola: 23 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 11 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-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 (X ((FIREABLE(t_30585_a52_SIGFPE) U X (FIREABLE(t_9790_a45_SIGTSTP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((FIREABLE(t_30585_a52_SIGFPE) U X (FIREABLE(t_9790_a45_SIGTSTP))))))
lola: processed formula length: 77
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-9 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 (FIREABLE(t_25577_a28_SIGPWR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(t_25577_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 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (FIREABLE(t_14191_a9_SIGCONT)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (FIREABLE(t_14191_a9_SIGCONT)))))
lola: processed formula length: 44
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-3 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_8907_a31_SIGQUIT)) U FIREABLE(t_26290_a60_SIGTERM)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(t_8907_a31_SIGQUIT)) U FIREABLE(t_26290_a60_SIGTERM)))
lola: processed formula length: 70
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-14 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 ((FIREABLE(t_4772_a29_SIGCHLD) U X (F (FIREABLE(t_8754_a55_SIGPROF)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(t_4772_a29_SIGCHLD) U X (F (FIREABLE(t_8754_a55_SIGPROF)))))
lola: processed formula length: 73
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

FORMULA RERS17pb113-PT-1-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_4526_a29_SIGCHLD)))
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_4526_a29_SIGCHLD)
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: 260 markings, 259 edges, 52 markings/sec, 0 secs
lola: 518 markings, 517 edges, 52 markings/sec, 5 secs
lola: 777 markings, 776 edges, 52 markings/sec, 10 secs
lola: 1035 markings, 1034 edges, 52 markings/sec, 15 secs
lola: 1292 markings, 1291 edges, 51 markings/sec, 20 secs
lola: 1541 markings, 1540 edges, 50 markings/sec, 25 secs
lola: 1803 markings, 1802 edges, 52 markings/sec, 30 secs
lola: 2068 markings, 2067 edges, 53 markings/sec, 35 secs
lola: 2331 markings, 2330 edges, 53 markings/sec, 40 secs
lola: 2591 markings, 2590 edges, 52 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2819 markings, 2818 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 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_31090_a52_SIGFPE)))
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_31090_a52_SIGFPE)
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: 262 markings, 261 edges, 52 markings/sec, 0 secs
lola: 530 markings, 529 edges, 54 markings/sec, 5 secs
lola: 806 markings, 805 edges, 55 markings/sec, 10 secs
lola: 1072 markings, 1071 edges, 53 markings/sec, 15 secs
lola: 1336 markings, 1335 edges, 53 markings/sec, 20 secs
lola: 1599 markings, 1598 edges, 53 markings/sec, 25 secs
lola: 1863 markings, 1862 edges, 53 markings/sec, 30 secs
lola: 2133 markings, 2132 edges, 54 markings/sec, 35 secs
lola: 2393 markings, 2392 edges, 52 markings/sec, 40 secs
lola: 2659 markings, 2658 edges, 53 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2819 markings, 2818 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 10 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_17088_a18_SIGFPE)))
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_17088_a18_SIGFPE)
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: 273 markings, 272 edges, 55 markings/sec, 0 secs
lola: 558 markings, 557 edges, 57 markings/sec, 5 secs
lola: 844 markings, 843 edges, 57 markings/sec, 10 secs
lola: 1116 markings, 1115 edges, 54 markings/sec, 15 secs
lola: 1386 markings, 1385 edges, 54 markings/sec, 20 secs
lola: 1669 markings, 1668 edges, 57 markings/sec, 25 secs
lola: 1938 markings, 1937 edges, 54 markings/sec, 30 secs
lola: 2203 markings, 2202 edges, 53 markings/sec, 35 secs
lola: 2480 markings, 2479 edges, 55 markings/sec, 40 secs
lola: 2758 markings, 2757 edges, 56 markings/sec, 45 secs
lola: 3038 markings, 3037 edges, 56 markings/sec, 50 secs
lola: 3320 markings, 3319 edges, 56 markings/sec, 55 secs
lola: 3602 markings, 3601 edges, 56 markings/sec, 60 secs
lola: 3868 markings, 3867 edges, 53 markings/sec, 65 secs
lola: 4153 markings, 4152 edges, 57 markings/sec, 70 secs
lola: 4431 markings, 4430 edges, 56 markings/sec, 75 secs
lola: 4704 markings, 4703 edges, 55 markings/sec, 80 secs
lola: 4971 markings, 4970 edges, 53 markings/sec, 85 secs
lola: 5242 markings, 5241 edges, 54 markings/sec, 90 secs
lola: 5512 markings, 5511 edges, 54 markings/sec, 95 secs
lola: 5781 markings, 5780 edges, 54 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5846 markings, 5845 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 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_23707_a5_SIGINFO))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_23707_a5_SIGINFO))))
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: 537 markings, 536 edges, 54 markings/sec, 5 secs
lola: 814 markings, 813 edges, 55 markings/sec, 10 secs
lola: 1084 markings, 1083 edges, 54 markings/sec, 15 secs
lola: 1353 markings, 1352 edges, 54 markings/sec, 20 secs
lola: 1620 markings, 1619 edges, 53 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: 1810 markings, 1810 edges

FORMULA RERS17pb113-PT-1-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_1143_a79_SIGKILL))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_1143_a79_SIGKILL))))
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: 274 markings, 273 edges, 55 markings/sec, 0 secs
lola: 554 markings, 553 edges, 56 markings/sec, 5 secs
lola: 842 markings, 841 edges, 58 markings/sec, 10 secs
lola: 1125 markings, 1124 edges, 57 markings/sec, 15 secs
lola: 1419 markings, 1418 edges, 59 markings/sec, 20 secs
lola: 1704 markings, 1703 edges, 57 markings/sec, 25 secs
lola: 1988 markings, 1987 edges, 57 markings/sec, 30 secs
lola: 2267 markings, 2266 edges, 56 markings/sec, 35 secs
lola: 2524 markings, 2523 edges, 51 markings/sec, 40 secs
lola: 2779 markings, 2778 edges, 51 markings/sec, 45 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-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_17115_a18_SIGFPE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_17115_a18_SIGFPE))))
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: 266 markings, 265 edges, 53 markings/sec, 0 secs
lola: 522 markings, 521 edges, 51 markings/sec, 5 secs
lola: 787 markings, 786 edges, 53 markings/sec, 10 secs
lola: 1071 markings, 1070 edges, 57 markings/sec, 15 secs
lola: 1342 markings, 1341 edges, 54 markings/sec, 20 secs
lola: 1658 markings, 1657 edges, 63 markings/sec, 25 secs
lola: 1934 markings, 1933 edges, 55 markings/sec, 30 secs
lola: 2222 markings, 2221 edges, 58 markings/sec, 35 secs
lola: 2518 markings, 2517 edges, 59 markings/sec, 40 secs
lola: 2790 markings, 2789 edges, 54 markings/sec, 45 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: 2834 markings, 2834 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 14 will run for 1603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (FIREABLE(t_15085_a6_SIGUSR2)) AND (FIREABLE(t_16426_a18_SIGFPE) OR FIREABLE(t_15085_a6_SIGUSR2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (FIREABLE(t_15085_a6_SIGUSR2)) AND (FIREABLE(t_16426_a18_SIGFPE) OR FIREABLE(t_15085_a6_SIGUSR2))))))
lola: processed formula length: 113
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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 273 markings, 272 edges, 55 markings/sec, 0 secs
lola: 547 markings, 546 edges, 55 markings/sec, 5 secs
lola: 811 markings, 810 edges, 53 markings/sec, 10 secs
lola: 1096 markings, 1095 edges, 57 markings/sec, 15 secs
lola: 1366 markings, 1365 edges, 54 markings/sec, 20 secs
lola: 1631 markings, 1630 edges, 53 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-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t_15364_a6_SIGUSR2) U FIREABLE(t_27279_a34_SIGPROF)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(t_15364_a6_SIGUSR2) U FIREABLE(t_27279_a34_SIGPROF)))
lola: processed formula length: 66
lola: 27 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-13 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: memory consumption: 86440 KB
lola: time consumption: 396 seconds

BK_STOP 1527797099852

--------------------
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-5"
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-5.tgz
mv RERS17pb113-PT-5 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-5, 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-152749169900420"
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 ;