fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r078-ebro-149441008300156
Last Updated
June 27, 2017

About the Execution of LoLA for SquareGrid-PT-130613

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15953.040 868439.00 872487.00 1370.10 FFTFFT??F????F?F 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)
.........................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is SquareGrid-PT-130613, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008300156
=====================================================================


--------------------
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 SquareGrid-PT-130613-CTLCardinality-0
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-1
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-10
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-11
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-12
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-13
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-14
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-15
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-2
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-3
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-4
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-5
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-6
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-7
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-8
FORMULA_NAME SquareGrid-PT-130613-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494934849924


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SquareGrid-PT-130613 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5057/65536 symbol table entries, 490 collisions
lola: preprocessing...
lola: finding significant places
lola: 2301 places, 2756 transitions, 1403 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3653 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-130613-CTLCardinality.task
lola: A ((((3 <= pbl_9_12) OR (pbl_7_6 <= pbl_13_13) OR (3 <= p1il_9_2) OR (2 <= p4ol_4_6)) U A (F ((3 <= p1o_2_10))))) : A (G (((p4ol_9_4 <= 2) AND A (G ((3 <= pb2_3_2)))))) : (A (((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14)))) OR A (G (E (X ((1 <= pb1_1_2)))))) : A (F ((A (G ((p4o_9_3 <= pb2_1_7))) OR ((1 <= p1i_9_7) AND (p4il_12_12 <= p1o_3_13) AND (p1o_2_1 <= pb4_10_8) AND (p1ol_12_9 <= pb1_7_8))))) : E ((((2 <= p1i_14_4) OR (p4o_5_10 <= p4o_13_14) OR (pb1_9_10 + 1 <= pb3_12_12)) U (((p4i_6_7 <= p4ol_12_11) OR (pb3_2_5 <= p4i_8_2)) AND (pbl_2_10 <= p1ol_6_12)))) : A (G ((((pb3_10_7 + 1 <= pb4_5_10) AND ((3 <= pbl_4_13) OR (2 <= p1il_13_9))) OR E (F ((3 <= p4o_11_4)))))) : NOT(E ((((p4ol_13_3 <= p4il_13_9) AND (3 <= pbl_8_5)) U ((1 <= p1il_6_6) AND (2 <= p1o_3_5))))) : (E ((((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10))) AND ((pb1_12_11 <= p4o_9_13) OR A (F ((pb4_3_13 <= 2))))) : A (G (NOT(A (G ((1 <= p4i_12_5)))))) : (NOT(E (G (((2 <= p4ol_12_3) OR (pb1_3_7 <= pb4_5_11))))) OR (1 <= p4o_13_10)) : E (G (A (((1 <= p1il_1_8) U (1 <= p4il_1_4))))) : A (F ((pbl_2_8 + 1 <= p4ol_13_8))) : E (F ((3 <= p1ol_4_12))) : A (X (E (X (((1 <= pb4_13_2) AND (p1o_11_12 <= pb1_3_9)))))) : E (F (A (F ((pb4_2_12 <= 0))))) : ((A (F ((2 <= p4o_6_11))) AND E (X ((p1il_13_9 <= 0)))) OR A ((((p1ol_10_3 <= pb4_11_5) OR (1 <= p4o_13_11)) U (p4il_7_11 + 1 <= p4il_10_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= pbl_9_12) OR (pbl_7_6 <= pbl_13_13) OR (3 <= p1il_9_2) OR (2 <= p4ol_4_6)) U A (F ((3 <= p1o_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= pbl_9_12) OR (pbl_7_6 <= pbl_13_13) OR (3 <= p1il_9_2) OR (2 <= p4ol_4_6)) U A(TRUE U (3 <= p1o_2_10)))
lola: processed formula length: 115
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4ol_9_4 <= 2) AND A (G ((3 <= pb2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p4ol_9_4 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-130613-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-130613-CTLCardinality.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: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= pb2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to SquareGrid-PT-130613-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14)))) OR A (G (E (X ((1 <= pb1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14)))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((1 <= pb1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((1 <= pb1_1_2)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p4o_9_3 <= pb2_1_7))) OR ((1 <= p1i_9_7) AND (p4il_12_12 <= p1o_3_13) AND (p1o_2_1 <= pb4_10_8) AND (p1ol_12_9 <= pb1_7_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (pb2_1_7 + 1 <= p4o_9_3))) OR ((1 <= p1i_9_7) AND (p4il_12_12 <= p1o_3_13) AND (p1o_2_1 <= pb4_10_8) AND (p1ol_12_9 <= pb1_7_8))))
lola: processed formula length: 153
lola: 3 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: 319939 markings, 499090 edges, 2934408243167887360 markings/sec, 0 secs
lola: 635712 markings, 1021791 edges, 63155 markings/sec, 5 secs
lola: 960484 markings, 1542768 edges, 64954 markings/sec, 10 secs
lola: 1289934 markings, 2064069 edges, 65890 markings/sec, 15 secs
lola: 1614218 markings, 2587497 edges, 64857 markings/sec, 20 secs
lola: 1939140 markings, 3107813 edges, 64984 markings/sec, 25 secs
lola: 2252963 markings, 3633849 edges, 62765 markings/sec, 30 secs
lola: 2543313 markings, 4086935 edges, 58070 markings/sec, 35 secs
lola: 2808369 markings, 4511022 edges, 53011 markings/sec, 40 secs
lola: 3076381 markings, 4944114 edges, 53602 markings/sec, 45 secs
lola: 3351854 markings, 5386692 edges, 55095 markings/sec, 50 secs
lola: 3618739 markings, 5830407 edges, 53377 markings/sec, 55 secs
lola: 3888516 markings, 6279366 edges, 53955 markings/sec, 60 secs
lola: 4192548 markings, 6758636 edges, 60806 markings/sec, 65 secs
lola: 4507791 markings, 7261786 edges, 63049 markings/sec, 70 secs
lola: 4815440 markings, 7768117 edges, 61530 markings/sec, 75 secs
lola: 5084204 markings, 8193184 edges, 53753 markings/sec, 80 secs
lola: 5390275 markings, 8670466 edges, 61214 markings/sec, 85 secs
lola: 5679807 markings, 9129781 edges, 57906 markings/sec, 90 secs
lola: 5954940 markings, 9563377 edges, 55027 markings/sec, 95 secs
lola: 6229089 markings, 10002458 edges, 54830 markings/sec, 100 secs
lola: 6464131 markings, 10389532 edges, 47008 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p1i_14_4) OR (p4o_5_10 <= p4o_13_14) OR (pb1_9_10 + 1 <= pb3_12_12)) U (((p4i_6_7 <= p4ol_12_11) OR (pb3_2_5 <= p4i_8_2)) AND (pbl_2_10 <= p1ol_6_12))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= p1i_14_4) OR (p4o_5_10 <= p4o_13_14) OR (pb1_9_10 + 1 <= pb3_12_12)) U (((p4i_6_7 <= p4ol_12_11) OR (pb3_2_5 <= p4i_8_2)) AND (pbl_2_10 <= p1ol_6_12)))
lola: processed formula length: 163
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: 327047 markings, 511006 edges, 65409 markings/sec, 0 secs
lola: 641091 markings, 1030173 edges, 62809 markings/sec, 5 secs
lola: 961319 markings, 1543941 edges, 64046 markings/sec, 10 secs
lola: 1283844 markings, 2054190 edges, 64505 markings/sec, 15 secs
lola: 1605210 markings, 2572069 edges, 64273 markings/sec, 20 secs
lola: 1925228 markings, 3085239 edges, 64004 markings/sec, 25 secs
lola: 2240429 markings, 3612892 edges, 63040 markings/sec, 30 secs
lola: 2530881 markings, 4067537 edges, 58090 markings/sec, 35 secs
lola: 2796051 markings, 4492045 edges, 53034 markings/sec, 40 secs
lola: 3051706 markings, 4904546 edges, 51131 markings/sec, 45 secs
lola: 3325080 markings, 5343516 edges, 54675 markings/sec, 50 secs
lola: 3582734 markings, 5771713 edges, 51531 markings/sec, 55 secs
lola: 3845668 markings, 6211022 edges, 52587 markings/sec, 60 secs
lola: 4141965 markings, 6678962 edges, 59259 markings/sec, 65 secs
lola: 4448251 markings, 7163281 edges, 61257 markings/sec, 70 secs
lola: 4744235 markings, 7657540 edges, 59197 markings/sec, 75 secs
lola: 5021000 markings, 8090766 edges, 55353 markings/sec, 80 secs
lola: 5310138 markings, 8544693 edges, 57828 markings/sec, 85 secs
lola: 5594239 markings, 8998731 edges, 56820 markings/sec, 90 secs
lola: 5869177 markings, 9427904 edges, 54988 markings/sec, 95 secs
lola: 6145696 markings, 9870569 edges, 55304 markings/sec, 100 secs
lola: 6411605 markings, 10302928 edges, 53182 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pb3_10_7 + 1 <= pb4_5_10) AND ((3 <= pbl_4_13) OR (2 <= p1il_13_9))) OR E (F ((3 <= p4o_11_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((pb4_5_10 <= pb3_10_7) OR ((pbl_4_13 <= 2) AND (p1il_13_9 <= 1))) AND NOT(E(TRUE U (3 <= p4o_11_4))))))
lola: processed formula length: 119
lola: 4 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: 336492 markings, 526844 edges, 2072998194848989184 markings/sec, 0 secs
lola: 609481 markings, 976878 edges, 54598 markings/sec, 5 secs
lola: 906567 markings, 1452611 edges, 59417 markings/sec, 10 secs
lola: 1223444 markings, 1958509 edges, 63375 markings/sec, 15 secs
lola: 1526018 markings, 2438180 edges, 60515 markings/sec, 20 secs
lola: 1821281 markings, 2920232 edges, 59053 markings/sec, 25 secs
lola: 2129414 markings, 3428611 edges, 61627 markings/sec, 30 secs
lola: 2444369 markings, 3931920 edges, 62991 markings/sec, 35 secs
lola: 2747812 markings, 4415001 edges, 60689 markings/sec, 40 secs
lola: 3051911 markings, 4904857 edges, 60820 markings/sec, 45 secs
lola: 3358047 markings, 5396888 edges, 61227 markings/sec, 50 secs
lola: 3655578 markings, 5892249 edges, 59506 markings/sec, 55 secs
lola: 3956655 markings, 6389159 edges, 60215 markings/sec, 60 secs
lola: 4256939 markings, 6858350 edges, 60057 markings/sec, 65 secs
lola: 4550990 markings, 7330094 edges, 58810 markings/sec, 70 secs
lola: 4841829 markings, 7807965 edges, 58168 markings/sec, 75 secs
lola: 5142115 markings, 8285357 edges, 60057 markings/sec, 80 secs
lola: 5440075 markings, 8748129 edges, 59592 markings/sec, 85 secs
lola: 5721106 markings, 9193126 edges, 56206 markings/sec, 90 secs
lola: 6005213 markings, 9641946 edges, 56821 markings/sec, 95 secs
lola: 6285854 markings, 10099405 edges, 56128 markings/sec, 100 secs
lola: 6570941 markings, 10561899 edges, 57017 markings/sec, 105 secs
lola: 6856046 markings, 11030154 edges, 57021 markings/sec, 110 secs
lola: 7145242 markings, 11507947 edges, 57839 markings/sec, 115 secs
lola: 7442713 markings, 11988363 edges, 59494 markings/sec, 120 secs
lola: 7738255 markings, 12473806 edges, 59108 markings/sec, 125 secs
lola: 8021313 markings, 12923966 edges, 56612 markings/sec, 130 secs
lola: 8301550 markings, 13367368 edges, 56047 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((p4ol_13_3 <= p4il_13_9) AND (3 <= pbl_8_5)) U ((1 <= p1il_6_6) AND (2 <= p1o_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((p4ol_13_3 <= p4il_13_9) AND (3 <= pbl_8_5)) U ((1 <= p1il_6_6) AND (2 <= p1o_3_5))))
lola: processed formula length: 92
lola: 7 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: 337929 markings, 512232 edges, 2317474467846029312 markings/sec, 0 secs
lola: 663731 markings, 1036793 edges, 65160 markings/sec, 5 secs
lola: 994446 markings, 1554226 edges, 66143 markings/sec, 10 secs
lola: 1326585 markings, 2069509 edges, 66428 markings/sec, 15 secs
lola: 1654643 markings, 2580020 edges, 65612 markings/sec, 20 secs
lola: 1973728 markings, 3084841 edges, 63817 markings/sec, 25 secs
lola: 2288603 markings, 3594425 edges, 62975 markings/sec, 30 secs
lola: 2602608 markings, 4082616 edges, 62801 markings/sec, 35 secs
lola: 2878300 markings, 4506505 edges, 55138 markings/sec, 40 secs
lola: 3146528 markings, 4925138 edges, 53646 markings/sec, 45 secs
lola: 3427326 markings, 5368827 edges, 56160 markings/sec, 50 secs
lola: 3697111 markings, 5803221 edges, 53957 markings/sec, 55 secs
lola: 3969842 markings, 6239131 edges, 54546 markings/sec, 60 secs
lola: 4251163 markings, 6690390 edges, 56264 markings/sec, 65 secs
lola: 4583641 markings, 7197922 edges, 66496 markings/sec, 70 secs
lola: 4905132 markings, 7702451 edges, 64298 markings/sec, 75 secs
lola: 5206188 markings, 8182444 edges, 60211 markings/sec, 80 secs
lola: 5484551 markings, 8614736 edges, 55673 markings/sec, 85 secs
lola: 5801848 markings, 9094422 edges, 63459 markings/sec, 90 secs
lola: 6098818 markings, 9553801 edges, 59394 markings/sec, 95 secs
lola: 6383580 markings, 9991316 edges, 56952 markings/sec, 100 secs
lola: 6564604 markings, 10275351 edges, 36205 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10))) AND ((pb1_12_11 <= p4o_9_13) OR A (F ((pb4_3_13 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pb1_12_11 <= p4o_9_13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb1_12_11 <= p4o_9_13)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb4_3_13 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb4_3_13 <= 2))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((1 <= p4i_12_5))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p4i_12_5 <= 0)))))
lola: processed formula length: 45
lola: 5 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: 265177 markings, 676966 edges, 3689348869717491712 markings/sec, 0 secs
lola: 517521 markings, 1344477 edges, 50469 markings/sec, 5 secs
lola: 777079 markings, 2020910 edges, 51912 markings/sec, 10 secs
lola: 1029144 markings, 2684762 edges, 50413 markings/sec, 15 secs
lola: 1290739 markings, 3355887 edges, 52319 markings/sec, 20 secs
lola: 1552128 markings, 4035196 edges, 52278 markings/sec, 25 secs
lola: 1804125 markings, 4697375 edges, 50399 markings/sec, 30 secs
lola: 2052724 markings, 5348100 edges, 49720 markings/sec, 35 secs
lola: 2297222 markings, 6001173 edges, 48900 markings/sec, 40 secs
lola: 2511165 markings, 6547559 edges, 42789 markings/sec, 45 secs
lola: 2711750 markings, 7066111 edges, 40117 markings/sec, 50 secs
lola: 2911295 markings, 7585607 edges, 39909 markings/sec, 55 secs
lola: 3107729 markings, 8100326 edges, 39287 markings/sec, 60 secs
lola: 3308915 markings, 8626109 edges, 40237 markings/sec, 65 secs
lola: 3504428 markings, 9146170 edges, 39103 markings/sec, 70 secs
lola: 3708185 markings, 9686365 edges, 40751 markings/sec, 75 secs
lola: 3911442 markings, 10228855 edges, 40651 markings/sec, 80 secs
lola: 4154100 markings, 10851431 edges, 48532 markings/sec, 85 secs
lola: 4409500 markings, 11511988 edges, 51080 markings/sec, 90 secs
lola: 4659967 markings, 12171500 edges, 50093 markings/sec, 95 secs
lola: 4885799 markings, 12761874 edges, 45166 markings/sec, 100 secs
lola: 5090219 markings, 13292882 edges, 40884 markings/sec, 105 secs
lola: 5335086 markings, 13918862 edges, 48973 markings/sec, 110 secs
lola: 5567649 markings, 14524459 edges, 46513 markings/sec, 115 secs
lola: 5776591 markings, 15055832 edges, 41788 markings/sec, 120 secs
lola: 5981736 markings, 15585770 edges, 41029 markings/sec, 125 secs
lola: 6176037 markings, 16094665 edges, 38860 markings/sec, 130 secs
lola: 6373047 markings, 16613518 edges, 39402 markings/sec, 135 secs
lola: 6515892 markings, 16989538 edges, 28569 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((2 <= p4ol_12_3) OR (pb1_3_7 <= pb4_5_11))))) OR (1 <= p4o_13_10))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p4ol_12_3 <= 1) AND (pb4_5_11 + 1 <= pb1_3_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p4ol_12_3 <= 1) AND (pb4_5_11 + 1 <= pb1_3_7)))
lola: processed formula length: 58
lola: 4 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: subprocess 10 will run for 482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p4o_13_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4o_13_10)
lola: processed formula length: 16
lola: 3 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: lola: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((1 <= p1il_1_8) U (1 <= p4il_1_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((1 <= p1il_1_8) U (1 <= p4il_1_4)))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pbl_2_8 + 1 <= p4ol_13_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pbl_2_8 + 1 <= p4ol_13_8))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 12 will run for 724 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1ol_4_12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-130613-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-130613-CTLCardinality-12.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 964 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (((1 <= pb4_13_2) AND (p1o_11_12 <= pb1_3_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX(((1 <= pb4_13_2) AND (p1o_11_12 <= pb1_3_9))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: ========================================
lola: subprocess 14 will run for 1447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((pb4_2_12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (pb4_2_12 <= 0)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: 168711 markings, 597536 edges, 2317305692811165696 markings/sec, 0 secs
lola: 337370 markings, 1202926 edges, 33732 markings/sec, 5 secs
lola: 502419 markings, 1803319 edges, 33010 markings/sec, 10 secs
lola: 667783 markings, 2406404 edges, 33073 markings/sec, 15 secs
lola: 837453 markings, 3015425 edges, 33934 markings/sec, 20 secs
lola: 1004678 markings, 3623427 edges, 33445 markings/sec, 25 secs
lola: 1177147 markings, 4239434 edges, 34494 markings/sec, 30 secs
lola: 1350166 markings, 4858282 edges, 34604 markings/sec, 35 secs
lola: 1518331 markings, 5462251 edges, 33633 markings/sec, 40 secs
lola: 1683044 markings, 6065537 edges, 32943 markings/sec, 45 secs
lola: 1853542 markings, 6676618 edges, 34100 markings/sec, 50 secs
lola: 2020796 markings, 7283948 edges, 33451 markings/sec, 55 secs
lola: 2183730 markings, 7886908 edges, 32587 markings/sec, 60 secs
lola: 2349573 markings, 8486665 edges, 33169 markings/sec, 65 secs
lola: 2485385 markings, 8965907 edges, 27162 markings/sec, 70 secs
lola: 2618433 markings, 9443232 edges, 26610 markings/sec, 75 secs
lola: 2750945 markings, 9922208 edges, 26502 markings/sec, 80 secs
lola: 2883638 markings, 10398918 edges, 26539 markings/sec, 85 secs
lola: 3013430 markings, 10868206 edges, 25958 markings/sec, 90 secs
lola: 3145891 markings, 11346756 edges, 26492 markings/sec, 95 secs
lola: 3280229 markings, 11831682 edges, 26868 markings/sec, 100 secs
lola: 3412624 markings, 12313567 edges, 26479 markings/sec, 105 secs
lola: 3544816 markings, 12798348 edges, 26438 markings/sec, 110 secs
lola: 3677970 markings, 13285040 edges, 26631 markings/sec, 115 secs
lola: 3811427 markings, 13775263 edges, 26691 markings/sec, 120 secs
lola: 3945903 markings, 14262434 edges, 26895 markings/sec, 125 secs
lola: 4099610 markings, 14812101 edges, 30741 markings/sec, 130 secs
lola: 4259708 markings, 15381998 edges, 32020 markings/sec, 135 secs
lola: 4413760 markings, 15936520 edges, 30810 markings/sec, 140 secs
lola: 4569519 markings, 16499923 edges, 31152 markings/sec, 145 secs
lola: 4720496 markings, 17058654 edges, 30195 markings/sec, 150 secs
lola: 4860117 markings, 17557180 edges, 27924 markings/sec, 155 secs
lola: 4993672 markings, 18031452 edges, 26711 markings/sec, 160 secs
lola: 5125453 markings, 18511344 edges, 26356 markings/sec, 165 secs
lola: 5290224 markings, 19094077 edges, 32954 markings/sec, 170 secs
lola: 5448861 markings, 19659850 edges, 31727 markings/sec, 175 secs
lola: 5597309 markings, 20198040 edges, 29690 markings/sec, 180 secs
lola: 5734890 markings, 20684383 edges, 27516 markings/sec, 185 secs
lola: 5870369 markings, 21170455 edges, 27096 markings/sec, 190 secs
lola: 6006743 markings, 21657733 edges, 27275 markings/sec, 195 secs
lola: 6141408 markings, 22146703 edges, 26933 markings/sec, 200 secs
lola: 6276184 markings, 22634875 edges, 26955 markings/sec, 205 secs
lola: 6411607 markings, 23126019 edges, 27085 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2671 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((2 <= p4o_6_11))) AND E (X ((p1il_13_9 <= 0)))) OR A ((((p1ol_10_3 <= pb4_11_5) OR (1 <= p4o_13_11)) U (p4il_7_11 + 1 <= p4il_10_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2671 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p4o_6_11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p4o_6_11))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 bytes per marking, with 0 unused bits
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: ========================================
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: RESULT
lola:
SUMMARY: no no no unknown unknown unknown unknown no unknown no yes no no yes unknown unknown
FORMULA SquareGrid-PT-130613-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494935718363

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="SquareGrid-PT-130613"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/SquareGrid-PT-130613.tgz
mv SquareGrid-PT-130613 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is SquareGrid-PT-130613, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-ebro-149441008300156"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.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 ;