About the Execution of LoLA for GlobalResAllocation-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
271.140 | 37352.00 | 40412.00 | 30.00 | TFFTTTFFTFFFTTTF | normal |
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 11M
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 350K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 182K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 505K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 566K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GlobalResAllocation-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998500409
=====================================================================
--------------------
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 GlobalResAllocation-PT-03-CTLCardinality-00
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-01
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-02
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-03
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-04
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-05
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-06
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-07
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-08
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-09
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-10
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-11
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-12
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-13
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-14
FORMULA_NAME GlobalResAllocation-PT-03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526811587895
info: Time: 3600 - MCC
===========================================================================================
prep: translating GlobalResAllocation-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GlobalResAllocation-PT-03 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ GlobalResAllocation-PT-03 @ 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: 4824/65536 symbol table entries, 2874 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-PT-03-CTLCardinality.task
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 <= pr_in_1 + pr_in_2 + pr_in_3)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (2 <= Processes_1)
lola: LP says that atomic proposition is always true: (in_critical_s_2_5 <= pr_in_2)
lola: LP says that atomic proposition is always false: (3 <= in_critical_s_1_4)
lola: LP says that atomic proposition is always false: (3 <= Resources_4)
lola: E (G (((pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)))) : NOT(E (G ((1 <= Processes_1 + Processes_2 + Processes_3)))) : E (F ((((3 <= pr_in_1 + pr_in_2 + pr_in_3) OR (3 <= pr_released_3 + pr_released_2 + pr_released_1)) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) AND (2 <= Processes_1 + Processes_2 + Processes_3) AND (3 <= Processes_1 + Processes_2 + Processes_3)))) : E (G (A ((TRUE U (1 <= pr_released_3 + pr_released_2 + pr_released_1))))) : E (F ((((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + 1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) AND (pr_released_3 + pr_released_2 + pr_released_1 <= 1)) AND E (G ((3 <= pr_in_1 + pr_in_2 + pr_in_3)))))) : E (G (A (F (((1 <= Processes_1 + Processes_2 + Processes_3)))))) : A (G ((A (F ((3 <= pr_in_1 + pr_in_2 + pr_in_3))) OR ((pr_in_1 + pr_in_2 + pr_in_3 + 1 <= Processes_1 + Processes_2 + Processes_3) OR (pr_released_3 + pr_released_2 + pr_released_1 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))))) : A (F (NOT(E (F ((Processes_1 + Processes_2 + Processes_3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)))))) : A (X (A (G (TRUE)))) : E (G ((A (F ((1 <= in_critical_s_1_3))) OR A (G ((2 <= pr_released_2)))))) : (A (F ((Resources_1 <= in_critical_s_1_5))) OR ()) : NOT(NOT(E (F (FALSE)))) : NOT(A (F (A (G ((in_critical_s_2_4 <= pr_released_2)))))) : (E (G (((3 <= pr_released_1) OR (Processes_3 <= in_critical_s_3_3) OR (in_critical_s_2_4 + 1 <= Resources_6)))) OR (1 <= in_critical_s_1_5)) : E (X (E (G (((pr_in_1 <= Processes_1) OR (pr_in_1 <= in_critical_s_2_2)))))) : ((E (F (FALSE)) AND NOT(E (G ((in_critical_s_3_5 <= Resources_3))))) AND E (X (E (X ((1 <= in_critical_s_2_4))))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 32 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 32 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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 GlobalResAllocation-PT-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 32 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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 GlobalResAllocation-PT-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((pr_in_1 <= Processes_1) OR (pr_in_1 <= in_critical_s_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: ((pr_in_1 <= Processes_1) OR (pr_in_1 <= in_critical_s_2_2))
lola: processed formula length: 61
lola: 33 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 5 markings, 5 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= pr_in_1 + pr_in_2 + pr_in_3) OR (3 <= pr_released_3 + pr_released_2 + pr_released_1)) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critic... (shortened)
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 ((((3 <= pr_in_1 + pr_in_2 + pr_in_3) OR (3 <= pr_released_3 + pr_released_2 + pr_released_1)) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critic... (shortened)
lola: processed formula length: 654
lola: 33 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: (((3 <= pr_in_1 + pr_in_2 + pr_in_3) OR (3 <= pr_released_3 + pr_released_2 + pr_released_1)) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6) AND (2 <= Processes_1 + Processes_2 + Processes_3) AND (3 <= Processes_1 + Processes_2 + Processes_3))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-PT-03-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-PT-03-CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6320 markings, 116178 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Resources_1 <= in_critical_s_1_5)))
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: (in_critical_s_1_5 + 1 <= Resources_1)
lola: processed formula length: 38
lola: 34 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Processes_1 + Processes_2 + Processes_3 <= 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: (1 <= Processes_1 + Processes_2 + Processes_3)
lola: processed formula length: 46
lola: 34 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: 5 markings, 5 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))))
lola: processed formula length: 155
lola: 32 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 9 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((1 <= Processes_1 + Processes_2 + Processes_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((1 <= Processes_1 + Processes_2 + Processes_3))))))
lola: processed formula length: 78
lola: 34 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: 99 markings, 253 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= pr_released_3 + pr_released_2 + pr_released_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (1 <= pr_released_3 + pr_released_2 + pr_released_1)))))
lola: processed formula length: 82
lola: 34 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: 448 markings, 2652 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((1 <= in_critical_s_1_3))) OR A (G ((2 <= pr_released_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (1 <= in_critical_s_1_3))) AND E(TRUE U (pr_released_2 <= 1)))))
lola: processed formula length: 91
lola: 38 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: 9 markings, 11 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((3 <= pr_in_1 + pr_in_2 + pr_in_3))) OR ((pr_in_1 + pr_in_2 + pr_in_3 + 1 <= Processes_1 + Processes_2 + Processes_3) OR (pr_released_3 + pr_released_2 + pr_released_1 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (3 <= pr_in_1 + pr_in_2 + pr_in_3))) AND ((Processes_1 + Processes_2 + Processes_3 <= pr_in_1 + pr_in_2 + pr_in_3) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 <= pr_released_3 + pr_released_2 + pr_released_1)))))
lola: processed formula length: 282
lola: 36 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: 67 markings, 111 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + 1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + 1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 +... (shortened)
lola: processed formula length: 573
lola: 35 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.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: 9 markings, 10 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((pr_released_2 + 1 <= in_critical_s_2_4)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (pr_released_2 + 1 <= in_critical_s_2_4)
lola: processed formula length: 40
lola: 33 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 18 markings, 21 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((3 <= pr_released_1) OR (Processes_3 <= in_critical_s_3_3) OR (in_critical_s_2_4 + 1 <= Resources_6)))) OR (1 <= in_critical_s_1_5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= in_critical_s_1_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= in_critical_s_1_5)
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.task
lola: processed formula with 1 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 3532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= pr_released_1) OR (Processes_3 <= in_critical_s_3_3) OR (in_critical_s_2_4 + 1 <= Resources_6))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((3 <= pr_released_1) OR (Processes_3 <= in_critical_s_3_3) OR (in_critical_s_2_4 + 1 <= Resources_6))))
lola: processed formula length: 112
lola: 32 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + 1 <= Processes_1 + Processes_2 + Processes_3)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (Processes_1 + Processes_2 + Processes_3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: processed formula length: 126
lola: 34 rewrites
lola: closed formula file GlobalResAllocation-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 12 markings, 12 edges
lola: ========================================
FORMULA GlobalResAllocation-PT-03-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no no yes no no no yes yes yes no
lola:
preliminary result: yes no no yes yes yes no no yes no no no yes yes yes no
lola: memory consumption: 78656 KB
lola: time consumption: 37 seconds
BK_STOP 1526811625247
--------------------
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="GlobalResAllocation-PT-03"
export BK_EXAMINATION="CTLCardinality"
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/GlobalResAllocation-PT-03.tgz
mv GlobalResAllocation-PT-03 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 GlobalResAllocation-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-blw7-152649998500409"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
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 ;