About the Execution of LoLA for NQueens-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 869.220 | 321839.00 | 338274.00 | 79.50 | FFFFFTFTFFFFFTFF | 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 260K
-rw-r--r-- 1 mcc users 4.3K May 30 21:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 30 21:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 28 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 90K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NQueens-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800328
=====================================================================
--------------------
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 NQueens-PT-10-CTLFireability-00
FORMULA_NAME NQueens-PT-10-CTLFireability-01
FORMULA_NAME NQueens-PT-10-CTLFireability-02
FORMULA_NAME NQueens-PT-10-CTLFireability-03
FORMULA_NAME NQueens-PT-10-CTLFireability-04
FORMULA_NAME NQueens-PT-10-CTLFireability-05
FORMULA_NAME NQueens-PT-10-CTLFireability-06
FORMULA_NAME NQueens-PT-10-CTLFireability-07
FORMULA_NAME NQueens-PT-10-CTLFireability-08
FORMULA_NAME NQueens-PT-10-CTLFireability-09
FORMULA_NAME NQueens-PT-10-CTLFireability-10
FORMULA_NAME NQueens-PT-10-CTLFireability-11
FORMULA_NAME NQueens-PT-10-CTLFireability-12
FORMULA_NAME NQueens-PT-10-CTLFireability-13
FORMULA_NAME NQueens-PT-10-CTLFireability-14
FORMULA_NAME NQueens-PT-10-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527790098501
info: Time: 3600 - MCC
===========================================================================================
prep: translating NQueens-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NQueens-PT-10 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ NQueens-PT-10 @ 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: 260/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5120
lola: finding significant places
lola: 160 places, 100 transitions, 100 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 101 transition conflict sets
lola: TASK
lola: reading formula from NQueens-PT-10-CTLFireability.task
lola: E (G (FIREABLE(T_10_10_5_4))) : E (G (E (X (A (F (FIREABLE(T_10_18_9_8))))))) : ((E (X (E (X (FIREABLE(T_11_17_9_7))))) OR (E (G ((FIREABLE(T_9_11_5_5) AND FIREABLE(T_14_12_8_3)))) OR (NOT FIREABLE(T_15_9_7_1) AND NOT FIREABLE(T_7_13_5_7) AND FIREABLE(T_3_13_3_9)))) AND (E (((FIREABLE(T_10_4_2_1) OR FIREABLE(T_6_12_4_7)) U (FIREABLE(T_7_5_1_3) OR FIREABLE(T_6_12_4_7)))) AND A (F (A (G (FIREABLE(T_12_16_9_6))))))) : NOT(((A (F ((FIREABLE(T_7_17_7_9) OR FIREABLE(T_5_9_2_6)))) AND NOT(E (G (FIREABLE(T_7_9_3_5))))) AND FIREABLE(T_15_9_7_1))) : A (X (((E (F (FIREABLE(T_9_1_0_0))) OR E (F (FIREABLE(T_14_12_8_3)))) OR FIREABLE(T_3_9_1_7)))) : A (F ((A (X (NOT FIREABLE(T_4_6_0_5))) AND ((NOT FIREABLE(T_13_7_5_1) AND NOT FIREABLE(T_13_11_7_3)) OR (FIREABLE(T_5_7_1_5) AND FIREABLE(T_8_10_4_5) AND FIREABLE(T_15_13_9_3)))))) : ((E (F ((NOT FIREABLE(T_9_5_2_2) OR NOT FIREABLE(T_7_7_2_4)))) AND E (G (FIREABLE(T_7_17_7_9)))) AND (A ((FIREABLE(T_15_13_9_3) U (FIREABLE(T_8_12_5_6) AND FIREABLE(T_6_12_4_7)))) AND ((FIREABLE(T_14_12_8_3) AND FIREABLE(T_9_13_6_6)) OR (FIREABLE(T_16_12_9_2) AND FIREABLE(T_8_18_8_9))))) : NOT(A ((FIREABLE(T_7_7_2_4) U E (G (FIREABLE(T_17_9_8_0)))))) : (E (F ((NOT FIREABLE(T_4_8_1_6) OR (FIREABLE(T_10_2_1_0) AND FIREABLE(T_9_17_8_8)) OR (FIREABLE(T_13_11_7_3) AND FIREABLE(T_14_8_6_1) AND NOT FIREABLE(T_2_8_0_7))))) AND E (G ((E (F (FIREABLE(T_9_9_4_4))) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_1_9_0_8) OR (FIREABLE(T_8_6_2_3) AND FIREABLE(T_6_12_4_7))))))) : A (G (NOT(A (X (FIREABLE(T_14_12_8_3)))))) : A (F ((((FIREABLE(T_8_18_8_9) AND FIREABLE(T_15_11_8_2)) OR (FIREABLE(T_5_9_2_6) AND FIREABLE(T_3_7_0_6)) OR ((FIREABLE(T_8_10_4_5) OR FIREABLE(T_7_7_2_4)) AND NOT FIREABLE(T_13_5_4_0))) AND (NOT FIREABLE(T_10_18_9_8) OR (NOT FIREABLE(T_5_7_1_5) AND NOT FIREABLE(T_11_11_6_4)))))) : (E (G (E (X (FIREABLE(T_7_15_6_8))))) AND (NOT(NOT(E (X (FIREABLE(T_3_9_1_7))))) OR FIREABLE(T_5_9_2_6))) : E (G (A (G (E (F (FIREABLE(T_14_6_5_0))))))) : NOT((E (G (A (F (FIREABLE(T_9_7_3_3))))) AND ((E (G (FIREABLE(T_13_9_6_2))) OR (FIREABLE(T_15_7_6_0) AND (FIREABLE(T_2_8_0_7) OR FIREABLE(T_18_10_9_0)))) OR A (G ((FIREABLE(T_3_11_2_8) AND FIREABLE(T_7_17_7_9))))))) : (NOT(A (F (E (G (FIREABLE(T_15_7_6_0)))))) AND E (X (A (G (FIREABLE(T_5_5_0_4)))))) : (FIREABLE(T_10_12_6_5) AND E (G ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_13_13_8_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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:323
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:326
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:297
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (A (F (FIREABLE(T_10_18_9_8)))))))
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:724
lola: processed formula: NOT(A(TRUE U NOT(EX(A(TRUE U FIREABLE(T_10_18_9_8))))))
lola: processed formula length: 55
lola: 55 rewrites
lola: closed formula file NQueens-PT-10-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: 555821 markings, 2331841 edges, 111164 markings/sec, 0 secs
lola: 1105844 markings, 4699931 edges, 110005 markings/sec, 5 secs
lola: 1648786 markings, 7020016 edges, 108588 markings/sec, 10 secs
lola: 2154886 markings, 9308585 edges, 101220 markings/sec, 15 secs
lola: 2669592 markings, 11578007 edges, 102941 markings/sec, 20 secs
lola: 3158787 markings, 13674494 edges, 97839 markings/sec, 25 secs
lola: 3640355 markings, 15818820 edges, 96314 markings/sec, 30 secs
lola: 4081224 markings, 17790990 edges, 88174 markings/sec, 35 secs
lola: 4501355 markings, 19686373 edges, 84026 markings/sec, 40 secs
lola: 4929414 markings, 21603636 edges, 85612 markings/sec, 45 secs
lola: 5347534 markings, 23527751 edges, 83624 markings/sec, 50 secs
lola: 5736790 markings, 25399017 edges, 77851 markings/sec, 55 secs
lola: 6118184 markings, 27256998 edges, 76279 markings/sec, 60 secs
lola: 6489025 markings, 29066956 edges, 74168 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6652059 markings, 29959774 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (E (X (FIREABLE(T_11_17_9_7))))) OR (E (G ((FIREABLE(T_9_11_5_5) AND FIREABLE(T_14_12_8_3)))) OR (NOT FIREABLE(T_15_9_7_1) AND NOT FIREABLE(T_7_13_5_7) AND FIREABLE(T_3_13_3_9)))) AND (E (((FIREABLE(T_10_4_2_1) OR FIREABLE(T_6_12_4_7)) U (FIREABLE(T_7_5_1_3) OR FIREABLE(T_6_12_4_7)))) AND A (F (A (G (FIREABLE(T_12_16_9_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (FIREABLE(T_11_17_9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX(FIREABLE(T_11_17_9_7)))
lola: processed formula length: 29
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(T_10_4_2_1) OR FIREABLE(T_6_12_4_7)) U (FIREABLE(T_7_5_1_3) OR FIREABLE(T_6_12_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((FIREABLE(T_10_4_2_1) OR FIREABLE(T_6_12_4_7)) U (FIREABLE(T_7_5_1_3) OR FIREABLE(T_6_12_4_7))))
lola: processed formula length: 102
lola: 55 rewrites
lola: closed formula file NQueens-PT-10-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(T_7_5_1_3) OR FIREABLE(T_6_12_4_7))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-10-CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(T_12_16_9_6)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(T_12_16_9_6)
lola: processed formula length: 25
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-CTLFireability.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: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F (FIREABLE(T_9_1_0_0))) OR (E (F (FIREABLE(T_14_12_8_3))) OR FIREABLE(T_3_9_1_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((E(TRUE U FIREABLE(T_9_1_0_0)) OR (E(TRUE U FIREABLE(T_14_12_8_3)) OR FIREABLE(T_3_9_1_7))))
lola: processed formula length: 95
lola: 55 rewrites
lola: closed formula file NQueens-PT-10-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: 714462 markings, 3631016 edges, 142892 markings/sec, 0 secs
lola: 1301377 markings, 6941316 edges, 117383 markings/sec, 5 secs
lola: 1858402 markings, 9994362 edges, 111405 markings/sec, 10 secs
lola: 2414495 markings, 13103263 edges, 111219 markings/sec, 15 secs
lola: 2974625 markings, 16209509 edges, 112026 markings/sec, 20 secs
lola: 3474976 markings, 19066003 edges, 100070 markings/sec, 25 secs
lola: 3703341 markings, 21927459 edges, 45673 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3703341 markings, 22957698 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (NOT FIREABLE(T_4_6_0_5))) AND ((NOT FIREABLE(T_13_7_5_1) AND NOT FIREABLE(T_13_11_7_3)) OR (FIREABLE(T_5_7_1_5) AND FIREABLE(T_8_10_4_5) AND FIREABLE(T_15_13_9_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (AX(NOT FIREABLE(T_4_6_0_5)) AND ((NOT FIREABLE(T_13_7_5_1) AND NOT FIREABLE(T_13_11_7_3)) OR (FIREABLE(T_5_7_1_5) AND FIREABLE(T_8_10_4_5) AND FIREABLE(T_15_13_9_3)))))
lola: processed formula length: 179
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-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: 642596 markings, 1405872 edges, 128519 markings/sec, 0 secs
lola: 1223205 markings, 2622378 edges, 116122 markings/sec, 5 secs
lola: 1826223 markings, 3829104 edges, 120604 markings/sec, 10 secs
lola: 2421415 markings, 5115343 edges, 119038 markings/sec, 15 secs
lola: 3015836 markings, 6343639 edges, 118884 markings/sec, 20 secs
lola: 3575314 markings, 7617109 edges, 111896 markings/sec, 25 secs
lola: 4091426 markings, 8821655 edges, 103222 markings/sec, 30 secs
lola: 4627545 markings, 10165592 edges, 107224 markings/sec, 35 secs
lola: 5124272 markings, 11512462 edges, 99345 markings/sec, 40 secs
lola: 5558300 markings, 12840941 edges, 86806 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5622466 markings, 13111143 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(T_14_12_8_3)))))
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_14_12_8_3)))))
lola: processed formula length: 49
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-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: 9 markings, 8 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X (FIREABLE(T_7_15_6_8))))) AND (E (X (FIREABLE(T_3_9_1_7))) OR FIREABLE(T_5_9_2_6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (FIREABLE(T_7_15_6_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(FIREABLE(T_7_15_6_8)))))
lola: processed formula length: 44
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-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: 717857 markings, 1194029 edges, 143571 markings/sec, 0 secs
lola: 1362979 markings, 2283880 edges, 129024 markings/sec, 5 secs
lola: 1972748 markings, 3351609 edges, 121954 markings/sec, 10 secs
lola: 2536174 markings, 4356338 edges, 112685 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2819267 markings, 4904616 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F (NOT FIREABLE(T_15_7_6_0))))) AND E (X (A (G (FIREABLE(T_5_5_0_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(T_15_7_6_0)))))
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 NOT FIREABLE(T_15_7_6_0)))))
lola: processed formula length: 54
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-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: 1634204 markings, 2730806 edges, 326841 markings/sec, 0 secs
lola: 2976503 markings, 5116055 edges, 268460 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3170152 markings, 5501064 edges
lola: ========================================
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (FIREABLE(T_5_5_0_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U NOT FIREABLE(T_5_5_0_4))))
lola: processed formula length: 42
lola: 55 rewrites
lola: closed formula file NQueens-PT-10-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: 198 markings, 197 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(T_14_6_5_0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(T_14_6_5_0)
lola: processed formula length: 20
lola: 53 rewrites
lola: closed formula file NQueens-PT-10-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 4 markings, 3 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(T_10_10_5_4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(T_10_10_5_4)))
lola: processed formula length: 29
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: 324905 markings, 1665069 edges, 64981 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 337701 markings, 1779057 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(T_8_18_8_9) AND FIREABLE(T_15_11_8_2)) OR (FIREABLE(T_5_9_2_6) AND FIREABLE(T_3_7_0_6)) OR ((FIREABLE(T_8_10_4_5) OR FIREABLE(T_7_7_2_4)) AND NOT FIREABLE(T_13_5_4_0))) AND (NOT FIREABLE(T_10_18_9_8) OR (NOT FIREABLE(T_5_7_1_5) AND NOT FIREABLE(T_11_11_6_4))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (((NOT FIREABLE(T_8_18_8_9) OR NOT FIREABLE(T_15_11_8_2)) AND (NOT FIREABLE(T_5_9_2_6) OR NOT FIREABLE(T_3_7_0_6)) AND ((NOT FIREABLE(T_8_10_4_5) AND NOT FIREABLE(T_7_7_2_4)) OR FIREABLE(T_13_5_4_0))) OR (FIREABLE(T_10_18_9_8) AND (FIREABLE(T_5_7_1_5) OR FIREABLE(T_11_11_6_4))))
lola: processed formula length: 284
lola: 54 rewrites
lola: closed formula file NQueens-PT-10-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: 9 markings, 8 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(T_7_7_2_4) R A (F (NOT FIREABLE(T_17_9_8_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:729
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(A(FIREABLE(T_7_7_2_4) U NOT(A(TRUE U NOT FIREABLE(T_17_9_8_0)))))
lola: processed formula length: 69
lola: 55 rewrites
lola: closed formula file NQueens-PT-10-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: 1568421 markings, 2534779 edges, 313684 markings/sec, 0 secs
lola: 3003931 markings, 5024459 edges, 287102 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3034516 markings, 5088954 edges
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-7 TRUE 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: (FIREABLE(T_10_12_6_5) AND E (G ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_13_13_8_4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T_10_12_6_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_10_12_6_5)
lola: processed formula length: 21
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: subprocess 12 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_13_13_8_4))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_13_13_8_4))))
lola: processed formula length: 57
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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 is not possibly preserved.
lola: 49123 markings, 229994 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((NOT FIREABLE(T_7_17_7_9) AND NOT FIREABLE(T_5_9_2_6)))) OR (E (G (FIREABLE(T_7_9_3_5))) OR NOT FIREABLE(T_15_9_7_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(T_15_9_7_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(T_15_9_7_1)
lola: processed formula length: 24
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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 1119 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(T_7_9_3_5)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(T_7_9_3_5)))
lola: processed formula length: 27
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: 354659 markings, 1791116 edges, 70932 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 384813 markings, 2030450 edges
lola: ========================================
lola: subprocess 14 will run for 1676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(T_7_17_7_9) AND NOT FIREABLE(T_5_9_2_6))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(T_7_17_7_9) AND NOT FIREABLE(T_5_9_2_6))))
lola: processed formula length: 62
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(T_9_5_2_2) OR NOT FIREABLE(T_7_7_2_4)))) AND (E (G (FIREABLE(T_7_17_7_9))) AND (A ((FIREABLE(T_15_13_9_3) U (FIREABLE(T_8_12_5_6) AND FIREABLE(T_6_12_4_7)))) AND ((FIREABLE(T_14_12_8_3) AND FIREABLE(T_9_13_6_6)) OR (FIREABLE(T_16_12_9_2) AND FIREABLE(T_8_18_8_9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(T_14_12_8_3) AND FIREABLE(T_9_13_6_6)) OR (FIREABLE(T_16_12_9_2) AND FIREABLE(T_8_18_8_9)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(T_14_12_8_3) AND FIREABLE(T_9_13_6_6)) OR (FIREABLE(T_16_12_9_2) AND FIREABLE(T_8_18_8_9)))
lola: processed formula length: 103
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: subprocess 14 will run for 1676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(T_7_17_7_9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(T_7_17_7_9)))
lola: processed formula length: 28
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: 370366 markings, 1790602 edges, 74073 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 517539 markings, 2740763 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(T_4_8_1_6) OR (FIREABLE(T_10_2_1_0) AND FIREABLE(T_9_17_8_8)) OR (FIREABLE(T_13_11_7_3) AND FIREABLE(T_14_8_6_1) AND NOT FIREABLE(T_2_8_0_7))))) AND E (G ((E (F (FIREABLE(T_9_9_4_4))) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_1_9_0_8) OR (FIREABLE(T_8_6_2_3) AND FIREABLE(T_6_12_4_7)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_4_8_1_6) OR (FIREABLE(T_10_2_1_0) AND FIREABLE(T_9_17_8_8)) OR (FIREABLE(T_13_11_7_3) AND FIREABLE(T_14_8_6_1) AND NOT FIREABLE(T_2_8_0_7)))))
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_4_8_1_6) OR (FIREABLE(T_10_2_1_0) AND FIREABLE(T_9_17_8_8)) OR (FIREABLE(T_13_11_7_3) AND FIREABLE(T_14_8_6_1) AND NOT FIREABLE(T_2_8_0_7)))))
lola: processed formula length: 166
lola: 53 rewrites
lola: closed formula file NQueens-PT-10-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (FIREABLE(T_9_9_4_4))) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_1_9_0_8) OR (FIREABLE(T_8_6_2_3) AND FIREABLE(T_6_12_4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U FIREABLE(T_9_9_4_4))) OR (NOT FIREABLE(T_8_6_2_3) AND NOT FIREABLE(T_1_9_0_8) AND (NOT FIREABLE(T_8_6_2_3) OR NOT FIREABLE(T_6_12_4_7))))))
lola: processed formula length: 167
lola: 56 rewrites
lola: closed formula file NQueens-PT-10-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: 641114 markings, 3204466 edges, 128223 markings/sec, 0 secs
lola: 1225840 markings, 6317912 edges, 116945 markings/sec, 5 secs
lola: 1843072 markings, 9482165 edges, 123446 markings/sec, 10 secs
lola: 2366420 markings, 12405779 edges, 104670 markings/sec, 15 secs
lola: 2930914 markings, 15599315 edges, 112899 markings/sec, 20 secs
lola: 3455819 markings, 18558723 edges, 104981 markings/sec, 25 secs
lola: 4002750 markings, 21607916 edges, 109386 markings/sec, 30 secs
lola: 4533050 markings, 24672555 edges, 106060 markings/sec, 35 secs
lola: 5000690 markings, 27519975 edges, 93528 markings/sec, 40 secs
lola: 5474307 markings, 30407980 edges, 94723 markings/sec, 45 secs
lola: 5931427 markings, 33345246 edges, 91424 markings/sec, 50 secs
lola: 6362459 markings, 36124452 edges, 86206 markings/sec, 55 secs
lola: 6757982 markings, 38779598 edges, 79105 markings/sec, 60 secs
lola: 7136300 markings, 41599177 edges, 75664 markings/sec, 65 secs
lola: 7441891 markings, 44286294 edges, 61118 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7451807 markings, 44432589 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
FORMULA NQueens-PT-10-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
lola: ========================================
subprocess 15 will run for 3270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (NOT FIREABLE(T_9_7_3_3))))) OR (A (F (NOT FIREABLE(T_13_9_6_2))) AND ((NOT FIREABLE(T_15_7_6_0) OR (NOT FIREABLE(T_2_8_0_7) AND NOT FIREABLE(T_18_10_9_0))) AND E (F ((NOT FIREABLE(T_3_11_2_8) OR NOT FIREABLE(T_7_17_7_9)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(T_15_7_6_0) OR (NOT FIREABLE(T_2_8_0_7) AND NOT FIREABLE(T_18_10_9_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(T_15_7_6_0) OR (NOT FIREABLE(T_2_8_0_7) AND NOT FIREABLE(T_18_10_9_0)))
lola: processed formula length: 86
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (NOT FIREABLE(T_9_7_3_3))))) OR (A (F (NOT FIREABLE(T_13_9_6_2))) AND ((NOT FIREABLE(T_15_7_6_0) OR (NOT FIREABLE(T_2_8_0_7) AND NOT FIREABLE(T_18_10_9_0))) AND E (F ((NOT FIREABLE(T_3_11_2_8) OR NOT FIREABLE(T_7_17_7_9)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(T_15_7_6_0) OR (NOT FIREABLE(T_2_8_0_7) AND NOT FIREABLE(T_18_10_9_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(T_15_7_6_0) OR (NOT FIREABLE(T_2_8_0_7) AND NOT FIREABLE(T_18_10_9_0)))
lola: processed formula length: 86
lola: 52 rewrites
lola: closed formula file NQueens-PT-10-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: ========================================
lola: ...considering subproblem: A (F (E (G (NOT FIREABLE(T_9_7_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(TRUE U NOT(A(TRUE U FIREABLE(T_9_7_3_3))))
lola: processed formula length: 44
lola: 55 rewrites
lola: closed formula file NQueens-PT-10-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: 898187 markings, 2323439 edges, 179637 markings/sec, 0 secs
lola: 1714196 markings, 4543348 edges, 163202 markings/sec, 5 secs
lola: 2515672 markings, 6673899 edges, 160295 markings/sec, 10 secs
lola: 3275875 markings, 8762633 edges, 152041 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3519296 markings, 9438431 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA NQueens-PT-10-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes no no no no no yes no no
lola:
preliminary result: no no no no no yes no yes no no no no no yes no no
lola: ========================================
lola: memory consumption: 15000 KB
lola: time consumption: 322 seconds
BK_STOP 1527790420340
--------------------
content from stderr:
grep: GenericPropertiesVerdict.xml: No such file or directory
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="NQueens-PT-10"
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/NQueens-PT-10.tgz
mv NQueens-PT-10 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 NQueens-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-csrt-152749169800328"
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 '
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 ;