fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749169900402
Last Updated
June 26, 2018

About the Execution of LoLA for RERS17pb113-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
324.200 301949.00 315356.00 91.00 FFFFFFFFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 4.2K May 30 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 30 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 15:55 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.6K May 28 09:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 28 09:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 28 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 28 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 28 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:42 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:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 27 04:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 27 04:12 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-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900402

=====================================================================

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

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-3 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RERS17pb113-PT-3 @ 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 (FIREABLE(t_12547_a36_SIGDEADLK)) : A ((G (G (FIREABLE(t_14359_a9_SIGCONT))) U (X (FIREABLE(t_14785_a9_SIGCONT)) U X (FIREABLE(t_10418_a40_SIGTRAP))))) : A (FIREABLE(t_19083_a50_SIGDEADLK)) : A (X (X (F (X (X (FIREABLE(t_18609_a50_SIGDEADLK))))))) : A (FIREABLE(t_25085_a28_SIGPWR)) : A (FIREABLE(t_26232_a60_SIGTERM)) : A (FIREABLE(t_10719_a40_SIGTRAP)) : A (F ((G (G (FIREABLE(t_18871_a50_SIGDEADLK))) U X (G (FIREABLE(t_12008_a30_SIGFPE)))))) : A (FIREABLE(t_30299_a7_SIGSTOP)) : A (F (FIREABLE(t_27755_a22_SIGINFO))) : A (F (X (G (F (X (FIREABLE(t_5976_a32_SIGWINCH))))))) : A (G (FIREABLE(t_28453_a1_SIGTERM))) : A (FIREABLE(t_23088_a11_SIGINFO)) : A (F (G (F (F (F (FIREABLE(t_14749_a9_SIGCONT))))))) : A (X (F ((F (FIREABLE(t_15589_a6_SIGUSR2)) U G (FIREABLE(t_14791_a9_SIGCONT)))))) : A (G (F (X (X (X (FIREABLE(t_29179_a26_SIGPWR)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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_12547_a36_SIGDEADLK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_12547_a36_SIGDEADLK)
lola: processed formula length: 31
lola: 37 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

FORMULA RERS17pb113-PT-1-LTLFireability-0 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_19083_a50_SIGDEADLK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_19083_a50_SIGDEADLK)
lola: processed formula length: 31
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: ========================================
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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_25085_a28_SIGPWR)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_25085_a28_SIGPWR)
lola: processed formula length: 28
lola: 37 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-4 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: FIREABLE(t_26232_a60_SIGTERM)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_26232_a60_SIGTERM)
lola: processed formula length: 29
lola: 37 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

FORMULA RERS17pb113-PT-1-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_10719_a40_SIGTRAP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_10719_a40_SIGTRAP)
lola: processed formula length: 29
lola: 37 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-6 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: FIREABLE(t_30299_a7_SIGSTOP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_30299_a7_SIGSTOP)
lola: processed formula length: 28
lola: 37 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 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_23088_a11_SIGINFO)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_23088_a11_SIGINFO)
lola: processed formula length: 29
lola: 37 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 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X (G (FIREABLE(t_12008_a30_SIGFPE))) OR (G (FIREABLE(t_18871_a50_SIGDEADLK)) AND F (G (FIREABLE(t_12008_a30_SIGFPE)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (G (FIREABLE(t_12008_a30_SIGFPE))) OR (G (FIREABLE(t_18871_a50_SIGDEADLK)) AND F (G (FIREABLE(t_12008_a30_SIGFPE)))))))
lola: processed formula length: 128
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 12 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: 1811 markings, 1811 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 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X (F (FIREABLE(t_18609_a50_SIGDEADLK)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X (F (FIREABLE(t_18609_a50_SIGDEADLK)))))))
lola: processed formula length: 55
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 5 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 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((FIREABLE(t_14785_a9_SIGCONT) U FIREABLE(t_10418_a40_SIGTRAP))) OR (G (FIREABLE(t_14359_a9_SIGCONT)) AND X (F (FIREABLE(t_10418_a40_SIGTRAP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((FIREABLE(t_14785_a9_SIGCONT) U FIREABLE(t_10418_a40_SIGTRAP))) OR (G (FIREABLE(t_14359_a9_SIGCONT)) AND X (F (FIREABLE(t_10418_a40_SIGTRAP))))))
lola: processed formula length: 152
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 7 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-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t_28453_a1_SIGTERM)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t_28453_a1_SIGTERM)))
lola: processed formula length: 36
lola: 39 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)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t_28453_a1_SIGTERM)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_27755_a22_SIGINFO)))
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_27755_a22_SIGINFO)
lola: processed formula length: 33
lola: 39 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: 270 markings, 269 edges, 54 markings/sec, 0 secs
lola: 548 markings, 547 edges, 56 markings/sec, 5 secs
lola: 823 markings, 822 edges, 55 markings/sec, 10 secs
lola: 1098 markings, 1097 edges, 55 markings/sec, 15 secs
lola: 1361 markings, 1360 edges, 53 markings/sec, 20 secs
lola: 1635 markings, 1634 edges, 55 markings/sec, 25 secs
lola: 1904 markings, 1903 edges, 54 markings/sec, 30 secs
lola: 2177 markings, 2176 edges, 55 markings/sec, 35 secs
lola: 2446 markings, 2445 edges, 54 markings/sec, 40 secs
lola: 2715 markings, 2714 edges, 54 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-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_5976_a32_SIGWINCH))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_5976_a32_SIGWINCH))))
lola: processed formula length: 41
lola: 37 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: 261 markings, 260 edges, 52 markings/sec, 0 secs
lola: 519 markings, 518 edges, 52 markings/sec, 5 secs
lola: 781 markings, 780 edges, 52 markings/sec, 10 secs
lola: 1041 markings, 1040 edges, 52 markings/sec, 15 secs
lola: 1304 markings, 1303 edges, 53 markings/sec, 20 secs
lola: 1572 markings, 1571 edges, 54 markings/sec, 25 secs
lola: 1832 markings, 1831 edges, 52 markings/sec, 30 secs
lola: 2088 markings, 2087 edges, 51 markings/sec, 35 secs
lola: 2357 markings, 2356 edges, 54 markings/sec, 40 secs
lola: 2623 markings, 2622 edges, 53 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

FORMULA RERS17pb113-PT-1-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_14749_a9_SIGCONT))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_14749_a9_SIGCONT))))
lola: processed formula length: 40
lola: 37 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: 300 markings, 299 edges, 60 markings/sec, 0 secs
lola: 586 markings, 585 edges, 57 markings/sec, 5 secs
lola: 877 markings, 876 edges, 58 markings/sec, 10 secs
lola: 1155 markings, 1154 edges, 56 markings/sec, 15 secs
lola: 1441 markings, 1440 edges, 57 markings/sec, 20 secs
lola: 1720 markings, 1719 edges, 56 markings/sec, 25 secs
lola: 1978 markings, 1977 edges, 52 markings/sec, 30 secs
lola: 2250 markings, 2249 edges, 54 markings/sec, 35 secs
lola: 2529 markings, 2528 edges, 56 markings/sec, 40 secs
lola: 2790 markings, 2789 edges, 52 markings/sec, 45 secs
lola: 3071 markings, 3070 edges, 56 markings/sec, 50 secs
lola: 3344 markings, 3343 edges, 55 markings/sec, 55 secs
lola: 3619 markings, 3618 edges, 55 markings/sec, 60 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: 3828 markings, 3828 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_14791_a9_SIGCONT))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_14791_a9_SIGCONT))))
lola: processed formula length: 40
lola: 37 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: 263 markings, 262 edges, 53 markings/sec, 0 secs
lola: 524 markings, 523 edges, 52 markings/sec, 5 secs
lola: 790 markings, 789 edges, 53 markings/sec, 10 secs
lola: 1055 markings, 1054 edges, 53 markings/sec, 15 secs
lola: 1327 markings, 1326 edges, 54 markings/sec, 20 secs
lola: 1595 markings, 1594 edges, 54 markings/sec, 25 secs
lola: 1863 markings, 1862 edges, 54 markings/sec, 30 secs
lola: 2132 markings, 2131 edges, 54 markings/sec, 35 secs
lola: 2393 markings, 2392 edges, 52 markings/sec, 40 secs
lola: 2653 markings, 2652 edges, 52 markings/sec, 45 secs
lola: 2906 markings, 2905 edges, 51 markings/sec, 50 secs
lola: 3164 markings, 3163 edges, 52 markings/sec, 55 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: 3210 markings, 3211 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 15 will run for 3321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_29179_a26_SIGPWR))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_29179_a26_SIGPWR))))
lola: processed formula length: 40
lola: 37 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: 257 markings, 256 edges, 51 markings/sec, 0 secs
lola: 532 markings, 531 edges, 55 markings/sec, 5 secs
lola: 813 markings, 812 edges, 56 markings/sec, 10 secs
lola: 1093 markings, 1092 edges, 56 markings/sec, 15 secs
lola: 1359 markings, 1358 edges, 53 markings/sec, 20 secs
lola: 1627 markings, 1626 edges, 54 markings/sec, 25 secs
lola: 1897 markings, 1896 edges, 54 markings/sec, 30 secs
lola: 2161 markings, 2160 edges, 53 markings/sec, 35 secs
lola: 2426 markings, 2425 edges, 53 markings/sec, 40 secs
lola: 2683 markings, 2682 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

FORMULA RERS17pb113-PT-1-LTLFireability-15 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: 86380 KB
lola: time consumption: 301 seconds

BK_STOP 1527794419539

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