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 224K
-rw-r--r-- 1 mcc users 3.3K May 29 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 29 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 28 11:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 28 11:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 28 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 28 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.2K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 27 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 26 06:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 06:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 59K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145400193
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527958563383

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating BusinessProcesses-PT-02 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ BusinessProcesses-PT-02 @ 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: 481/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 262
lola: finding significant places
lola: 262 places, 219 transitions, 217 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 273 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-02-CTLFireability.task
lola: (E (F (NOT(E (F (FIREABLE(t130)))))) OR A (G ((E (X (FIREABLE(t122))) AND (FIREABLE(t135) OR FIREABLE(t112) OR FIREABLE(t74)))))) : NOT((A ((NOT FIREABLE(t78) U (FIREABLE(t36) AND FIREABLE(t170)))) OR E (F (E (F (FIREABLE(t107))))))) : ((A (X (E (F (FIREABLE(t105))))) AND NOT FIREABLE(t145)) OR E (F (FIREABLE(t17)))) : (A (X ((((FIREABLE(t127) OR FIREABLE(t82)) AND FIREABLE(t159)) OR E (G (FIREABLE(t184)))))) OR (E (F (E (G (FIREABLE(t208))))) AND (E (F (NOT FIREABLE(t218))) AND A (X (NOT FIREABLE(t45)))))) : E (((FIREABLE(t180) OR FIREABLE(t34) OR (FIREABLE(t19) AND FIREABLE(t1)) OR (FIREABLE(t175) AND FIREABLE(t73))) U E (F ((FIREABLE(t94) AND FIREABLE(t194)))))) : NOT(E (F (A (G ((FIREABLE(t77) AND FIREABLE(t158))))))) : E (F (FIREABLE(t87))) : NOT((E (G (E (F (FIREABLE(t161))))) OR E (G ((FIREABLE(t91) OR FIREABLE(t167) OR FIREABLE(t197) OR FIREABLE(t139)))))) : (E (F ((FIREABLE(t44) OR FIREABLE(t121)))) AND E (X (((NOT FIREABLE(t205) OR NOT FIREABLE(t165)) AND NOT FIREABLE(t142))))) : NOT(E (G (A (G (NOT FIREABLE(t67)))))) : E (F (((A (X (FIREABLE(t166))) OR (NOT FIREABLE(t46) AND NOT FIREABLE(t97))) AND FIREABLE(t14)))) : E ((E (G (NOT FIREABLE(t6))) U (FIREABLE(t59) AND A (X (FIREABLE(t34)))))) : E (F (A (F ((FIREABLE(t141) AND FIREABLE(t122) AND (FIREABLE(t54) OR FIREABLE(t184))))))) : A (G (NOT(A (G (NOT FIREABLE(t40)))))) : (((A (F (FIREABLE(t110))) AND (E (F (FIREABLE(t162))) OR E (X (FIREABLE(t33))))) AND (FIREABLE(t35) OR (FIREABLE(t171) AND FIREABLE(t193) AND FIREABLE(t134) AND FIREABLE(t102) AND FIREABLE(t25)))) OR E (((FIREABLE(t209) OR NOT FIREABLE(t164)) U (FIREABLE(t111) AND FIREABLE(t89) AND FIREABLE(t75))))) : E ((E (F (FIREABLE(t215))) U FIREABLE(t31)))
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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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: 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:473
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:329
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:476
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:455
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:251
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 (F (A (G (NOT FIREABLE(t130))))) OR (A (G (E (X (FIREABLE(t122))))) AND A (G ((FIREABLE(t135) OR FIREABLE(t112) OR FIREABLE(t74))))))
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: A (G ((FIREABLE(t135) OR FIREABLE(t112) OR FIREABLE(t74))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t135) OR FIREABLE(t112) OR FIREABLE(t74))))
lola: processed formula length: 61
lola: 39 rewrites
lola: closed formula file BusinessProcesses-PT-02-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:694
lola: formula 0: (NOT FIREABLE(t135) AND NOT FIREABLE(t112) AND NOT FIREABLE(t74))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t130)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(t130)
lola: processed formula length: 14
lola: 39 rewrites
lola: closed formula file BusinessProcesses-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 68 markings, 67 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA BusinessProcesses-PT-02-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (E (F (FIREABLE(t105))))) AND NOT FIREABLE(t145)) OR E (F (FIREABLE(t17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t17)))
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(t17)))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file BusinessProcesses-PT-02-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(t17)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-02-CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA BusinessProcesses-PT-02-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((FIREABLE(t127) OR FIREABLE(t82)) AND FIREABLE(t159)) OR E (G (FIREABLE(t184)))))) OR (E (F (E (G (FIREABLE(t208))))) AND (E (F (NOT FIREABLE(t218))) AND A (X (NOT FIREABLE(t45))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t218)))
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(t218)))
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file BusinessProcesses-PT-02-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: formula 0: NOT FIREABLE(t218)
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t208)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t208)
lola: processed formula length: 14
lola: 38 rewrites
lola: closed formula file BusinessProcesses-PT-02-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 is not possibly preserved from any reachable marking.
lola: 14732 markings, 18484 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((FIREABLE(t127) OR FIREABLE(t82)) AND FIREABLE(t159)) OR E (G (FIREABLE(t184))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX((((FIREABLE(t127) OR FIREABLE(t82)) AND FIREABLE(t159)) OR NOT(A(TRUE U NOT FIREABLE(t184)))))
lola: processed formula length: 98
lola: 40 rewrites
lola: closed formula file BusinessProcesses-PT-02-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BusinessProcesses-PT-02-CTLFireability-3 FALSE 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 (F ((FIREABLE(t44) OR FIREABLE(t121)))) AND E (X (((NOT FIREABLE(t205) OR NOT FIREABLE(t165)) AND NOT FIREABLE(t142)))))
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 (F ((FIREABLE(t44) OR FIREABLE(t121))))
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(t44) OR FIREABLE(t121))))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file BusinessProcesses-PT-02-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(t44) OR FIREABLE(t121))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-02-CTLFireability-3-0.sara
lola: state equation: calling and running saralola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((NOT FIREABLE(t205) OR NOT FIREABLE(t165)) AND NOT FIREABLE(t142))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((NOT FIREABLE(t205) OR NOT FIREABLE(t165)) AND NOT FIREABLE(t142)))
lola: processed formula length: 72
lola: 38 rewrites
lola: closed formula file BusinessProcesses-PT-02-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA BusinessProcesses-PT-02-CTLFireability-8 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 (F (((A (X (FIREABLE(t166))) OR (NOT FIREABLE(t46) AND NOT FIREABLE(t97))) AND FIREABLE(t14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U ((AX(FIREABLE(t166)) OR (NOT FIREABLE(t46) AND NOT FIREABLE(t97))) AND FIREABLE(t14)))
lola: processed formula length: 95
lola: 39 rewrites
lola: closed formula file BusinessProcesses-PT-02-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 150 markings, 150 edges
lola: ========================================

FORMULA BusinessProcesses-PT-02-CTLFireability-10 TRUE 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 ((E (G (NOT FIREABLE(t6))) U (FIREABLE(t59) AND A (X (FIREABLE(t34))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(A(TRUE U FIREABLE(t6))) U (FIREABLE(t59) AND AX(FIREABLE(t34))))
lola: processed formula length: 70
lola: 41 rewrites
lola: closed formula file BusinessProcesses-PT-02-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 170715 markings, 1414966 edges, 34143 markings/sec, 0 secs
lola: 342359 markings, 2992647 edges, 34329 markings/sec, 5 secs
lola: 513203 markings, 4578124 edges, 34169 markings/sec, 10 secs
lola: 683447 markings, 6168640 edges, 34049 markings/sec, 15 secs
lola: 848581 markings, 7761493 edges, 33027 markings/sec, 20 secs
lola: 1002177 markings, 9367551 edges, 30719 markings/sec, 25 secs
lola: 1157664 markings, 10958526 edges, 31097 markings/sec, 30 secs
lola: 1322963 markings, 12547683 edges, 33060 markings/sec, 35 secs
lola: 1488021 markings, 14158125 edges, 33012 markings/sec, 40 secs
lola: 1642876 markings, 15776816 edges, 30971 markings/sec, 45 secs
lola: 1798307 markings, 17377777 edges, 31086 markings/sec, 50 secs
lola: 1964361 markings, 18965492 edges, 33211 markings/sec, 55 secs
lola: 2126958 markings, 20550350 edges, 32519 markings/sec, 60 secs
lola: 2280849 markings, 22152120 edges, 30778 markings/sec, 65 secs
lola: 2433016 markings, 23750053 edges, 30433 markings/sec, 70 secs
lola: 2588923 markings, 25336113 edges, 31181 markings/sec, 75 secs
lola: 2737652 markings, 26934950 edges, 29746 markings/sec, 80 secs
lola: 2879732 markings, 28547464 edges, 28416 markings/sec, 85 secs
lola: 3021817 markings, 30161023 edges, 28417 markings/sec, 90 secs
lola: 3176430 markings, 31772739 edges, 30923 markings/sec, 95 secs
lola: 3328115 markings, 33388918 edges, 30337 markings/sec, 100 secs
lola: 3470158 markings, 35016058 edges, 28409 markings/sec, 105 secs
lola: 3614446 markings, 36629350 edges, 28858 markings/sec, 110 secs
lola: 3777446 markings, 38237447 edges, 32600 markings/sec, 115 secs
lola: 3942357 markings, 39842940 edges, 32982 markings/sec, 120 secs
lola: 4097521 markings, 41459030 edges, 31033 markings/sec, 125 secs
lola: 4251529 markings, 43066512 edges, 30802 markings/sec, 130 secs
lola: 4407151 markings, 44665402 edges, 31124 markings/sec, 135 secs
lola: 4558113 markings, 46271614 edges, 30192 markings/sec, 140 secs
lola: 4700378 markings, 47893670 edges, 28453 markings/sec, 145 secs
lola: 4844909 markings, 49518974 edges, 28906 markings/sec, 150 secs
lola: 4999713 markings, 51142170 edges, 30961 markings/sec, 155 secs
lola: 5152568 markings, 52775782 edges, 30571 markings/sec, 160 secs
lola: 5296280 markings, 54419565 edges, 28742 markings/sec, 165 secs
lola: 5442138 markings, 56045365 edges, 29172 markings/sec, 170 secs
lola: 5603764 markings, 57646551 edges, 32325 markings/sec, 175 secs
lola: 5767085 markings, 59234449 edges, 32664 markings/sec, 180 secs
lola: 5920667 markings, 60837613 edges, 30716 markings/sec, 185 secs
lola: 6073976 markings, 62426137 edges, 30662 markings/sec, 190 secs
lola: 6228414 markings, 64008476 edges, 30888 markings/sec, 195 secs
lola: 6377967 markings, 65601508 edges, 29911 markings/sec, 200 secs
lola: 6517867 markings, 67205891 edges, 27980 markings/sec, 205 secs
lola: 6661506 markings, 68808770 edges, 28728 markings/sec, 210 secs
lola: 6813586 markings, 70406105 edges, 30416 markings/sec, 215 secs
lola: 6963641 markings, 72006465 edges, 30011 markings/sec, 220 secs
lola: 7104847 markings, 73620304 edges, 28241 markings/sec, 225 secs
lola: 7249643 markings, 75235874 edges, 28959 markings/sec, 230 secs
lola: 7401806 markings, 76849427 edges, 30433 markings/sec, 235 secs
lola: 7552784 markings, 78448589 edges, 30196 markings/sec, 240 secs
lola: 7695218 markings, 80058137 edges, 28487 markings/sec, 245 secs
lola: 7838862 markings, 81660543 edges, 28729 markings/sec, 250 secs
lola: 7981879 markings, 83267988 edges, 28603 markings/sec, 255 secs
lola: 8122263 markings, 84873526 edges, 28077 markings/sec, 260 secs
lola: 8257501 markings, 86486944 edges, 27048 markings/sec, 265 secs
lola: 8391583 markings, 88113698 edges, 26816 markings/sec, 270 secs
lola: 8523389 markings, 89745855 edges, 26361 markings/sec, 275 secs
lola: 8666448 markings, 91354781 edges, 28612 markings/sec, 280 secs
lola: 8806206 markings, 92974771 edges, 27952 markings/sec, 285 secs
lola: 8937650 markings, 94605682 edges, 26289 markings/sec, 290 secs
lola: 9073112 markings, 96234655 edges, 27092 markings/sec, 295 secs
lola: 9218107 markings, 97869736 edges, 28999 markings/sec, 300 secs
lola: 9371593 markings, 99487796 edges, 30697 markings/sec, 305 secs
lola: 9516824 markings, 101113702 edges, 29046 markings/sec, 310 secs
lola: 9662363 markings, 102734719 edges, 29108 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown
lola: memory consumption: 983124 KB
lola: time consumption: 324 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(t110))) AND ((E (F (FIREABLE(t162))) OR E (X (FIREABLE(t33)))) AND (FIREABLE(t35) OR (FIREABLE(t171) AND FIREABLE(t193) AND FIREABLE(t134) AND FIREABLE(t102) AND FIREABLE(t25))))) OR E (((FIREABLE(t209) OR NOT FIREABLE(t164)) U (FIREABLE(t111) AND FIREABLE(t89) AND FIREABLE(t75)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t162)))
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(t162)))
lola: processed formula length: 22
lola: 38 rewrites
lola: closed formula file BusinessProcesses-PT-02-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(t162)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to BusinessProcesses-PT-02-CTLFireability-6-0.sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t35) OR (FIREABLE(t171) AND FIREABLE(t193) AND FIREABLE(t134) AND FIREABLE(t102) AND FIREABLE(t25)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t35) OR (FIREABLE(t171) AND FIREABLE(t193) AND FIREABLE(t134) AND FIREABLE(t102) AND FIREABLE(t25)))
lola: processed formula length: 111
lola: 37 rewrites
lola: closed formula file BusinessProcesses-PT-02-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 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t209) OR NOT FIREABLE(t164)) U (FIREABLE(t111) AND FIREABLE(t89) AND FIREABLE(t75))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((FIREABLE(t209) OR NOT FIREABLE(t164)) U (FIREABLE(t111) AND FIREABLE(t89) AND FIREABLE(t75))))
lola: processed formula length: 100
lola: 40 rewrites
lola: closed formula file BusinessProcesses-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(t111) AND FIREABLE(t89) AND FIREABLE(t75))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-02-CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-02-CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 263716 markings, 1737028 edges, 52743 markings/sec, 0 secs
lola: sara is running 5 secs || 497891 markings, 3516256 edges, 46835 markings/sec, 5 secs
lola: sara is running 10 secs || 743005 markings, 5296254 edges, 49023 markings/sec, 10 secs
lola: sara is running 15 secs || 985166 markings, 7044850 edges, 48432 markings/sec, 15 secs
lola: sara is running 20 secs || 1197424 markings, 8813690 edges, 42452 markings/sec, 20 secs
lola: sara is running 25 secs || 1405552 markings, 10588314 edges, 41626 markings/sec, 25 secs
lola: sara is running 30 secs || 1634097 markings, 12343067 edges, 45709 markings/sec, 30 secs
lola: sara is running 35 secs || 1857537 markings, 14091162 edges, 44688 markings/sec, 35 secs
lola: sara is running 40 secs || 2056830 markings, 15843470 edges, 39859 markings/sec, 40 secs
lola: sara is running 45 secs || 2267813 markings, 17607591 edges, 42197 markings/sec, 45 secs
lola: sara is running 50 secs || 2504878 markings, 19336585 edges, 47413 markings/sec, 50 secs
lola: sara is running 55 secs || 2718751 markings, 21071072 edges, 42775 markings/sec, 55 secs
lola: sara is running 60 secs || 2920206 markings, 22815457 edges, 40291 markings/sec, 60 secs
lola: sara is running 65 secs || 3134697 markings, 24570456 edges, 42898 markings/sec, 65 secs
lola: sara is running 70 secs || 3348066 markings, 26300476 edges, 42674 markings/sec, 70 secs
lola: sara is running 75 secs || 3533623 markings, 28022352 edges, 37111 markings/sec, 75 secs
lola: sara is running 80 secs || 3712667 markings, 29752304 edges, 35809 markings/sec, 80 secs
lola: sara is running 85 secs || 3899394 markings, 31497410 edges, 37345 markings/sec, 85 secs
lola: sara is running 90 secs || 4108484 markings, 33215635 edges, 41818 markings/sec, 90 secs
lola: sara is running 95 secs || 4295830 markings, 34931826 edges, 37469 markings/sec, 95 secs
lola: sara is running 100 secs || 4472255 markings, 36641598 edges, 35285 markings/sec, 100 secs
lola: sara is running 105 secs || 4654872 markings, 38383551 edges, 36523 markings/sec, 105 secs
lola: sara is running 110 secs || 4875431 markings, 40097488 edges, 44112 markings/sec, 110 secs
lola: sara is running 115 secs || 5087992 markings, 41810277 edges, 42512 markings/sec, 115 secs
lola: sara is running 120 secs || 5286014 markings, 43526458 edges, 39604 markings/sec, 120 secs
lola: sara is running 125 secs || 5495865 markings, 45270832 edges, 41970 markings/sec, 125 secs
lola: sara is running 130 secs || 5712679 markings, 46989713 edges, 43363 markings/sec, 130 secs
lola: sara is running 135 secs || 5898735 markings, 48702923 edges, 37211 markings/sec, 135 secs
lola: sara is running 140 secs || 6075963 markings, 50421559 edges, 35446 markings/sec, 140 secs
lola: sara is running 145 secs || 6260441 markings, 52163150 edges, 36896 markings/sec, 145 secs
lola: sara is running 150 secs || 6468770 markings, 53881964 edges, 41666 markings/sec, 150 secs
lola: sara is running 155 secs || 6657946 markings, 55587064 edges, 37835 markings/sec, 155 secs
lola: sara is running 160 secs || 6831370 markings, 57290048 edges, 34685 markings/sec, 160 secs
lola: sara is running 165 secs || 7017668 markings, 59024846 edges, 37260 markings/sec, 165 secs
lola: sara is running 170 secs || 7235124 markings, 60784156 edges, 43491 markings/sec, 170 secs
lola: sara is running 175 secs || 7462942 markings, 62604208 edges, 45564 markings/sec, 175 secs
lola: sara is running 180 secs || 7673053 markings, 64416260 edges, 42022 markings/sec, 180 secs
lola: sara is running 185 secs || 7893577 markings, 66236939 edges, 44105 markings/sec, 185 secs
lola: sara is running 190 secs || 8117149 markings, 68035376 edges, 44714 markings/sec, 190 secs
lola: sara is running 195 secs || 8311212 markings, 69832858 edges, 38813 markings/sec, 195 secs
lola: sara is running 200 secs || 8496737 markings, 71634917 edges, 37105 markings/sec, 200 secs
lola: sara is running 205 secs || 8693033 markings, 73438466 edges, 39259 markings/sec, 205 secs
lola: sara is running 210 secs || 8909018 markings, 75229261 edges, 43197 markings/sec, 210 secs
lola: sara is running 215 secs || 9101700 markings, 77014766 edges, 38536 markings/sec, 215 secs
lola: sara is running 220 secs || 9286763 markings, 78806046 edges, 37013 markings/sec, 220 secs
lola: sara is running 225 secs || 9481265 markings, 80605169 edges, 38900 markings/sec, 225 secs
lola: sara is running 230 secs || 9697805 markings, 82395416 edges, 43308 markings/sec, 230 secs
lola: sara is running 235 secs || 9890973 markings, 84185157 edges, 38634 markings/sec, 235 secs
lola: sara is running 240 secs || 10077458 markings, 85987843 edges, 37297 markings/sec, 240 secs
lola: sara is running 245 secs || 10275717 markings, 87821880 edges, 39652 markings/sec, 245 secs
lola: sara is running 250 secs || 10477384 markings, 89621187 edges, 40333 markings/sec, 250 secs
lola: sara is running 255 secs || 10654368 markings, 91423712 edges, 35397 markings/sec, 255 secs
lola: sara is running 260 secs || 10819973 markings, 93207290 edges, 33121 markings/sec, 260 secs
lola: sara is running 265 secs || 10995246 markings, 95024031 edges, 35055 markings/sec, 265 secs
lola: sara is running 270 secs || 11183883 markings, 96798998 edges, 37727 markings/sec, 270 secs
lola: sara is running 275 secs || 11362133 markings, 98572919 edges, 35650 markings/sec, 275 secs
lola: sara is running 280 secs || 11537069 markings, 100378658 edges, 34987 markings/sec, 280 secs
lola: sara is running 285 secs || 11704980 markings, 102182121 edges, 33582 markings/sec, 285 secs
lola: sara is running 290 secs || 11885483 markings, 103978152 edges, 36101 markings/sec, 290 secs
lola: sara is running 295 secs || 12088117 markings, 105699485 edges, 40527 markings/sec, 295 secs
lola: sara is running 300 secs || 12271693 markings, 107406813 edges, 36715 markings/sec, 300 secs
lola: sara is running 305 secs || 12449630 markings, 109121322 edges, 35587 markings/sec, 305 secs
lola: sara is running 310 secs || 12634859 markings, 110858566 edges, 37046 markings/sec, 310 secs
lola: sara is running 315 secs || 12828232 markings, 112556240 edges, 38675 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown yes no unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown
lola: memory consumption: 464620 KB
lola: time consumption: 648 seconds
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown yes no unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown
lola: memory consumption: 464620 KB
lola: time consumption: 648 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown
lola:
preliminary result: yes unknown yes no unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown
lola: memory consumption: 14600 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="BusinessProcesses-PT-02"
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/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 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 BusinessProcesses-PT-02, 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 r268-smll-152749145400193"
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 ;