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

About the Execution of LoLA for SquareGrid-PT-100510

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15953.030 778581.00 785976.00 315.00 TFTTFFFTFFTTTFFF 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-100510, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008300147
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494934494622


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SquareGrid-PT-100510 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3020/65536 symbol table entries, 416 collisions
lola: preprocessing...
lola: finding significant places
lola: 1380 places, 1640 transitions, 839 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2180 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-100510-CTLCardinality.task
lola: E (X (E (G ((p1ol_8_1 + 1 <= pb1_2_10))))) : A (F (((2 <= p4i_7_8) OR (p1il_11_7 <= 0) OR (2 <= p4ol_5_10)))) : (A (G ((p4i_7_4 <= pbl_9_7))) AND E (X (((3 <= pb3_2_3) AND (p4il_8_3 <= 0))))) : A (F (E (G (((pb3_5_5 <= p4o_8_3) AND (2 <= pb3_6_1)))))) : E (G ((A (F ((p1ol_5_5 <= pb4_3_9))) OR (3 <= p4i_9_10)))) : NOT(E (G (A (F ((pb4_3_7 <= p4il_1_11)))))) : NOT(E (F (((p4ol_1_2 <= pbl_10_4) AND (2 <= p4o_1_4) AND (p4i_4_4 <= p1i_9_4))))) : (A (G (((p1i_2_5 <= p1o_4_3) AND (p1il_11_2 <= pb3_5_10) AND ((3 <= p4il_4_9) OR (p1o_11_1 <= pb2_3_2))))) OR A (F ((2 <= p4ol_4_5)))) : NOT(NOT((E (F ((2 <= p1ol_5_7))) AND ((2 <= pb4_2_4) OR (p1ol_8_6 <= p1ol_7_1) OR (p4ol_10_11 <= p4il_4_7))))) : E (G (NOT(E (G ((2 <= pbl_1_8)))))) : E (G (((p4il_5_10 <= pbl_1_3) OR A (F ((1 <= p4ol_3_10)))))) : E (F (E (X ((pb3_3_8 <= 0))))) : (E (((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1))) AND A (F (((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10)))))) : ((p4il_4_5 <= pbl_9_10) AND E (X (A (F ((pb3_6_7 <= p4il_9_7)))))) : (NOT(E (G ((2 <= pb1_10_3)))) AND ((((p1ol_3_1 + 1 <= pb2_3_10) AND (3 <= p1i_3_4)) OR ((1 <= p4ol_2_4) AND (1 <= pbl_4_9) AND (p1il_4_8 <= p1il_6_7) AND (p4ol_1_9 <= pb4_10_3))) OR (((1 <= p1il_10_8) OR (pb4_6_10 <= 0)) OR A (X ((1 <= pb2_10_3)))))) : E ((((p4ol_6_11 <= 0) AND (pb1_2_7 + 1 <= p4il_7_7)) U E (G ((p1il_7_6 <= p1il_7_5)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p1ol_8_1 + 1 <= pb1_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (pb1_2_10 <= p1ol_8_1))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p4i_7_8) OR (p1il_11_7 <= 0) OR (2 <= p4ol_5_10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= p4i_7_8) OR (p1il_11_7 <= 0) OR (2 <= p4ol_5_10)))
lola: processed formula length: 68
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p4i_7_4 <= pbl_9_7))) AND E (X (((3 <= pb3_2_3) AND (p4il_8_3 <= 0)))))
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 (G ((p4i_7_4 <= pbl_9_7)))
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 3356 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-100510-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((pb3_5_5 <= p4o_8_3) AND (2 <= pb3_6_1))))))
lola: lola: ========================================
lola: SUBTASK
lola: ========================================lola:
state equation: calling and running sara
checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p4o_8_3 + 1 <= pb3_5_5) OR (pb3_6_1 <= 1)))))
lola: processed formula length: 70
lola: 3 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
sara: lola: try reading problem file SquareGrid-PT-100510-CTLCardinality-2.sara.
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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p1ol_5_5 <= pb4_3_9))) OR (3 <= p4i_9_10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (p1ol_5_5 <= pb4_3_9))) AND (p4i_9_10 <= 2))))
lola: processed formula length: 73
lola: 4 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((pb4_3_7 <= p4il_1_11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pb4_3_7 <= p4il_1_11))))
lola: processed formula length: 47
lola: 8 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((p4ol_1_2 <= pbl_10_4) AND (2 <= p4o_1_4) AND (p4i_4_4 <= p1i_9_4)))))
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 3356 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-100510-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-100510-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p1i_2_5 <= p1o_4_3) AND (p1il_11_2 <= pb3_5_10) AND ((3 <= p4il_4_9) OR (p1o_11_1 <= pb2_3_2))))) OR A (F ((2 <= p4ol_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1i_2_5 <= p1o_4_3) AND (p1il_11_2 <= pb3_5_10) AND ((3 <= p4il_4_9) OR (p1o_11_1 <= 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 3356 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 4 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to SquareGrid-PT-100510-CTLCardinality-7.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p4ol_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p4ol_4_5))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F ((2 <= p1ol_5_7))) AND ((2 <= pb4_2_4) OR (p1ol_8_6 <= p1ol_7_1) OR (p4ol_10_11 <= p4il_4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1ol_5_7)))
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 3356 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-100510-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-100510-CTLCardinality-8.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((2 <= pbl_1_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (pbl_1_8 <= 1)))))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p4il_5_10 <= pbl_1_3) OR A (F ((1 <= p4ol_3_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pbl_1_3 + 1 <= p4il_5_10) AND NOT(A(TRUE U (1 <= p4ol_3_10))))))
lola: processed formula length: 79
lola: 4 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((pb3_3_8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((pb3_3_8 <= 0)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1))) AND A (F (((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: 226505 markings, 528001 edges, 45301 markings/sec, 0 secs
lola: 413181 markings, 1013769 edges, 37335 markings/sec, 5 secs
lola: 582717 markings, 1487769 edges, 33907 markings/sec, 10 secs
lola: 721872 markings, 1923580 edges, 27831 markings/sec, 15 secs
lola: 853939 markings, 2332427 edges, 26413 markings/sec, 20 secs
lola: 1019245 markings, 2749878 edges, 33061 markings/sec, 25 secs
lola: 1178427 markings, 3171019 edges, 31836 markings/sec, 30 secs
lola: 1317695 markings, 3582950 edges, 27854 markings/sec, 35 secs
lola: 1476069 markings, 3984737 edges, 31675 markings/sec, 40 secs
lola: 1613319 markings, 4366282 edges, 27450 markings/sec, 45 secs
lola: 1751953 markings, 4751087 edges, 27727 markings/sec, 50 secs
lola: 1956428 markings, 5154738 edges, 40895 markings/sec, 55 secs
lola: 2161821 markings, 5543853 edges, 41079 markings/sec, 60 secs
lola: 2357276 markings, 5924028 edges, 39091 markings/sec, 65 secs
lola: 2544853 markings, 6295899 edges, 37515 markings/sec, 70 secs
lola: 2730327 markings, 6667839 edges, 37095 markings/sec, 75 secs
lola: 2911961 markings, 7036745 edges, 36327 markings/sec, 80 secs
lola: 3089245 markings, 7403510 edges, 35457 markings/sec, 85 secs
lola: 3263678 markings, 7767492 edges, 34887 markings/sec, 90 secs
lola: 3434149 markings, 8132067 edges, 34094 markings/sec, 95 secs
lola: 3598463 markings, 8517938 edges, 32863 markings/sec, 100 secs
lola: 3704373 markings, 8857941 edges, 21182 markings/sec, 105 secs
lola: 3764703 markings, 9150631 edges, 12066 markings/sec, 110 secs
lola: 3818609 markings, 9438730 edges, 10781 markings/sec, 115 secs
lola: 3870339 markings, 9724577 edges, 10346 markings/sec, 120 secs
lola: 3920895 markings, 10010103 edges, 10111 markings/sec, 125 secs
lola: 3970331 markings, 10297315 edges, 9887 markings/sec, 130 secs
lola: 4018452 markings, 10585222 edges, 9624 markings/sec, 135 secs
lola: 4066020 markings, 10874186 edges, 9514 markings/sec, 140 secs
lola: 4115188 markings, 11167069 edges, 9834 markings/sec, 145 secs
lola: 4162089 markings, 11464175 edges, 9380 markings/sec, 150 secs
lola: 4207478 markings, 11767445 edges, 9078 markings/sec, 155 secs
lola: 4327777 markings, 12156037 edges, 24060 markings/sec, 160 secs
lola: 4512567 markings, 12607539 edges, 36958 markings/sec, 165 secs
lola: 4688275 markings, 13079631 edges, 35142 markings/sec, 170 secs
lola: 4812897 markings, 13499250 edges, 24924 markings/sec, 175 secs
lola: 4946234 markings, 13893900 edges, 26667 markings/sec, 180 secs
lola: 5091841 markings, 14296280 edges, 29121 markings/sec, 185 secs
lola: 5255790 markings, 14692055 edges, 32790 markings/sec, 190 secs
lola: 5394194 markings, 15107926 edges, 27681 markings/sec, 195 secs
lola: 5537727 markings, 15487337 edges, 28707 markings/sec, 200 secs
lola: 5684573 markings, 15872825 edges, 29369 markings/sec, 205 secs
lola: 5809202 markings, 16236700 edges, 24926 markings/sec, 210 secs
lola: 5945152 markings, 16607392 edges, 27190 markings/sec, 215 secs
lola: 6154961 markings, 16993032 edges, 41962 markings/sec, 220 secs
lola: 6350171 markings, 17364796 edges, 39042 markings/sec, 225 secs
lola: 6537326 markings, 17729666 edges, 37431 markings/sec, 230 secs
lola: 6720569 markings, 18093057 edges, 36649 markings/sec, 235 secs
lola: 6900898 markings, 18454793 edges, 36066 markings/sec, 240 secs
lola: 7076648 markings, 18811808 edges, 35150 markings/sec, 245 secs
lola: 7247532 markings, 19165139 edges, 34177 markings/sec, 250 secs
lola: 7416320 markings, 19517158 edges, 33758 markings/sec, 255 secs
lola: 7581871 markings, 19870024 edges, 33110 markings/sec, 260 secs
lola: 7743889 markings, 20248379 edges, 32404 markings/sec, 265 secs
lola: 7861887 markings, 20597753 edges, 23600 markings/sec, 270 secs
lola: 7923935 markings, 20890959 edges, 12410 markings/sec, 275 secs
lola: 7977896 markings, 21177521 edges, 10792 markings/sec, 280 secs
lola: 8029472 markings, 21460462 edges, 10315 markings/sec, 285 secs
lola: 8079294 markings, 21743553 edges, 9964 markings/sec, 290 secs
lola: 8129073 markings, 22027127 edges, 9956 markings/sec, 295 secs
lola: 8176119 markings, 22309033 edges, 9409 markings/sec, 300 secs
lola: 8223272 markings, 22591926 edges, 9431 markings/sec, 305 secs
lola: 8270759 markings, 22876535 edges, 9497 markings/sec, 310 secs
lola: 8317085 markings, 23165665 edges, 9265 markings/sec, 315 secs
lola: 8362391 markings, 23459929 edges, 9061 markings/sec, 320 secs
lola: 8429138 markings, 23756555 edges, 13349 markings/sec, 325 secs
lola: 8572266 markings, 24109577 edges, 28626 markings/sec, 330 secs
lola: 8715701 markings, 24499291 edges, 28687 markings/sec, 335 secs
lola: 8855390 markings, 24890107 edges, 27938 markings/sec, 340 secs
lola: 8970833 markings, 25265034 edges, 23089 markings/sec, 345 secs
lola: 9077841 markings, 25607518 edges, 21402 markings/sec, 350 secs
lola: 9201203 markings, 25915225 edges, 24672 markings/sec, 355 secs
lola: 9309913 markings, 26199281 edges, 21742 markings/sec, 360 secs
lola: 9419317 markings, 26484459 edges, 21881 markings/sec, 365 secs
lola: 9518526 markings, 26805382 edges, 19842 markings/sec, 370 secs
lola: 9636159 markings, 27089432 edges, 23527 markings/sec, 375 secs
lola: 9749467 markings, 27375725 edges, 22662 markings/sec, 380 secs
lola: 9846273 markings, 27663246 edges, 19361 markings/sec, 385 secs
lola: 9937366 markings, 27962492 edges, 18219 markings/sec, 390 secs
lola: 10056363 markings, 28248506 edges, 23799 markings/sec, 395 secs
lola: 10220634 markings, 28555291 edges, 32854 markings/sec, 400 secs
lola: 10380654 markings, 28856382 edges, 32004 markings/sec, 405 secs
lola: 10534471 markings, 29153521 edges, 30763 markings/sec, 410 secs
lola: 10683554 markings, 29445464 edges, 29817 markings/sec, 415 secs
lola: 10831347 markings, 29738349 edges, 29559 markings/sec, 420 secs
lola: 10978662 markings, 30032633 edges, 29463 markings/sec, 425 secs
lola: 11124121 markings, 30328274 edges, 29092 markings/sec, 430 secs
lola: 11270025 markings, 30627045 edges, 29181 markings/sec, 435 secs
lola: 11414781 markings, 30926282 edges, 28951 markings/sec, 440 secs
lola: 11558830 markings, 31228217 edges, 28810 markings/sec, 445 secs
lola: 11703813 markings, 31538194 edges, 28997 markings/sec, 450 secs
lola: 11850452 markings, 31879082 edges, 29328 markings/sec, 455 secs
lola: 11969639 markings, 32210550 edges, 23837 markings/sec, 460 secs
lola: 12029304 markings, 32488836 edges, 11933 markings/sec, 465 secs
lola: 12082304 markings, 32760223 edges, 10600 markings/sec, 470 secs
lola: 12130992 markings, 33029187 edges, 9738 markings/sec, 475 secs
lola: 12179569 markings, 33299040 edges, 9715 markings/sec, 480 secs
lola: 12227529 markings, 33568797 edges, 9592 markings/sec, 485 secs
lola: 12272497 markings, 33839681 edges, 8994 markings/sec, 490 secs
lola: 12318618 markings, 34111939 edges, 9224 markings/sec, 495 secs
lola: 12364227 markings, 34386692 edges, 9122 markings/sec, 500 secs
lola: 12409759 markings, 34665100 edges, 9106 markings/sec, 505 secs
lola: 12454917 markings, 34949085 edges, 9032 markings/sec, 510 secs
lola: 12497082 markings, 35238331 edges, 8433 markings/sec, 515 secs
lola: 12607921 markings, 35582396 edges, 22168 markings/sec, 520 secs
lola: 12765153 markings, 35986366 edges, 31446 markings/sec, 525 secs
lola: 12913189 markings, 36398307 edges, 29607 markings/sec, 530 secs
lola: 13034963 markings, 36786162 edges, 24355 markings/sec, 535 secs
lola: 13147669 markings, 37146472 edges, 22541 markings/sec, 540 secs
lola: 13276433 markings, 37472129 edges, 25753 markings/sec, 545 secs
lola: 13402674 markings, 37787973 edges, 25248 markings/sec, 550 secs
lola: 13523494 markings, 38115012 edges, 24164 markings/sec, 555 secs
lola: 13628011 markings, 38443495 edges, 20903 markings/sec, 560 secs
lola: 13748892 markings, 38749824 edges, 24176 markings/sec, 565 secs
lola: 13866063 markings, 39055549 edges, 23434 markings/sec, 570 secs
lola: 13968926 markings, 39348241 edges, 20573 markings/sec, 575 secs
lola: 14067392 markings, 39660384 edges, 19693 markings/sec, 580 secs
lola: 14225305 markings, 39975787 edges, 31583 markings/sec, 585 secs
lola: 14390722 markings, 40283978 edges, 33083 markings/sec, 590 secs
lola: 14547406 markings, 40583621 edges, 31337 markings/sec, 595 secs
lola: 14699501 markings, 40879340 edges, 30419 markings/sec, 600 secs
lola: 14848118 markings, 41174017 edges, 29723 markings/sec, 605 secs
lola: 14995690 markings, 41467485 edges, 29514 markings/sec, 610 secs
lola: 15140370 markings, 41760659 edges, 28936 markings/sec, 615 secs
lola: 15284851 markings, 42054450 edges, 28896 markings/sec, 620 secs
lola: 15427428 markings, 42349383 edges, 28515 markings/sec, 625 secs
lola: 15569762 markings, 42644996 edges, 28467 markings/sec, 630 secs
lola: 15711301 markings, 42944318 edges, 28308 markings/sec, 635 secs
lola: 15854686 markings, 43257929 edges, 28677 markings/sec, 640 secs
lola: 15993897 markings, 43596039 edges, 27842 markings/sec, 645 secs
lola: 16070420 markings, 43887488 edges, 15305 markings/sec, 650 secs
lola: 16124365 markings, 44153525 edges, 10789 markings/sec, 655 secs
lola: 16173712 markings, 44417671 edges, 9869 markings/sec, 660 secs
lola: 16221401 markings, 44680257 edges, 9538 markings/sec, 665 secs
lola: 16267265 markings, 44942261 edges, 9173 markings/sec, 670 secs
lola: 16313967 markings, 45205865 edges, 9340 markings/sec, 675 secs
lola: 16358229 markings, 45470606 edges, 8852 markings/sec, 680 secs
lola: 16402214 markings, 45736169 edges, 8797 markings/sec, 685 secs
lola: 16447185 markings, 46004690 edges, 8994 markings/sec, 690 secs
lola: 16491152 markings, 46276820 edges, 8793 markings/sec, 695 secs
lola: 16535039 markings, 46554428 edges, 8777 markings/sec, 700 secs
lola: 16575881 markings, 46841312 edges, 8168 markings/sec, 705 secs
lola: 16723052 markings, 47233384 edges, 29434 markings/sec, 710 secs
lola: 16895886 markings, 47696988 edges, 34567 markings/sec, 715 secs
lola: 17019187 markings, 48112436 edges, 24660 markings/sec, 720 secs
lola: 17156683 markings, 48502212 edges, 27499 markings/sec, 725 secs
lola: 17315581 markings, 48888410 edges, 31780 markings/sec, 730 secs
lola: 17462035 markings, 49277037 edges, 29291 markings/sec, 735 secs
lola: 17586930 markings, 49646689 edges, 24979 markings/sec, 740 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10))))
lola: processed formula length: 93
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ========================================
lola: ...considering subproblem: ((p4il_4_5 <= pbl_9_10) AND E (X (A (F ((pb3_6_7 <= p4il_9_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4il_4_5 <= pbl_9_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4il_4_5 <= pbl_9_10)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 14 will run for 1393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((pb3_6_7 <= p4il_9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (pb3_6_7 <= p4il_9_7)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: 485591 markings, 485935 edges, 97118 markings/sec, 0 secs
lola: 962562 markings, 963008 edges, 95394 markings/sec, 5 secs
lola: 1484258 markings, 1484966 edges, 104339 markings/sec, 10 secs
lola: 1992650 markings, 1993479 edges, 101678 markings/sec, 15 secs
lola: 2392344 markings, 2393318 edges, 79939 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G ((2 <= pb1_10_3)))) AND ((((p1ol_3_1 + 1 <= pb2_3_10) AND (3 <= p1i_3_4)) OR ((1 <= p4ol_2_4) AND (1 <= pbl_4_9) AND (p1il_4_8 <= p1il_6_7) AND (p4ol_1_9 <= pb4_10_3))) OR (((1 <= p1il_10_8) OR (pb4_6_10 <= 0)) OR A (X ((1 <= pb2_10_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb1_10_3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb1_10_3 <= 1))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p4ol_6_11 <= 0) AND (pb1_2_7 + 1 <= p4il_7_7)) U E (G ((p1il_7_6 <= p1il_7_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p4ol_6_11 <= 0) AND (pb1_2_7 + 1 <= p4il_7_7)) U NOT(A(TRUE U (p1il_7_5 + 1 <= p1il_7_6))))
lola: processed formula length: 95
lola: 3 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: RESULT
lola:
SUMMARY: yes no no no yes yes yes no no no yes yes no no no yes
lola: ========================================
FORMULA SquareGrid-PT-100510-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494935273203

--------------------
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-100510"
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-100510.tgz
mv SquareGrid-PT-100510 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-100510, 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-149441008300147"
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 ;