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 196K
-rw-r--r-- 1 mcc users 3.3K May 30 20:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 20:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 13:51 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.5K May 28 09:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.0K May 28 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 28 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 03:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 22K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169300004
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527775350900

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-06a 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 DiscoveryGPU-PT-06a formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ DiscoveryGPU-PT-06a @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 63
lola: finding significant places
lola: 63 places, 85 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 106 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-06a-CTLFireability.task
lola: E ((NOT FIREABLE(t63) U A (F ((FIREABLE(t62) OR FIREABLE(t8)))))) : (A (F (A (F ((FIREABLE(t69) AND FIREABLE(t79)))))) OR A (G (A (G (NOT FIREABLE(t83)))))) : E (F (A (X ((FIREABLE(t83) AND FIREABLE(t0) AND FIREABLE(t0) AND FIREABLE(t20)))))) : A (G (A (G (E (F (FIREABLE(t79))))))) : E ((E (F ((FIREABLE(t83) AND FIREABLE(t45)))) U (A (G (FIREABLE(t47))) OR FIREABLE(t27)))) : A (G (E (G (E (F (FIREABLE(t6))))))) : A (G (A (F (E (F (FIREABLE(t40))))))) : NOT(NOT(E (F (A (X (FIREABLE(t19))))))) : NOT(E (F ((FIREABLE(t84) AND FIREABLE(t26) AND (FIREABLE(t51) OR FIREABLE(t14)) AND ((FIREABLE(t31) AND FIREABLE(t55)) OR NOT FIREABLE(t24)))))) : NOT(A (F (E (F (FIREABLE(t66)))))) : E (F ((((FIREABLE(t84) OR FIREABLE(t57) OR NOT FIREABLE(t31)) AND (FIREABLE(t45) OR FIREABLE(t40))) AND ((NOT FIREABLE(t80) AND (FIREABLE(t66) OR FIREABLE(t56))) AND A (F (FIREABLE(t63))))))) : (E (((FIREABLE(t76) AND FIREABLE(t48) AND FIREABLE(t5)) U A (F (FIREABLE(t1))))) OR E (F (((FIREABLE(t49) OR FIREABLE(t52)) AND FIREABLE(t13) AND (FIREABLE(t15) OR FIREABLE(t50) OR FIREABLE(t2)))))) : A (G (E (F (NOT FIREABLE(t63))))) : FIREABLE(t37) : NOT(E (X (E (X ((FIREABLE(t69) OR FIREABLE(t47))))))) : ((NOT(A (F (NOT FIREABLE(t57)))) OR FIREABLE(t34)) AND FIREABLE(t14))
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:449
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t37)
lola: processed formula length: 13
lola: 30 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-13 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: E (F (A (X (FIREABLE(t19)))))
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(t19)))
lola: processed formula length: 27
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: 64 markings, 96 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-7 TRUE 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 (F (A (X ((FIREABLE(t83) AND FIREABLE(t0) AND FIREABLE(t0) AND FIREABLE(t20))))))
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(t83) AND FIREABLE(t0) AND FIREABLE(t0) AND FIREABLE(t20))))
lola: processed formula length: 81
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: 64 markings, 96 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-2 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: A (X (A (X ((NOT FIREABLE(t69) AND NOT FIREABLE(t47))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(AX((NOT FIREABLE(t69) AND NOT FIREABLE(t47))))
lola: processed formula length: 49
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-14 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: A (G (NOT FIREABLE(t66)))
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(t66)))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t66)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-9 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: A (G ((NOT FIREABLE(t84) OR NOT FIREABLE(t26) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t14)) OR ((NOT FIREABLE(t31) OR NOT FIREABLE(t55)) AND FIREABLE(t24)))))
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(t84) OR NOT FIREABLE(t26) OR (NOT FIREABLE(t51) AND NOT FIREABLE(t14)) OR ((NOT FIREABLE(t31) OR NOT FIREABLE(t55)) AND FIREABLE(t24)))))
lola: processed formula length: 161
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t84) AND FIREABLE(t26) AND (FIREABLE(t51) OR FIREABLE(t14)) AND ((FIREABLE(t31) AND FIREABLE(t55)) OR NOT FIREABLE(t24)))
lola: state equation: Generated DNF with 23 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-CTLFireability-5-0.sara
lola: lola: SUBRESULT
state equation: calling and running sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-8 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: A (G (E (F (FIREABLE(t40)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(t40)
lola: processed formula length: 13
lola: 31 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-CTLFireability.task
sara: try reading problem file DiscoveryGPU-PT-06a-CTLFireability-5-0.sara.
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: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-6 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 (F (NOT FIREABLE(t63)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(t63)
lola: processed formula length: 17
lola: 31 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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
sara: place or transition ordering is non-deterministic

lola: 913856 markings, 7042691 edges, 182771 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1771562 markings, 13455080 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(t79)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(t79)
lola: processed formula length: 13
lola: 31 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(t6)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(t6)
lola: processed formula length: 12
lola: 31 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 241 markings, 502 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t63) U A (F ((FIREABLE(t62) OR FIREABLE(t8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(NOT FIREABLE(t63) U A(TRUE U (FIREABLE(t62) OR FIREABLE(t8))))
lola: processed formula length: 65
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 77 markings, 256 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t84) OR FIREABLE(t57) OR NOT FIREABLE(t31)) AND (FIREABLE(t45) OR FIREABLE(t40))) AND ((NOT FIREABLE(t80) AND (FIREABLE(t66) OR FIREABLE(t56))) AND A (F (FIREABLE(t63)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (((FIREABLE(t84) OR FIREABLE(t57) OR NOT FIREABLE(t31)) AND (FIREABLE(t45) OR FIREABLE(t40))) AND ((NOT FIREABLE(t80) AND (FIREABLE(t66) OR FIREABLE(t56))) AND A(TRUE U FIREABLE(t63)))))
lola: processed formula length: 199
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 60270 markings, 386191 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((FIREABLE(t83) AND FIREABLE(t45)))) U (A (G (FIREABLE(t47))) OR FIREABLE(t27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(E(TRUE U (FIREABLE(t83) AND FIREABLE(t45))) U (NOT(E(TRUE U NOT FIREABLE(t47))) OR FIREABLE(t27)))
lola: processed formula length: 100
lola: 34 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 673020 markings, 6229933 edges, 134604 markings/sec, 0 secs
lola: 1220111 markings, 11405437 edges, 109418 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1771562 markings, 16660663 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((FIREABLE(t76) AND FIREABLE(t48) AND FIREABLE(t5)) U A (F (FIREABLE(t1))))) OR E (F (((FIREABLE(t49) OR FIREABLE(t52)) AND FIREABLE(t13) AND (FIREABLE(t15) OR FIREABLE(t50) OR FIREABLE(t2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: (E((FIREABLE(t76) AND FIREABLE(t48) AND FIREABLE(t5)) U A(TRUE U FIREABLE(t1))) OR E(TRUE U ((FIREABLE(t49) OR FIREABLE(t52)) AND FIREABLE(t13) AND (FIREABLE(t15) OR FIREABLE(t50) OR FIREABLE(t2)))))
lola: processed formula length: 202
lola: 33 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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 3 significant temporal operators and needs 13 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: 422 markings, 1297 edges

FORMULA DiscoveryGPU-PT-06a-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (FIREABLE(t57))) OR FIREABLE(t34)) AND FIREABLE(t14))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t14)
lola: processed formula length: 13
lola: 30 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t69) AND FIREABLE(t79)))) OR A (G (NOT FIREABLE(t83))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t83)))
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 (NOT FIREABLE(t83)))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: FIREABLE(t83)
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: 11 markings, 10 edges
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-CTLFireability-15-0.sara
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: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t69) AND FIREABLE(t79)))) OR A (G (NOT FIREABLE(t83))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t83)))
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 (NOT FIREABLE(t83)))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: FIREABLE(t83)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-CTLFireability-16-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t69) AND FIREABLE(t79))))
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(t69) OR NOT FIREABLE(t79))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
state equation: calling and running sara

FORMULA DiscoveryGPU-PT-06a-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes no no yes yes yes no yes no
lola:
preliminary result: yes no yes no no no no yes no no yes yes yes no yes no
sara: try reading problem file DiscoveryGPU-PT-06a-CTLFireability-16-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 14708 KB
lola: time consumption: 25 seconds

BK_STOP 1527775376088

--------------------
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="DiscoveryGPU-PT-06a"
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/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-PT-06a 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 DiscoveryGPU-PT-06a, 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 r280-csrt-152749169300004"
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 ;