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 73M
-rw-r--r-- 1 mcc users 3.7K May 30 22:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 22:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 16:05 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.3K May 28 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 28 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 28 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.4K May 28 06:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:51 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 3.9K May 27 04:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 04:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:32 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 73M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RERS17pb114-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170000474
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527801529293

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb114-PT-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb114-PT-2 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RERS17pb114-PT-2 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 152531/65536 symbol table entries, 94907 collisions
lola: preprocessing...
lola: Size of bit vector: 1446
lola: finding significant places
lola: 1446 places, 151085 transitions, 1411 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 210714 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb114-PT-1-LTLFireability.task
lola: A ((X ((FIREABLE(t_103678_a58_SIGTERM) U FIREABLE(t_131795_a84_SIGINT))) U X (X (FIREABLE(t_68632_a23_SIGHUP))))) : A (X (X (G (FIREABLE(t_18304_a40_SIGUSR1))))) : A (FIREABLE(t_27218_a76_SIGILL)) : A (G ((X (X (FIREABLE(t_135330_a19_SIGSYS))) U (FIREABLE(t_1124_a99_SIGILL) U FIREABLE(t_58822_a34_SIGTSTP))))) : A (F (G (FIREABLE(t_55666_a65_SIGUSR1)))) : A (F (G ((F (FIREABLE(t_145393_a6_SIGSEGV)) U F (FIREABLE(t_74942_a114_SIGUSR1)))))) : A (G (F (F ((FIREABLE(t_35423_a75_SIGUSR2) U FIREABLE(t_25209_a93_SIGTRAP)))))) : A ((F (FIREABLE(t_3061_a56_SIGPWR)) U (X (FIREABLE(t_131407_a84_SIGINT)) U X (FIREABLE(t_91606_a44_SIGDEADLK))))) : A (G (G (G ((FIREABLE(t_123450_a102_SIGTERM) U FIREABLE(t_64376_a64_SIGVTALRM)))))) : A (X (F (F (FIREABLE(t_61034_a26_SIGCHLD))))) : A ((G (G (FIREABLE(t_80291_a4_SIGTSTP))) U X (FIREABLE(t_36983_a20_SIGSTOP)))) : A ((F ((FIREABLE(t_44575_a117_SIGPWR) U FIREABLE(t_55609_a65_SIGUSR1))) U (F (FIREABLE(t_65727_a23_SIGHUP)) U G (FIREABLE(t_146972_a119_SIGSTOP))))) : A (X (((FIREABLE(t_103605_a58_SIGTERM) U FIREABLE(t_148252_a73_SIGURG)) U X (FIREABLE(t_148116_a73_SIGURG))))) : A (G (F (F (F (X (FIREABLE(t_51623_a42_SIGDEADLK))))))) : A (X ((FIREABLE(t_13463_a66_SIGEMT) U X (G (FIREABLE(t_14865_a10_SIGTSTP)))))) : A (X (G (G (X (F (FIREABLE(t_105175_a58_SIGTERM)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_27218_a76_SIGILL)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_27218_a76_SIGILL)
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file RERS17pb114-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 RERS17pb114-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 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (FIREABLE(t_18304_a40_SIGUSR1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (FIREABLE(t_18304_a40_SIGUSR1)))))
lola: processed formula length: 45
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 4 markings, 4 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(t_103678_a58_SIGTERM) U FIREABLE(t_131795_a84_SIGINT)) U X (FIREABLE(t_68632_a23_SIGHUP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((FIREABLE(t_103678_a58_SIGTERM) U FIREABLE(t_131795_a84_SIGINT)) U X (FIREABLE(t_68632_a23_SIGHUP)))))
lola: processed formula length: 109
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 4 markings, 4 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(t_58822_a34_SIGTSTP)))) AND A (G ((X (X (FIREABLE(t_135330_a19_SIGSYS))) OR (FIREABLE(t_1124_a99_SIGILL) U FIREABLE(t_58822_a34_SIGTSTP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_58822_a34_SIGTSTP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_58822_a34_SIGTSTP))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(t_3061_a56_SIGPWR)) U X ((FIREABLE(t_131407_a84_SIGINT) U FIREABLE(t_91606_a44_SIGDEADLK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(t_3061_a56_SIGPWR)) U X ((FIREABLE(t_131407_a84_SIGINT) U FIREABLE(t_91606_a44_SIGDEADLK)))))
lola: processed formula length: 109
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 3 markings, 3 edges
lola: ========================================

FORMULA RERS17pb114-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 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t_61034_a26_SIGCHLD))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t_61034_a26_SIGCHLD))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 2 markings, 2 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (FIREABLE(t_36983_a20_SIGSTOP)) OR (G (FIREABLE(t_80291_a4_SIGTSTP)) AND X (F (FIREABLE(t_36983_a20_SIGSTOP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(t_36983_a20_SIGSTOP)) OR (G (FIREABLE(t_80291_a4_SIGTSTP)) AND X (F (FIREABLE(t_36983_a20_SIGSTOP))))))
lola: processed formula length: 119
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 3 markings, 3 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(t_103605_a58_SIGTERM) U FIREABLE(t_148252_a73_SIGURG)) U X (FIREABLE(t_148116_a73_SIGURG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((FIREABLE(t_103605_a58_SIGTERM) U FIREABLE(t_148252_a73_SIGURG)) U X (FIREABLE(t_148116_a73_SIGURG)))))
lola: processed formula length: 110
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 4 markings, 4 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t_13463_a66_SIGEMT) U X (G (FIREABLE(t_14865_a10_SIGTSTP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(t_13463_a66_SIGEMT) U X (G (FIREABLE(t_14865_a10_SIGTSTP))))))
lola: processed formula length: 78
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 4 markings, 4 edges
lola: ========================================

FORMULA RERS17pb114-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 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_25209_a93_SIGTRAP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_25209_a93_SIGTRAP))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 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: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_55666_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_55666_a65_SIGUSR1))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 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: 6 markings, 7 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_51623_a42_SIGDEADLK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_51623_a42_SIGDEADLK))))
lola: processed formula length: 43
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 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: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_74942_a114_SIGUSR1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_74942_a114_SIGUSR1))))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 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: 5 markings, 5 edges

FORMULA RERS17pb114-PT-1-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_105175_a58_SIGTERM))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_105175_a58_SIGTERM))))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file RERS17pb114-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: 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: 5 markings, 5 edges

FORMULA RERS17pb114-PT-1-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(t_55609_a65_SIGUSR1)) U (F (FIREABLE(t_65727_a23_SIGHUP)) U G (FIREABLE(t_146972_a119_SIGSTOP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(t_55609_a65_SIGUSR1)) U (F (FIREABLE(t_65727_a23_SIGHUP)) U G (FIREABLE(t_146972_a119_SIGSTOP)))))
lola: processed formula length: 114
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 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: 5 markings, 5 edges

FORMULA RERS17pb114-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 3275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(t_64376_a64_SIGVTALRM)))) AND A (G ((FIREABLE(t_123450_a102_SIGTERM) OR FIREABLE(t_64376_a64_SIGVTALRM)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t_123450_a102_SIGTERM) OR FIREABLE(t_64376_a64_SIGVTALRM))))
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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G ((FIREABLE(t_123450_a102_SIGTERM) OR FIREABLE(t_64376_a64_SIGVTALRM))))
lola: processed formula length: 76
lola: 37 rewrites
lola: closed formula file RERS17pb114-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t_123450_a102_SIGTERM) AND NOT FIREABLE(t_64376_a64_SIGVTALRM))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLFireability-8 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: 533484 KB
lola: time consumption: 294 seconds

BK_STOP 1527801825213

--------------------
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="RERS17pb114-PT-2"
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/RERS17pb114-PT-2.tgz
mv RERS17pb114-PT-2 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 RERS17pb114-PT-2, 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-152749170000474"
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 ;