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 240K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6.3K 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.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R003C010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579100347
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527005706670

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R003C010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ResAllocation-PT-R003C010 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ ResAllocation-PT-R003C010 @ 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: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 60
lola: finding significant places
lola: 60 places, 40 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C010-CTLFireability.task
lola: E (F ((A ((FIREABLE(t_9_1) U FIREABLE(t_5_0))) AND (E (X (FIREABLE(t_8_0))) AND (FIREABLE(t_3_3) AND FIREABLE(t_8_1) AND NOT FIREABLE(t_6_1)))))) : (E (F ((FIREABLE(t_0_2) AND A (F (FIREABLE(t_7_0)))))) OR FIREABLE(t_1_1)) : NOT(((A (G ((FIREABLE(t_8_0) AND FIREABLE(t_3_1)))) OR (E (G (FIREABLE(t_9_2))) AND E (G (FIREABLE(t_2_0))))) OR A (G (E (F (FIREABLE(t_7_1))))))) : E (((((FIREABLE(t_2_1) OR FIREABLE(t_5_3)) AND FIREABLE(t_1_0)) OR E (G (FIREABLE(t_9_3)))) U (FIREABLE(t_8_2) AND FIREABLE(t_5_2) AND FIREABLE(t_7_2)))) : E (X ((E ((FIREABLE(t_8_1) U FIREABLE(t_9_0))) AND E (F ((FIREABLE(t_3_2))))))) : (A (F (E (F ((FIREABLE(t_7_0) AND FIREABLE(t_2_2)))))) OR A (((NOT FIREABLE(t_5_1) AND NOT FIREABLE(t_2_3)) U FIREABLE(t_4_2)))) : (E (F (A (X ((FIREABLE(t_7_1) AND FIREABLE(t_1_2)))))) OR FIREABLE(t_7_1)) : (A (X ((FIREABLE(t_0_1) AND E (X (FIREABLE(t_3_2)))))) OR E ((E (F (FIREABLE(t_1_0))) U A (G (FIREABLE(t_4_1)))))) : E ((FIREABLE(t_6_0) U A (F (FIREABLE(t_6_2))))) : A (X (E (F (A (X (FIREABLE(t_6_1))))))) : E (F (E (G (FIREABLE(t_0_3))))) : A (G (E (X ((NOT FIREABLE(t_7_0) AND NOT FIREABLE(t_7_1)))))) : E ((NOT FIREABLE(t_4_3) U A (X (FIREABLE(t_1_1))))) : A (G (E (X (A (F (FIREABLE(t_8_1))))))) : NOT(E ((E (F (FIREABLE(t_1_1))) U (FIREABLE(t_2_0) AND FIREABLE(t_1_0) AND NOT FIREABLE(t_8_1))))) : ((NOT(E ((FIREABLE(t_0_2) U FIREABLE(t_1_0)))) AND (((NOT FIREABLE(t_8_0) AND NOT FIREABLE(t_4_2)) AND E (G (FIREABLE(t_4_2)))) OR ((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_9_2)) AND (NOT FIREABLE(t_0_2) OR (FIREABLE(t_5_0) AND FIREABLE(t_3_1)))))) OR FIREABLE(t_2_2))
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:315
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:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
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 (F ((A ((FIREABLE(t_9_1) U FIREABLE(t_5_0))) AND (E (X (FIREABLE(t_8_0))) AND (FIREABLE(t_3_3) AND FIREABLE(t_8_1) AND NOT FIREABLE(t_6_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (A(FIREABLE(t_9_1) U FIREABLE(t_5_0)) AND (EX(FIREABLE(t_8_0)) AND (FIREABLE(t_3_3) AND FIREABLE(t_8_1) AND NOT FIREABLE(t_6_1)))))
lola: processed formula length: 140
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 260843 markings, 2032443 edges

FORMULA ResAllocation-PT-R003C010-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E ((FIREABLE(t_8_1) U FIREABLE(t_9_0))) AND E (F ((FIREABLE(t_3_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((E(FIREABLE(t_8_1) U FIREABLE(t_9_0)) AND E(TRUE U (FIREABLE(t_3_2)))))
lola: processed formula length: 74
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 72009 markings, 182857 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-4 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 (F (A (X ((FIREABLE(t_7_1) AND FIREABLE(t_1_2)))))) OR FIREABLE(t_7_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_7_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_7_1)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((FIREABLE(t_7_1) AND FIREABLE(t_1_2))))))
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(t_7_1) AND FIREABLE(t_1_2))))
lola: processed formula length: 51
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 25 markings, 28 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (FIREABLE(t_0_1))) AND A (X (E (X (FIREABLE(t_3_2)))))) OR E ((E (F (FIREABLE(t_1_0))) U A (G (FIREABLE(t_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:734
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: ((AX(FIREABLE(t_0_1)) AND AX(EX(FIREABLE(t_3_2)))) OR E(E(TRUE U FIREABLE(t_1_0)) U NOT(E(TRUE U NOT FIREABLE(t_4_1)))))
lola: processed formula length: 120
lola: 37 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 527104 markings, 4212092 edges

FORMULA ResAllocation-PT-R003C010-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (A (X (FIREABLE(t_6_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U AX(FIREABLE(t_6_1))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 144 markings, 181 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((NOT FIREABLE(t_7_0) AND NOT FIREABLE(t_7_1))))))
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(t_7_0) AND NOT FIREABLE(t_7_1))))))
lola: processed formula length: 69
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 25 markings, 28 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-11 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: E ((NOT FIREABLE(t_4_3) U A (X (FIREABLE(t_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(NOT FIREABLE(t_4_3) U AX(FIREABLE(t_1_1)))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 25 markings, 28 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (A (F (FIREABLE(t_8_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
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(A(TRUE U FIREABLE(t_8_1))))))
lola: processed formula length: 49
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 157 markings, 171 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-13 FALSE 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: E (F (E (G (FIREABLE(t_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t_0_3)
lola: processed formula length: 15
lola: 31 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 7 markings, 7 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t_6_0) U A (F (FIREABLE(t_6_2)))))
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(FIREABLE(t_6_0) U A(TRUE U FIREABLE(t_6_2)))
lola: processed formula length: 46
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 322752 markings, 1433844 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-8 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: A ((A (G (NOT FIREABLE(t_1_1))) R (NOT FIREABLE(t_2_0) OR NOT FIREABLE(t_1_0) OR FIREABLE(t_8_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(E(E(TRUE U FIREABLE(t_1_1)) U (FIREABLE(t_2_0) AND FIREABLE(t_1_0) AND NOT FIREABLE(t_8_1))))
lola: processed formula length: 97
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 527104 markings, 3773612 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((FIREABLE(t_2_1) OR FIREABLE(t_5_3)) AND FIREABLE(t_1_0)) OR E (G (FIREABLE(t_9_3)))) U (FIREABLE(t_8_2) AND FIREABLE(t_5_2) AND FIREABLE(t_7_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((((FIREABLE(t_2_1) OR FIREABLE(t_5_3)) AND FIREABLE(t_1_0)) OR NOT(A(TRUE U NOT FIREABLE(t_9_3)))) U (FIREABLE(t_8_2) AND FIREABLE(t_5_2) AND FIREABLE(t_7_2)))
lola: processed formula length: 162
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 553600 markings, 2798555 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t_0_2) AND A (F (FIREABLE(t_7_0)))))) OR FIREABLE(t_1_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_1_1)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_0_2) AND A (F (FIREABLE(t_7_0))))))
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(t_0_2) AND A(TRUE U FIREABLE(t_7_0))))
lola: processed formula length: 57
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 274859 markings, 1755379 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t_7_0) AND FIREABLE(t_2_2)))) OR A (((NOT FIREABLE(t_5_1) AND NOT FIREABLE(t_2_3)) U FIREABLE(t_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_7_0) AND FIREABLE(t_2_2))))
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(t_7_0) AND FIREABLE(t_2_2))))
lola: processed formula length: 45
lola: 31 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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(t_7_0) AND FIREABLE(t_2_2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLFireability-13-0.sara
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 ResAllocation-PT-R003C010-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A ((NOT FIREABLE(t_0_2) R NOT FIREABLE(t_1_0))) AND (((NOT FIREABLE(t_8_0) AND NOT FIREABLE(t_4_2)) AND E (G (FIREABLE(t_4_2)))) OR ((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_9_2)) AND (NOT FIREABLE(t_0_2) OR (FIREABLE(t_5_0) AND FIREABLE(t_3_1)))))) OR FIREABLE(t_2_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_2_2)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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 15 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t_0_2) R NOT FIREABLE(t_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((NOT FIREABLE(t_0_2) R NOT FIREABLE(t_1_0)))
lola: processed formula length: 47
lola: 36 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: SUBRESULT
lola: formula 0: FIREABLE(t_1_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
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: ((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_9_2)) AND (NOT FIREABLE(t_0_2) OR (FIREABLE(t_5_0) AND FIREABLE(t_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_9_2)) AND (NOT FIREABLE(t_0_2) OR (FIREABLE(t_5_0) AND FIREABLE(t_3_1))))
lola: processed formula length: 115
lola: 30 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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 ResAllocation-PT-R003C010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(t_8_0) OR NOT FIREABLE(t_3_1)))) AND ((A (F (NOT FIREABLE(t_9_2))) OR A (F (NOT FIREABLE(t_2_0)))) AND E (F (A (G (NOT FIREABLE(t_7_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_8_0) OR NOT FIREABLE(t_3_1))))
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(t_8_0) OR NOT FIREABLE(t_3_1))))
lola: processed formula length: 53
lola: 31 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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(t_8_0) OR NOT FIREABLE(t_3_1))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: The predicate is reachable.
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: A (F (NOT FIREABLE(t_2_0)))
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(t_2_0)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t_9_2)))
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(t_9_2)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(t_8_0) OR NOT FIREABLE(t_3_1)))) AND ((A (F (NOT FIREABLE(t_9_2))) OR A (F (NOT FIREABLE(t_2_0)))) AND E (F (A (G (NOT FIREABLE(t_7_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_8_0) OR NOT FIREABLE(t_3_1))))
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(t_8_0) OR NOT FIREABLE(t_3_1))))
lola: processed formula length: 53
lola: 31 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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(t_8_0) OR NOT FIREABLE(t_3_1))
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLFireability-16-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t_7_1)))))
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(t_7_1)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: 4 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t_2_0)))
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(t_2_0)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t_9_2)))
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(t_9_2)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file ResAllocation-PT-R003C010-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ResAllocation-PT-R003C010-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes no no yes yes no yes no yes yes
lola:
preliminary result: yes yes yes no no yes yes no no yes yes no yes no yes yes
lola: memory consumption: 15000 KB
lola: time consumption: 17 seconds

BK_STOP 1527005744424

--------------------
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="ResAllocation-PT-R003C010"
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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ResAllocation-PT-R003C010, 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 r136-qhx2-152673579100347"
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 ;