About the Execution of LoLA for S_Echo-PT-d02r19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15937.520 | 525585.00 | 545047.00 | 625.10 | ?TTF?T???FFT?T?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-3254
Executing tool lola
Input is S_Echo-PT-d02r19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612200264
=====================================================================
--------------------
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 Echo-PT-d02r19-CTLCardinality-0
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-1
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-10
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-11
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-12
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-13
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-14
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-15
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-2
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-3
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-4
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-5
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-6
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-7
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-8
FORMULA_NAME Echo-PT-d02r19-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496363636325
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Echo-PT-d02r19: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_Echo-PT-d02r19: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_Echo-PT-d02r19 @ 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: 6185/65536 symbol table entries, 806 collisions
lola: preprocessing...
lola: finding significant places
lola: 3455 places, 2730 transitions, 1726 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5448 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r19-CTLCardinality.task
lola: E (X (E (G (((p2445 <= p785) OR (2 <= p1035)))))) : E (G ((A (X ((p270 <= p3157))) OR E (F ((p1647 <= p3006)))))) : E ((((p527 <= 0) OR (p1727 + 1 <= p518)) U A (X ((1 <= p1518))))) : E (F ((2 <= p108))) : A (F ((3 <= p3171))) : NOT((A (F ((p3022 <= p808))) AND E (F (((2 <= p318) AND (3 <= p2809)))))) : (A (F (A (X ((3 <= p2010))))) AND (p1853 <= p3299)) : (A (G (((p2840 <= 2) OR (p334 + 1 <= p615)))) OR ((3 <= p1421) OR (1 <= p727))) : E (F ((((3 <= p283) OR (3 <= p1348) OR (2 <= p942)) OR A (G ((p1266 <= p1191)))))) : A (G (E (X ((p90 <= 1))))) : E (X ((((p655 <= p3260) AND (1 <= p711) AND (p2740 <= 0)) OR E (G ((p2365 <= p1888)))))) : ((A (G (((1 <= p1750) OR (p2964 <= p3310)))) OR NOT(E (X ((p2408 <= p2319))))) AND (p1713 <= p1865)) : A (F (A (G ((p3306 <= 0))))) : E (G (((p2975 <= p2726) OR (p1303 <= p2158)))) : (((((p1515 + 1 <= p374) OR (p3383 + 1 <= p1189)) OR A (G ((p1413 <= p2473)))) AND (1 <= p2645)) OR NOT(E (F (((1 <= p1672) AND (p2601 <= p3427)))))) : (A (((p1073 <= 2) U ((p3341 <= p527) OR (p1917 <= p995)))) AND (E (F (((1 <= p698) AND (3 <= p2835)))) AND (p268 <= p3013)))
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 (((p2445 <= p785) OR (2 <= p1035))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((p785 + 1 <= p2445) AND (p1035 <= 1)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: 430863 markings, 1413308 edges, 3110627521507360768 markings/sec, 0 secs
lola: 840444 markings, 2846849 edges, 81916 markings/sec, 5 secs
lola: 1239899 markings, 4239517 edges, 79891 markings/sec, 10 secs
lola: 1583166 markings, 5592542 edges, 68653 markings/sec, 15 secs
lola: 1916813 markings, 6845600 edges, 66729 markings/sec, 20 secs
lola: 2270782 markings, 8082051 edges, 70794 markings/sec, 25 secs
lola: 2606268 markings, 9425610 edges, 67097 markings/sec, 30 secs
lola: 2946361 markings, 10785353 edges, 68019 markings/sec, 35 secs
lola: 3253165 markings, 12070890 edges, 61361 markings/sec, 40 secs
lola: 3546217 markings, 13324497 edges, 58610 markings/sec, 45 secs
lola: 3841560 markings, 14513515 edges, 59069 markings/sec, 50 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((p270 <= p3157))) OR E (F ((p1647 <= p3006))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX((p270 <= p3157))) AND NOT(E(TRUE U (p1647 <= p3006))))))
lola: processed formula length: 77
lola: 4 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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 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 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p527 <= 0) OR (p1727 + 1 <= p518)) U A (X ((1 <= p1518)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p527 <= 0) OR (p1727 + 1 <= p518)) U AX((1 <= p1518)))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: 369134 markings, 1196919 edges, 2822845196343967744 markings/sec, 0 secs
lola: 702154 markings, 2377157 edges, 66604 markings/sec, 5 secs
lola: 1052603 markings, 3583308 edges, 70090 markings/sec, 10 secs
lola: 1358374 markings, 4739666 edges, 61154 markings/sec, 15 secs
lola: 1653885 markings, 5867720 edges, 59102 markings/sec, 20 secs
lola: 1941632 markings, 6928747 edges, 57549 markings/sec, 25 secs
lola: 2241108 markings, 8032672 edges, 59895 markings/sec, 30 secs
lola: 2528715 markings, 9187362 edges, 57521 markings/sec, 35 secs
lola: 2816597 markings, 10330631 edges, 57576 markings/sec, 40 secs
lola: 3081403 markings, 11441823 edges, 52961 markings/sec, 45 secs
lola: 3342767 markings, 12573316 edges, 52273 markings/sec, 50 secs
lola: 3604144 markings, 13662236 edges, 52275 markings/sec, 55 secs
lola: 3904317 markings, 14793636 edges, 60035 markings/sec, 60 secs
lola: 4197724 markings, 15971036 edges, 58681 markings/sec, 65 secs
lola: 4492633 markings, 17144093 edges, 58982 markings/sec, 70 secs
lola: 4756783 markings, 18292647 edges, 52830 markings/sec, 75 secs
lola: 5016643 markings, 19399186 edges, 51972 markings/sec, 80 secs
lola: 5293190 markings, 20489410 edges, 55309 markings/sec, 85 secs
lola: 5599016 markings, 21693486 edges, 61165 markings/sec, 90 secs
lola: 5903361 markings, 22918123 edges, 60869 markings/sec, 95 secs
lola: 6202854 markings, 24110216 edges, 59899 markings/sec, 100 secs
lola: 6465089 markings, 25280978 edges, 52447 markings/sec, 105 secs
lola: 6727253 markings, 26395130 edges, 52433 markings/sec, 110 secs
lola: 7035690 markings, 27543797 edges, 61687 markings/sec, 115 secs
lola: 7338443 markings, 28763810 edges, 60551 markings/sec, 120 secs
lola: 7640093 markings, 29968872 edges, 60330 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p108)))
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 6904 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 Echo-PT-d02r19-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-CTLCardinality-3.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 4 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p3171)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= p3171))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((p3022 <= p808))) AND E (F (((2 <= p318) AND (3 <= p2809))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p808 + 1 <= p3022)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p3022 <= p808)))
lola: processed formula length: 30
lola: 9 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p318 <= 1) OR (p2809 <= 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 6904 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-CTLCardinality-6.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p2010))))) AND (p1853 <= p3299))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p2010)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p2010)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: 240686 markings, 1348424 edges, 2976872481744224256 markings/sec, 0 secs
lola: 465154 markings, 2698618 edges, 44894 markings/sec, 5 secs
lola: 675611 markings, 3983581 edges, 42091 markings/sec, 10 secs
lola: 863790 markings, 5250471 edges, 37636 markings/sec, 15 secs
lola: 1058472 markings, 6455389 edges, 38936 markings/sec, 20 secs
lola: 1251908 markings, 7748304 edges, 38687 markings/sec, 25 secs
lola: 1444384 markings, 9084887 edges, 38495 markings/sec, 30 secs
lola: 1620592 markings, 10369877 edges, 35242 markings/sec, 35 secs
lola: 1785191 markings, 11620109 edges, 32920 markings/sec, 40 secs
lola: 1960902 markings, 12828527 edges, 35142 markings/sec, 45 secs
lola: 2146806 markings, 14108872 edges, 37181 markings/sec, 50 secs
lola: 2331017 markings, 15396708 edges, 36842 markings/sec, 55 secs
lola: 2497941 markings, 16638548 edges, 33385 markings/sec, 60 secs
lola: 2656293 markings, 17836292 edges, 31670 markings/sec, 65 secs
lola: 2834743 markings, 19023292 edges, 35690 markings/sec, 70 secs
lola: 3020888 markings, 20328386 edges, 37229 markings/sec, 75 secs
lola: 3203558 markings, 21608248 edges, 36534 markings/sec, 80 secs
lola: 3366104 markings, 22835689 edges, 32509 markings/sec, 85 secs
lola: 3517769 markings, 23979142 edges, 30333 markings/sec, 90 secs
lola: 3698416 markings, 25168113 edges, 36129 markings/sec, 95 secs
lola: 3882041 markings, 26465524 edges, 36725 markings/sec, 100 secs
lola: 4072577 markings, 27780933 edges, 38107 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1853 <= p3299)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1853 <= p3299)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((p2840 <= 2) OR (p334 + 1 <= p615)))) OR ((3 <= p1421) OR (1 <= p727)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2840 <= 2) OR (p334 + 1 <= p615))))
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 6904 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-CTLCardinality-7.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p283) OR (3 <= p1348) OR (2 <= p942)) OR A (G ((p1266 <= p1191))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p283) OR (3 <= p1348) OR (2 <= p942))))
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 6904 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 51799 markings, 219971 edges, 10360 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p1266 <= p1191)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p1191 + 1 <= p1266))))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: 265557 markings, 1489626 edges, 53111 markings/sec, 0 secs
lola: 518127 markings, 3001445 edges, 50514 markings/sec, 5 secs
lola: 745499 markings, 4470152 edges, 45474 markings/sec, 10 secs
lola: 953719 markings, 5834174 edges, 41644 markings/sec, 15 secs
lola: 1168673 markings, 7157172 edges, 42991 markings/sec, 20 secs
lola: 1373752 markings, 8599354 edges, 41016 markings/sec, 25 secs
lola: 1578799 markings, 10040787 edges, 41009 markings/sec, 30 secs
lola: 1757199 markings, 11419668 edges, 35680 markings/sec, 35 secs
lola: 1940068 markings, 12693006 edges, 36574 markings/sec, 40 secs
lola: 2153423 markings, 14155201 edges, 42671 markings/sec, 45 secs
lola: 2365470 markings, 15632006 edges, 42409 markings/sec, 50 secs
lola: 2541127 markings, 16977439 edges, 35131 markings/sec, 55 secs
lola: 2710861 markings, 18237392 edges, 33947 markings/sec, 60 secs
lola: 2914657 markings, 19584228 edges, 40759 markings/sec, 65 secs
lola: 3121184 markings, 21042146 edges, 41305 markings/sec, 70 secs
lola: 3315810 markings, 22437460 edges, 38925 markings/sec, 75 secs
lola: 3486347 markings, 23729420 edges, 34107 markings/sec, 80 secs
lola: 3689026 markings, 25104162 edges, 40536 markings/sec, 85 secs
lola: 3913236 markings, 26677669 edges, 44842 markings/sec, 90 secs
lola: 4132372 markings, 28218911 edges, 43827 markings/sec, 95 secs
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: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p90 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p90 <= 1)))))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((p655 <= p3260) AND (1 <= p711) AND (p2740 <= 0)) OR E (G ((p2365 <= p1888))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p655 <= p3260) AND (1 <= p711) AND (p2740 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p655 <= p3260) AND (1 <= p711) AND (p2740 <= 0)))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p2365 <= p1888)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (p1888 + 1 <= p2365))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= p1750) OR (p2964 <= p3310)))) OR NOT(E (X ((p2408 <= p2319))))) AND (p1713 <= p1865))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1750) OR (p2964 <= p3310))))
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 6904 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p2319 + 1 <= p2408)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p2319 + 1 <= p2408))
lola: processed formula length: 24
lola: 4 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: 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 12 will run for 778 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p3306 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (1 <= p3306))))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: 280859 markings, 1579222 edges, 3689348869717491712 markings/sec, 0 secs
lola: 548263 markings, 3185426 edges, 53481 markings/sec, 5 secs
lola: 778867 markings, 4695884 edges, 46121 markings/sec, 10 secs
lola: 1002271 markings, 6128996 edges, 44681 markings/sec, 15 secs
lola: 1232404 markings, 7605624 edges, 46027 markings/sec, 20 secs
lola: 1459466 markings, 9193137 edges, 45412 markings/sec, 25 secs
lola: 1654142 markings, 10639224 edges, 38935 markings/sec, 30 secs
lola: 1829079 markings, 11966309 edges, 34987 markings/sec, 35 secs
lola: 2035012 markings, 13333357 edges, 41187 markings/sec, 40 secs
lola: 2251065 markings, 14846611 edges, 43211 markings/sec, 45 secs
lola: 2460646 markings, 16347769 edges, 41916 markings/sec, 50 secs
lola: 2647506 markings, 17770838 edges, 37372 markings/sec, 55 secs
lola: 2861488 markings, 19208360 edges, 42796 markings/sec, 60 secs
lola: 3081283 markings, 20751569 edges, 43959 markings/sec, 65 secs
lola: 3292892 markings, 22254036 edges, 42322 markings/sec, 70 secs
lola: 3485930 markings, 23725765 edges, 38608 markings/sec, 75 secs
lola: 3702068 markings, 25194482 edges, 43228 markings/sec, 80 secs
lola: 3912234 markings, 26670931 edges, 42033 markings/sec, 85 secs
lola: 4127676 markings, 28179432 edges, 43088 markings/sec, 90 secs
lola: 4156269 markings, 28412031 edges, 5719 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1005 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2975 <= p2726) OR (p1303 <= p2158))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p2726 + 1 <= p2975) AND (p2158 + 1 <= p1303))))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: subprocess 14 will run for 1507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((((p1515 + 1 <= p374) OR (p3383 + 1 <= p1189)) OR A (G ((p1413 <= p2473)))) AND (1 <= p2645)) OR NOT(E (F (((1 <= p1672) AND (p2601 <= p3427))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1515 + 1 <= p374) OR (p3383 + 1 <= p1189))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1515 + 1 <= p374) OR (p3383 + 1 <= p1189))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: processed formula with 2 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 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1413 <= p2473)))
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 6904 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: ========================================
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: subprocess 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p1073 <= 2) U ((p3341 <= p527) OR (p1917 <= p995)))) AND (E (F (((1 <= p698) AND (3 <= p2835)))) AND (p268 <= p3013)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1073 <= 2) U ((p3341 <= p527) OR (p1917 <= p995))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p1073 <= 2) U ((p3341 <= p527) OR (p1917 <= p995)))
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6904 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p268 <= p3013)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p268 <= p3013)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 3455 places; total mentions: 0
lola: closed formula file Echo-PT-d02r19-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola:
SUMMARY: unknown yes unknown no no yes unknown yes unknown no yes no unknown yes unknown unknown
lola: ========================================
FORMULA Echo-PT-d02r19-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496364161910
--------------------
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="S_Echo-PT-d02r19"
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/S_Echo-PT-d02r19.tgz
mv S_Echo-PT-d02r19 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_Echo-PT-d02r19, 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 r108-blw3-149441612200264"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;