fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r088-blw7-152649998100116
Last Updated
June 26, 2018

About the Execution of LoLA for FlexibleBarrier-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
733.800 3600000.00 318978.00 280.00 TTTFFTTFFFF?TFFT 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 208K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100116
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526634117788

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-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 FlexibleBarrier-PT-06a formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ FlexibleBarrier-PT-06a @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 229/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 75
lola: finding significant places
lola: 75 places, 154 transitions, 67 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 142 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06a-CTLFireability.task
lola: E (F (FIREABLE(t78))) : NOT(E (((FIREABLE(t130) OR NOT FIREABLE(t135)) U (FIREABLE(t59) AND FIREABLE(t126) AND FIREABLE(t39) AND FIREABLE(t68))))) : E (F ((FIREABLE(t18) AND FIREABLE(t90) AND (FIREABLE(t112) OR FIREABLE(t77))))) : E (F (A (G (NOT FIREABLE(t94))))) : NOT((A (G ((NOT FIREABLE(t131) OR NOT FIREABLE(t106)))) AND E (F ((NOT FIREABLE(t34) OR (FIREABLE(t127) AND FIREABLE(t98))))))) : (NOT(A (X (NOT FIREABLE(t62)))) OR A (G (E (F ((FIREABLE(t93) OR FIREABLE(t62))))))) : A (G ((A (X (NOT FIREABLE(t139))) OR E (F ((FIREABLE(t42) AND FIREABLE(t25))))))) : E (F (NOT(E (F ((FIREABLE(t10) AND FIREABLE(t100))))))) : E (F (NOT(E (F (FIREABLE(t14)))))) : (E ((A (X (FIREABLE(t82))) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95)))) AND E (X (E (F ((FIREABLE(t28) AND FIREABLE(t105))))))) : E (F ((A (X ((FIREABLE(t151) OR FIREABLE(t138)))) AND (E (G (FIREABLE(t9))) OR E (F (FIREABLE(t46))))))) : (E (F ((FIREABLE(t59) AND FIREABLE(t36)))) OR NOT(((A (G (FIREABLE(t45))) AND (NOT FIREABLE(t54) OR NOT FIREABLE(t93))) OR (E (F (FIREABLE(t152))) OR (FIREABLE(t57) AND FIREABLE(t148) AND NOT FIREABLE(t0)))))) : (A (G (((NOT FIREABLE(t118) OR NOT FIREABLE(t56)) OR E (F (FIREABLE(t152)))))) OR NOT(NOT((A (G (FIREABLE(t125))) OR FIREABLE(t90))))) : A ((NOT FIREABLE(t55) U ((NOT FIREABLE(t117) AND (FIREABLE(t136) OR FIREABLE(t131))) AND E (F (FIREABLE(t118)))))) : FIREABLE(t124) : (A (G (((NOT FIREABLE(t92) OR NOT FIREABLE(t74)) OR E (G (FIREABLE(t119)))))) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t141) AND (FIREABLE(t97) OR FIREABLE(t7) OR FIREABLE(t3))))
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: rewrite Frontend/Parser/formula_rewrite.k:315
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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(t124)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t124)
lola: processed formula length: 14
lola: 41 rewrites
lola: closed formula file FlexibleBarrier-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 FlexibleBarrier-PT-06a-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X (NOT FIREABLE(t139))) OR E (F ((FIREABLE(t42) AND FIREABLE(t25)))))))
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:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(AX(NOT FIREABLE(t139))) AND NOT(E(TRUE U (FIREABLE(t42) AND FIREABLE(t25)))))))
lola: processed formula length: 97
lola: 45 rewrites
lola: closed formula file FlexibleBarrier-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: 898463 markings, 2762779 edges, 179693 markings/sec, 0 secs
lola: 1639565 markings, 5466893 edges, 148220 markings/sec, 5 secs
lola: 2315999 markings, 8230352 edges, 135287 markings/sec, 10 secs
lola: 2933574 markings, 11165648 edges, 123515 markings/sec, 15 secs
lola: 2978365 markings, 15014393 edges, 8958 markings/sec, 20 secs
lola: 2982792 markings, 18690971 edges, 885 markings/sec, 25 secs
lola: 2984992 markings, 22442165 edges, 440 markings/sec, 30 secs
lola: 2985984 markings, 26694849 edges, 198 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2985985 markings, 26984997 edges

FORMULA FlexibleBarrier-PT-06a-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (X (FIREABLE(t82))) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95)))) AND E (X (E (F ((FIREABLE(t28) AND FIREABLE(t105)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
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: (E(AX(FIREABLE(t82)) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95))) AND EX(E(TRUE U (FIREABLE(t28) AND FIREABLE(t105)))))
lola: processed formula length: 136
lola: 45 rewrites
lola: closed formula file FlexibleBarrier-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: 1500776 markings, 4180930 edges, 300155 markings/sec, 0 secs
lola: 2590805 markings, 8384687 edges, 218006 markings/sec, 5 secs
lola: 2679047 markings, 11415609 edges, 17648 markings/sec, 10 secs
lola: 2777434 markings, 15174118 edges, 19677 markings/sec, 15 secs
lola: 2864033 markings, 19188948 edges, 17320 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2874961 markings, 20017757 edges

FORMULA FlexibleBarrier-PT-06a-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((FIREABLE(t151) OR FIREABLE(t138)))) AND (E (G (FIREABLE(t9))) OR E (F (FIREABLE(t46)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (AX((FIREABLE(t151) OR FIREABLE(t138))) AND (NOT(A(TRUE U NOT FIREABLE(t9))) OR E(TRUE U FIREABLE(t46)))))
lola: processed formula length: 116
lola: 46 rewrites
lola: closed formula file FlexibleBarrier-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: 1259962 markings, 3867935 edges, 251992 markings/sec, 0 secs
lola: 2213555 markings, 7526305 edges, 190719 markings/sec, 5 secs
lola: 2970266 markings, 11412979 edges, 151342 markings/sec, 10 secs
lola: 2979271 markings, 15212466 edges, 1801 markings/sec, 15 secs
lola: 2983169 markings, 18873478 edges, 780 markings/sec, 20 secs
lola: 2985157 markings, 22646964 edges, 398 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2985985 markings, 26666497 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (FIREABLE(t62))) OR A (G (E (F ((FIREABLE(t93) OR FIREABLE(t62)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((FIREABLE(t93) OR FIREABLE(t62))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (FIREABLE(t93) OR FIREABLE(t62))
lola: processed formula length: 33
lola: 42 rewrites
lola: closed formula file FlexibleBarrier-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: 1171985 markings, 3153742 edges, 234397 markings/sec, 0 secs
lola: 1937060 markings, 7301441 edges, 153015 markings/sec, 5 secs
lola: 2538537 markings, 11426515 edges, 120295 markings/sec, 10 secs
lola: 2984171 markings, 15426704 edges, 89127 markings/sec, 15 secs
lola: 2985855 markings, 20522661 edges, 337 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 2985985 markings, 25627777 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t78)))
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(t78)))
lola: processed formula length: 21
lola: 42 rewrites
lola: closed formula file FlexibleBarrier-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:625
lola: formula 0: FIREABLE(t78)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06a-CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges

FORMULA FlexibleBarrier-PT-06a-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t18) AND FIREABLE(t90) AND (FIREABLE(t112) OR FIREABLE(t77)))))
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(t18) AND FIREABLE(t90) AND (FIREABLE(t112) OR FIREABLE(t77)))))
lola: processed formula length: 80
lola: 42 rewrites
lola: closed formula file FlexibleBarrier-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:625
lola: formula 0: (FIREABLE(t18) AND FIREABLE(t90) AND (FIREABLE(t112) OR FIREABLE(t77)))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 72 markings, 87 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t14)))))
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(t14)
lola: processed formula length: 13
lola: 43 rewrites
lola: closed formula file FlexibleBarrier-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: 1486141 markings, 3180327 edges, 297228 markings/sec, 0 secs
lola: 2739525 markings, 6656191 edges, 250677 markings/sec, 5 secs
lola: 2976555 markings, 12410273 edges, 47406 markings/sec, 10 secs
lola: 2985916 markings, 18404002 edges, 1872 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 2985985 markings, 21150721 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t94)))))
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:694
lola: processed formula: FIREABLE(t94)
lola: processed formula length: 13
lola: 43 rewrites
lola: closed formula file FlexibleBarrier-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: 1092245 markings, 3568721 edges, 218449 markings/sec, 0 secs
lola: 1794002 markings, 8195260 edges, 140351 markings/sec, 5 secs
lola: 2403461 markings, 12701596 edges, 121892 markings/sec, 10 secs
lola: 2980783 markings, 16947208 edges, 115464 markings/sec, 15 secs
lola: 2985923 markings, 22278900 edges, 1028 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 2985985 markings, 25034625 edges
lola: ========================================

FORMULA FlexibleBarrier-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 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((NOT FIREABLE(t10) OR NOT FIREABLE(t100))))))
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(t10) AND FIREABLE(t100))
lola: processed formula length: 34
lola: 43 rewrites
lola: closed formula file FlexibleBarrier-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: 1298162 markings, 2944461 edges, 259632 markings/sec, 0 secs
lola: 2223779 markings, 6950973 edges, 185123 markings/sec, 5 secs
lola: 2959231 markings, 11129229 edges, 147090 markings/sec, 10 secs
lola: 2983481 markings, 16616930 edges, 4850 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 2984714 markings, 21839624 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t55) U ((NOT FIREABLE(t117) AND (FIREABLE(t136) OR FIREABLE(t131))) AND E (F (FIREABLE(t118))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(NOT FIREABLE(t55) U ((NOT FIREABLE(t117) AND (FIREABLE(t136) OR FIREABLE(t131))) AND E(TRUE U FIREABLE(t118))))
lola: processed formula length: 114
lola: 43 rewrites
lola: closed formula file FlexibleBarrier-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 15 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t130) AND FIREABLE(t135)) R (NOT FIREABLE(t59) OR NOT FIREABLE(t126) OR NOT FIREABLE(t39) OR NOT FIREABLE(t68))))
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(t130) AND FIREABLE(t135)) R (NOT FIREABLE(t59) OR NOT FIREABLE(t126) OR NOT FIREABLE(t39) OR NOT FIREABLE(t68))))
lola: processed formula length: 134
lola: 47 rewrites
lola: closed formula file FlexibleBarrier-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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(t59) AND FIREABLE(t126) AND FIREABLE(t39) AND FIREABLE(t68))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06a-CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06a-CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: Predicate Phi releases Predicate Psi on all paths.
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t131) AND FIREABLE(t106)))) OR A (G ((FIREABLE(t34) AND (NOT FIREABLE(t127) OR NOT FIREABLE(t98))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t131) AND FIREABLE(t106))))
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(t131) AND FIREABLE(t106))))
lola: processed formula length: 43
lola: 42 rewrites
lola: closed formula file FlexibleBarrier-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:625
lola: formula 0: (FIREABLE(t131) AND FIREABLE(t106))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06a-CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06a-CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t34) AND (NOT FIREABLE(t127) OR NOT FIREABLE(t98)))))
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 ((FIREABLE(t34) AND (NOT FIREABLE(t127) OR NOT FIREABLE(t98)))))
lola: processed formula length: 70
lola: 43 rewrites
lola: closed formula file FlexibleBarrier-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: (NOT FIREABLE(t34) OR (FIREABLE(t127) AND FIREABLE(t98)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to FlexibleBarrier-PT-06a-CTLFireability-13-0.sara
lola: lola: ========================================
state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FlexibleBarrier-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 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(t92) OR NOT FIREABLE(t74)) OR E (G (FIREABLE(t119)))))) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t141) AND (FIREABLE(t97) OR FIREABLE(t7) OR FIREABLE(t3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file FlexibleBarrier-PT-06a-CTLFireability-13-0.sara.
lola: subprocess 13 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t48) AND NOT FIREABLE(t141) AND (FIREABLE(t97) OR FIREABLE(t7) OR FIREABLE(t3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t48) AND NOT FIREABLE(t141) AND (FIREABLE(t97) OR FIREABLE(t7) OR FIREABLE(t3)))
lola: processed formula length: 96
lola: 41 rewrites
lola: closed formula file FlexibleBarrier-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: subprocess 14 will run for 1682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t92) OR NOT FIREABLE(t74)) OR E (G (FIREABLE(t119))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U ((FIREABLE(t92) AND FIREABLE(t74)) AND A(TRUE U NOT FIREABLE(t119)))))
lola: processed formula length: 83
lola: 47 rewrites
lola: closed formula file FlexibleBarrier-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).
sara: place or transition ordering is non-deterministic

lola: 1427075 markings, 4298266 edges, 285415 markings/sec, 0 secs
lola: 2492883 markings, 8342884 edges, 213162 markings/sec, 5 secs
lola: 2944693 markings, 12295226 edges, 90362 markings/sec, 10 secs
lola: 2962870 markings, 16083946 edges, 3635 markings/sec, 15 secs
lola: 2976165 markings, 19835218 edges, 2659 markings/sec, 20 secs
lola: 2985359 markings, 23921593 edges, 1839 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2985985 markings, 24834817 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(t118) OR NOT FIREABLE(t56)) OR E (F (FIREABLE(t152)))))) OR (A (G (FIREABLE(t125))) OR FIREABLE(t90)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t118) OR NOT FIREABLE(t56)) OR E (F (FIREABLE(t152))))))
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U ((FIREABLE(t118) AND FIREABLE(t56)) AND NOT(E(TRUE U FIREABLE(t152))))))
lola: processed formula length: 85
lola: 45 rewrites
lola: closed formula file FlexibleBarrier-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: 1405539 markings, 4278662 edges, 281108 markings/sec, 0 secs
lola: 2467650 markings, 8305872 edges, 212422 markings/sec, 5 secs
lola: 2945141 markings, 12417223 edges, 95498 markings/sec, 10 secs
lola: 2963176 markings, 16200548 edges, 3607 markings/sec, 15 secs
lola: 2976440 markings, 19959396 edges, 2653 markings/sec, 20 secs
lola: 2985497 markings, 24075527 edges, 1811 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2985985 markings, 24895983 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FlexibleBarrier-PT-06a-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t59) AND FIREABLE(t36)))) OR ((E (F (NOT FIREABLE(t45))) OR (FIREABLE(t54) AND FIREABLE(t93))) AND (A (G (NOT FIREABLE(t152))) AND (NOT FIREABLE(t57) OR NOT FIREABLE(t148) OR FIREABLE(t0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes yes yes no no yes yes no no no no unknown yes no no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14552 KB
lola: time consumption: 3570 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes yes yes no no yes yes no no no no unknown yes no no yes
lola:
preliminary result: yes yes yes no no yes yes no no no no unknown yes no no yes
lola: memory consumption: 14552 KB
lola: time consumption: 3571 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-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/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-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 FlexibleBarrier-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 r088-blw7-152649998100116"
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 ;