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 12M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-2000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658631000298
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526866950301

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-2000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-2000 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ JoinFreeModules-PT-2000 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 26002/65536 symbol table entries, 10032 collisions
lola: preprocessing...
lola: Size of bit vector: 320032
lola: finding significant places
lola: 10001 places, 16001 transitions, 8000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18001 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-2000-CTLFireability.task
lola: NOT(((A (G (FIREABLE(t7270))) OR (((FIREABLE(t10232) OR FIREABLE(t14670)) AND NOT FIREABLE(t15405)) OR E (F (FIREABLE(t2007))))) OR NOT(E (F ((FIREABLE(t14264) OR FIREABLE(t12083))))))) : (NOT((A (X (FIREABLE(t2032))) AND ((FIREABLE(t7528) AND FIREABLE(t8309) AND NOT FIREABLE(t9352)) OR A (F (FIREABLE(t14517)))))) AND A (((NOT FIREABLE(t10838) AND NOT FIREABLE(t8929)) U (FIREABLE(t10017) AND FIREABLE(t12586) AND NOT FIREABLE(t13919))))) : A (X (A (((FIREABLE(t4858) OR FIREABLE(t1794)) U (FIREABLE(t13698) AND FIREABLE(t8583)))))) : E (F ((FIREABLE(t14279) OR FIREABLE(t15774) OR (FIREABLE(t5555) AND NOT FIREABLE(t1549))))) : (E (F (FIREABLE(t9462))) OR A (((FIREABLE(t4004) AND FIREABLE(t9209) AND NOT FIREABLE(t11260)) U FIREABLE(t14161)))) : E (F (E (X (FIREABLE(t8079))))) : (NOT FIREABLE(t7429) AND E (F ((FIREABLE(t14406) OR A (F (FIREABLE(t12568))))))) : E (X ((E (F ((FIREABLE(t9911) OR FIREABLE(t11237)))) OR FIREABLE(t4632)))) : (E (X ((FIREABLE(t12136) AND FIREABLE(t9937)))) OR (((A (G (FIREABLE(t5101))) AND NOT FIREABLE(t13211)) OR (((FIREABLE(t4500) AND FIREABLE(t6933)) OR NOT FIREABLE(t4295)) AND E (X (FIREABLE(t7496))))) AND A (F (FIREABLE(t8808))))) : (E (X (E (G ((FIREABLE(t6652) AND FIREABLE(t8855)))))) AND NOT(E (G ((FIREABLE(t6610) OR FIREABLE(t14673) OR FIREABLE(t13015)))))) : ((E (F ((FIREABLE(t7879) OR (FIREABLE(t13796) AND FIREABLE(t1027))))) OR A ((NOT FIREABLE(t352) U FIREABLE(t15392)))) OR A (F (NOT FIREABLE(t9666)))) : (((FIREABLE(t6569) AND FIREABLE(t10666)) OR NOT(E (G ((FIREABLE(t12148) AND FIREABLE(t11570)))))) AND FIREABLE(t14754)) : ((((FIREABLE(t14495) AND FIREABLE(t8024) AND NOT FIREABLE(t15290) AND NOT FIREABLE(t10542) AND NOT FIREABLE(t4470)) AND A (X ((FIREABLE(t13107) AND FIREABLE(t4952))))) OR E (X (E (G (FIREABLE(t14046)))))) AND A (G (A (F (NOT FIREABLE(t7183)))))) : (NOT(E (F (A (X (FIREABLE(t3669)))))) OR FIREABLE(t12519)) : NOT((NOT(A (F ((FIREABLE(t1502) AND FIREABLE(t5469))))) OR E (((FIREABLE(t12237) AND FIREABLE(t8573)) U (FIREABLE(t5785) OR FIREABLE(t7568)))))) : ((E (G ((NOT FIREABLE(t2565) OR NOT FIREABLE(t2738)))) AND A (F (NOT FIREABLE(t2640)))) OR E (X (E (F ((FIREABLE(t1673) AND FIREABLE(t4106)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (NOT FIREABLE(t2032))) OR ((NOT FIREABLE(t7528) OR NOT FIREABLE(t8309) OR FIREABLE(t9352)) AND E (G (NOT FIREABLE(t14517))))) AND A (((NOT FIREABLE(t10838) AND NOT FIREABLE(t8929)) U (FIREABLE(t10017) AND FIREABLE(t12586) AND NOT FIREABLE(t13919)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t7528) OR NOT FIREABLE(t8309) OR FIREABLE(t9352))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t7528) OR NOT FIREABLE(t8309) OR FIREABLE(t9352))
lola: processed formula length: 65
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t14517)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(t14517)))
lola: processed formula length: 28
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t10838) AND NOT FIREABLE(t8929)) U (FIREABLE(t10017) AND FIREABLE(t12586) AND NOT FIREABLE(t13919))))
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 (((NOT FIREABLE(t10838) AND NOT FIREABLE(t8929)) U (FIREABLE(t10017) AND FIREABLE(t12586) AND NOT FIREABLE(t13919))))
lola: processed formula length: 119
lola: 58 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-1 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: A (X (A (((FIREABLE(t4858) OR FIREABLE(t1794)) U (FIREABLE(t13698) AND FIREABLE(t8583))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(A((FIREABLE(t4858) OR FIREABLE(t1794)) U (FIREABLE(t13698) AND FIREABLE(t8583))))
lola: processed formula length: 85
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6001 markings, 6001 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-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: E (X (E (F (FIREABLE(t8079)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: FIREABLE(t8079)
lola: processed formula length: 15
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((FIREABLE(t9911) OR FIREABLE(t11237)))))) OR E (X (FIREABLE(t4632))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(t4632)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(t4632))
lola: processed formula length: 19
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((FIREABLE(t9911) OR FIREABLE(t11237))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (FIREABLE(t9911) OR FIREABLE(t11237))
lola: processed formula length: 38
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((FIREABLE(t12136) AND FIREABLE(t9937)))) OR (((A (G (FIREABLE(t5101))) AND NOT FIREABLE(t13211)) OR (((FIREABLE(t4500) AND FIREABLE(t6933)) OR NOT FIREABLE(t4295)) AND E (X (FIREABLE(t7496))))) AND A (F (FIREABLE(t8808)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t13211)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t13211)
lola: processed formula length: 20
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t4500) AND FIREABLE(t6933)) OR NOT FIREABLE(t4295))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t4500) AND FIREABLE(t6933)) OR NOT FIREABLE(t4295))
lola: processed formula length: 63
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t8808)))
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(t8808)
lola: processed formula length: 19
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(t12136) AND FIREABLE(t9937))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((FIREABLE(t12136) AND FIREABLE(t9937)))
lola: processed formula length: 42
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((FIREABLE(t6652) AND FIREABLE(t8855)))))) AND A (F ((NOT FIREABLE(t6610) AND NOT FIREABLE(t14673) AND NOT FIREABLE(t13015)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t6610) AND NOT FIREABLE(t14673) AND NOT FIREABLE(t13015))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (FIREABLE(t6610) OR FIREABLE(t14673) OR FIREABLE(t13015))
lola: processed formula length: 59
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(t14495) AND FIREABLE(t8024) AND NOT FIREABLE(t15290) AND NOT FIREABLE(t10542) AND NOT FIREABLE(t4470)) AND A (X ((FIREABLE(t13107) AND FIREABLE(t4952))))) OR E (X (E (G (FIREABLE(t14046)))))) AND A (G (A (F (NOT FIREABLE(t7183))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t14495) AND FIREABLE(t8024) AND NOT FIREABLE(t15290) AND NOT FIREABLE(t10542) AND NOT FIREABLE(t4470))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t14495) AND FIREABLE(t8024) AND NOT FIREABLE(t15290) AND NOT FIREABLE(t10542) AND NOT FIREABLE(t4470))
lola: processed formula length: 112
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (NOT FIREABLE(t7183)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: FIREABLE(t7183)
lola: processed formula length: 15
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 220 markings, 220 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (NOT FIREABLE(t3669))))) OR FIREABLE(t12519))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t12519)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12519)
lola: processed formula length: 16
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(t3669)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(t3669)))))
lola: processed formula length: 43
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 15348 markings, 21337 edges, 3070 markings/sec, 0 secs
lola: 31802 markings, 43780 edges, 3291 markings/sec, 5 secs
lola: 46984 markings, 64950 edges, 3036 markings/sec, 10 secs
lola: 63321 markings, 88322 edges, 3267 markings/sec, 15 secs
lola: 79386 markings, 111941 edges, 3213 markings/sec, 20 secs
lola: 95407 markings, 135483 edges, 3204 markings/sec, 25 secs
lola: 111482 markings, 159121 edges, 3215 markings/sec, 30 secs
lola: 128229 markings, 182128 edges, 3349 markings/sec, 35 secs
lola: 145170 markings, 205058 edges, 3388 markings/sec, 40 secs
lola: 161437 markings, 228557 edges, 3253 markings/sec, 45 secs
lola: 177544 markings, 252241 edges, 3221 markings/sec, 50 secs
lola: 193637 markings, 275906 edges, 3219 markings/sec, 55 secs
lola: 209623 markings, 299387 edges, 3197 markings/sec, 60 secs
lola: 226223 markings, 322037 edges, 3320 markings/sec, 65 secs
lola: 242872 markings, 344676 edges, 3330 markings/sec, 70 secs
lola: 258992 markings, 367794 edges, 3224 markings/sec, 75 secs
lola: 274875 markings, 391098 edges, 3177 markings/sec, 80 secs
lola: 290778 markings, 414426 edges, 3181 markings/sec, 85 secs
lola: 306694 markings, 437780 edges, 3183 markings/sec, 90 secs
lola: 322985 markings, 460717 edges, 3258 markings/sec, 95 secs
lola: 339642 markings, 483361 edges, 3331 markings/sec, 100 secs
lola: 356081 markings, 506221 edges, 3288 markings/sec, 105 secs
lola: 371980 markings, 529547 edges, 3180 markings/sec, 110 secs
lola: 387878 markings, 552878 edges, 3180 markings/sec, 115 secs
lola: 403768 markings, 576181 edges, 3178 markings/sec, 120 secs
lola: 419487 markings, 599136 edges, 3144 markings/sec, 125 secs
lola: 436275 markings, 621913 edges, 3358 markings/sec, 130 secs
lola: 453134 markings, 644757 edges, 3372 markings/sec, 135 secs
lola: 469251 markings, 668294 edges, 3223 markings/sec, 140 secs
lola: 485314 markings, 691908 edges, 3213 markings/sec, 145 secs
lola: 491194 markings, 700784 edges, 1176 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G ((NOT FIREABLE(t2565) OR NOT FIREABLE(t2738)))) AND A (F (NOT FIREABLE(t2640)))) OR E (X (E (F ((FIREABLE(t1673) AND FIREABLE(t4106)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t2640)))
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: FIREABLE(t2640)
lola: processed formula length: 15
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t2565) OR NOT FIREABLE(t2738))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(t2565) OR NOT FIREABLE(t2738))))
lola: processed formula length: 53
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t14279) OR FIREABLE(t15774) OR (FIREABLE(t5555) AND NOT FIREABLE(t1549)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t14279) OR FIREABLE(t15774) OR (FIREABLE(t5555) AND NOT FIREABLE(t1549)))))
lola: processed formula length: 93
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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:625
lola: formula 0: (FIREABLE(t14279) OR FIREABLE(t15774) OR (FIREABLE(t5555) AND NOT FIREABLE(t1549)))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(t6569) AND FIREABLE(t10666)) OR A (F ((NOT FIREABLE(t12148) OR NOT FIREABLE(t11570))))) AND FIREABLE(t14754))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t6569) AND FIREABLE(t10666))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t6569) AND FIREABLE(t10666))
lola: processed formula length: 38
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t14754)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t14754)
lola: processed formula length: 16
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t12148) OR NOT FIREABLE(t11570))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (FIREABLE(t12148) AND FIREABLE(t11570))
lola: processed formula length: 39
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t7429) AND (E (F (FIREABLE(t14406))) OR E (F (FIREABLE(t12568)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t12568)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t12568)))
lola: processed formula length: 24
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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:625
lola: formula 0: FIREABLE(t12568)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t7429)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t7429)
lola: processed formula length: 19
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t9462))) OR A (((FIREABLE(t4004) AND FIREABLE(t9209) AND NOT FIREABLE(t11260)) U FIREABLE(t14161))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t9462)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t9462)))
lola: processed formula length: 23
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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:625
lola: formula 0: FIREABLE(t9462)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-2000-CTLFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t1502) AND FIREABLE(t5469)))) AND A (((NOT FIREABLE(t12237) OR NOT FIREABLE(t8573)) R (NOT FIREABLE(t5785) AND NOT FIREABLE(t7568)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t1502) AND FIREABLE(t5469))))
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(t1502) OR NOT FIREABLE(t5469))
lola: processed formula length: 45
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t7879) OR (FIREABLE(t13796) AND FIREABLE(t1027))))) OR (A ((NOT FIREABLE(t352) U FIREABLE(t15392))) OR A (F (NOT FIREABLE(t9666)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t9666)))
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: FIREABLE(t9666)
lola: processed formula length: 15
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 15 will run for 3409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t352) U FIREABLE(t15392)))
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 ((NOT FIREABLE(t352) U FIREABLE(t15392)))
lola: processed formula length: 43
lola: 58 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: 214 markings, 214 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================lola: subprocess 15 will run for 3409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t7270))) AND (((NOT FIREABLE(t10232) AND NOT FIREABLE(t14670)) OR FIREABLE(t15405)) AND (A (G (NOT FIREABLE(t2007))) AND E (F ((FIREABLE(t14264) OR FIREABLE(t12083)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING

lola: subprocess 15 will run for 3409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t10232) AND NOT FIREABLE(t14670)) OR FIREABLE(t15405))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t10232) AND NOT FIREABLE(t14670)) OR FIREABLE(t15405))
lola: processed formula length: 70
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t7270)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(t7270)))
lola: processed formula length: 27
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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:625
lola: formula 0: NOT FIREABLE(t7270)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to JoinFreeModules-PT-2000-CTLFireability-17-0.sara
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t14264) OR FIREABLE(t12083))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t14264) OR FIREABLE(t12083))))
lola: processed formula length: 47
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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)
sara: try reading problem file JoinFreeModules-PT-2000-CTLFireability-17-0.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t14264) OR FIREABLE(t12083))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-2000-CTLFireability-18-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (NOT FIREABLE(t3669))))) OR FIREABLE(t12519))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(t12519)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12519)
lola: processed formula length: 16
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(t3669)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(t3669)))))
lola: processed formula length: 43
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 15520 markings, 21508 edges, 3104 markings/sec, 0 secs
lola: 31232 markings, 43209 edges, 3142 markings/sec, 5 secs
lola: 46989 markings, 64955 edges, 3151 markings/sec, 10 secs
lola: 62548 markings, 86969 edges, 3112 markings/sec, 15 secs
lola: 77873 markings, 109293 edges, 3065 markings/sec, 20 secs
lola: 93234 markings, 131680 edges, 3072 markings/sec, 25 secs
lola: 108586 markings, 154054 edges, 3070 markings/sec, 30 secs
lola: 123957 markings, 176448 edges, 3074 markings/sec, 35 secs
lola: 139378 markings, 198942 edges, 3084 markings/sec, 40 secs
lola: 154181 markings, 220056 edges, 2961 markings/sec, 45 secs
sara: place or transition ordering is non-deterministic

lola: 171107 markings, 242969 edges, 3385 markings/sec, 50 secs
lola: 187938 markings, 265933 edges, 3366 markings/sec, 55 secs
lola: 204079 markings, 289684 edges, 3228 markings/sec, 60 secs
lola: 220137 markings, 313297 edges, 3212 markings/sec, 65 secs
lola: 236242 markings, 336975 edges, 3221 markings/sec, 70 secs
lola: 252623 markings, 360415 edges, 3276 markings/sec, 75 secs
lola: 269561 markings, 383341 edges, 3388 markings/sec, 80 secs
lola: 286086 markings, 406213 edges, 3305 markings/sec, 85 secs
lola: 301982 markings, 429536 edges, 3179 markings/sec, 90 secs
lola: 317870 markings, 452844 edges, 3178 markings/sec, 95 secs
lola: 333732 markings, 476111 edges, 3172 markings/sec, 100 secs
lola: 349601 markings, 499309 edges, 3174 markings/sec, 105 secs
lola: 366207 markings, 521904 edges, 3321 markings/sec, 110 secs
lola: 382809 markings, 544494 edges, 3320 markings/sec, 115 secs
lola: 398784 markings, 567458 edges, 3195 markings/sec, 120 secs
lola: 414174 markings, 589894 edges, 3078 markings/sec, 125 secs
lola: 429940 markings, 612991 edges, 3153 markings/sec, 130 secs
lola: 445889 markings, 636412 edges, 3190 markings/sec, 135 secs
lola: 461927 markings, 659540 edges, 3208 markings/sec, 140 secs
lola: 478568 markings, 682170 edges, 3328 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.

FORMULA JoinFreeModules-PT-2000-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t7879) OR (FIREABLE(t13796) AND FIREABLE(t1027))))) OR (A ((NOT FIREABLE(t352) U FIREABLE(t15392))) OR A (F (NOT FIREABLE(t9666)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t9666)))
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: FIREABLE(t9666)
lola: processed formula length: 15
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t352) U FIREABLE(t15392)))
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 ((NOT FIREABLE(t352) U FIREABLE(t15392)))
lola: processed formula length: 43
lola: 58 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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: 214 markings, 214 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t7879) OR (FIREABLE(t13796) AND FIREABLE(t1027)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t7879) OR (FIREABLE(t13796) AND FIREABLE(t1027)))))
lola: processed formula length: 68
lola: 55 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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:625
lola: formula 0: (FIREABLE(t7879) OR (FIREABLE(t13796) AND FIREABLE(t1027)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t7270))) AND (((NOT FIREABLE(t10232) AND NOT FIREABLE(t14670)) OR FIREABLE(t15405)) AND (A (G (NOT FIREABLE(t2007))) AND E (F ((FIREABLE(t14264) OR FIREABLE(t12083)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t10232) AND NOT FIREABLE(t14670)) OR FIREABLE(t15405))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t10232) AND NOT FIREABLE(t14670)) OR FIREABLE(t15405))
lola: processed formula length: 70
lola: 54 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2007)))
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:695
lola: processed formula: A (G (NOT FIREABLE(t2007)))
lola: processed formula length: 27
lola: 56 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLFireability.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:695
lola: formula 0: FIREABLE(t2007)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes yes yes yes no no yes no no unknown no yes
lola:
preliminary result: no no no yes yes yes yes yes no no yes no no unknown no yes
lola: memory consumption: 278476 KB
lola: time consumption: 317 seconds

BK_STOP 1526867267699

--------------------
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="JoinFreeModules-PT-2000"
export BK_EXAMINATION="CTLFireability"
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/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 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 JoinFreeModules-PT-2000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-152658631000298"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;