About the Execution of LoLA for DLCround-PT-03b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15931.530 | 1025923.00 | 1030363.00 | 184.00 | F?TT?TTF?FFTFTFT | 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 DLCround-PT-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961600210
=====================================================================
--------------------
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 DLCround-PT-03b-CTLCardinality-0
FORMULA_NAME DLCround-PT-03b-CTLCardinality-1
FORMULA_NAME DLCround-PT-03b-CTLCardinality-10
FORMULA_NAME DLCround-PT-03b-CTLCardinality-11
FORMULA_NAME DLCround-PT-03b-CTLCardinality-12
FORMULA_NAME DLCround-PT-03b-CTLCardinality-13
FORMULA_NAME DLCround-PT-03b-CTLCardinality-14
FORMULA_NAME DLCround-PT-03b-CTLCardinality-15
FORMULA_NAME DLCround-PT-03b-CTLCardinality-2
FORMULA_NAME DLCround-PT-03b-CTLCardinality-3
FORMULA_NAME DLCround-PT-03b-CTLCardinality-4
FORMULA_NAME DLCround-PT-03b-CTLCardinality-5
FORMULA_NAME DLCround-PT-03b-CTLCardinality-6
FORMULA_NAME DLCround-PT-03b-CTLCardinality-7
FORMULA_NAME DLCround-PT-03b-CTLCardinality-8
FORMULA_NAME DLCround-PT-03b-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496536607595
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DLCround-PT-03b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCround-PT-03b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ DLCround-PT-03b @ 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: 3270/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1383 places, 1887 transitions, 1331 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2418 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-03b-CTLCardinality.task
lola: A (F (A (((3 <= p545) U (2 <= p320))))) : E (F (NOT(E (F ((p1246 <= p911)))))) : E (F (A (((1 <= p570) U (2 <= p1351))))) : A (G (E (X ((p134 <= p163))))) : NOT((E (F (((1 <= p807) AND (p1236 <= p79)))) AND A (((p393 <= p24) U (p269 <= p1119))))) : (A (G (E (X ((2 <= p449))))) OR E (G (((p715 <= p825) OR (3 <= p1155) OR ((p1013 <= p436) AND (1 <= p113)))))) : (A (F (A (F ((2 <= p358))))) AND E (G (((p1121 <= 0) OR (p244 + 1 <= p533))))) : (E (G ((3 <= p121))) OR E (F (((p173 + 1 <= p106) AND ((p506 <= p578) OR (2 <= p491)))))) : (NOT(A (((2 <= p388) U (p585 <= p50)))) OR A (G ((p527 <= p33)))) : E (F (E (G ((p272 <= p942))))) : NOT(E (F ((2 <= p1309)))) : E (F (((1 <= p797) AND ((p586 + 1 <= p778) OR (p718 + 1 <= p1037))))) : E (((p575 <= p966) U ((1 <= p1000) AND (p1124 <= p820) AND (1 <= p164)))) : (E (F (E (G ((p870 <= p665))))) OR (p1214 + 1 <= p772)) : E ((((p691 <= p1216) OR ((p723 <= p143) AND (2 <= p212))) U ((3 <= p142) OR (p1091 + 1 <= p583)))) : A (G (NOT(E (G ((p630 <= p502))))))
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 (F (A (((3 <= p545) U (2 <= p320)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((3 <= p545) U (2 <= p320)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((p1246 <= p911))))))
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 (p1246 <= p911))))
lola: processed formula length: 40
lola: 6 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: 342599 markings, 924436 edges, 68520 markings/sec, 0 secs
lola: 592466 markings, 1867087 edges, 49973 markings/sec, 5 secs
lola: 906429 markings, 2802204 edges, 62793 markings/sec, 10 secs
lola: 1205863 markings, 3711434 edges, 59887 markings/sec, 15 secs
lola: 1518930 markings, 4630524 edges, 62613 markings/sec, 20 secs
lola: 1838473 markings, 5563535 edges, 63909 markings/sec, 25 secs
lola: 2164458 markings, 6488995 edges, 65197 markings/sec, 30 secs
lola: 2470532 markings, 7417859 edges, 61215 markings/sec, 35 secs
lola: 2789941 markings, 8367142 edges, 63882 markings/sec, 40 secs
lola: 3102989 markings, 9342108 edges, 62610 markings/sec, 45 secs
lola: 3420605 markings, 10278771 edges, 63523 markings/sec, 50 secs
lola: 3726271 markings, 11227348 edges, 61133 markings/sec, 55 secs
lola: 4035521 markings, 12173880 edges, 61850 markings/sec, 60 secs
lola: 4334479 markings, 13072942 edges, 59792 markings/sec, 65 secs
lola: 4627590 markings, 13956951 edges, 58622 markings/sec, 70 secs
lola: 4910998 markings, 14806201 edges, 56682 markings/sec, 75 secs
lola: 5215501 markings, 15736901 edges, 60901 markings/sec, 80 secs
lola: 5541042 markings, 16697295 edges, 65108 markings/sec, 85 secs
lola: 5847903 markings, 17596382 edges, 61372 markings/sec, 90 secs
lola: 6133035 markings, 18471235 edges, 57026 markings/sec, 95 secs
lola: 6436189 markings, 19342369 edges, 60631 markings/sec, 100 secs
lola: 6743204 markings, 20217990 edges, 61403 markings/sec, 105 secs
lola: 7028830 markings, 21068027 edges, 57125 markings/sec, 110 secs
lola: 7310777 markings, 21917294 edges, 56389 markings/sec, 115 secs
lola: 7587711 markings, 22758715 edges, 55387 markings/sec, 120 secs
lola: 7878231 markings, 23614722 edges, 58104 markings/sec, 125 secs
lola: 8179461 markings, 24477160 edges, 60246 markings/sec, 130 secs
lola: 8465105 markings, 25334155 edges, 57129 markings/sec, 135 secs
lola: 8751175 markings, 26165440 edges, 57214 markings/sec, 140 secs
lola: 9038932 markings, 27024611 edges, 57551 markings/sec, 145 secs
lola: 9341170 markings, 27881302 edges, 60448 markings/sec, 150 secs
lola: 9613125 markings, 28700415 edges, 54391 markings/sec, 155 secs
lola: 9904652 markings, 29557896 edges, 58305 markings/sec, 160 secs
lola: 10221425 markings, 30477902 edges, 63355 markings/sec, 165 secs
lola: 10536194 markings, 31391267 edges, 62954 markings/sec, 170 secs
lola: 10853330 markings, 32296455 edges, 63427 markings/sec, 175 secs
lola: 11180919 markings, 33252320 edges, 65518 markings/sec, 180 secs
lola: 11505040 markings, 34205133 edges, 64824 markings/sec, 185 secs
lola: 11834879 markings, 35173843 edges, 65968 markings/sec, 190 secs
lola: 12155485 markings, 36117278 edges, 64121 markings/sec, 195 secs
lola: 12474321 markings, 37045976 edges, 63767 markings/sec, 200 secs
lola: 12802885 markings, 37982815 edges, 65713 markings/sec, 205 secs
lola: 13129122 markings, 38890370 edges, 65247 markings/sec, 210 secs
lola: 13447728 markings, 39813778 edges, 63721 markings/sec, 215 secs
lola: 13771921 markings, 40740599 edges, 64839 markings/sec, 220 secs
lola: 14088867 markings, 41673633 edges, 63389 markings/sec, 225 secs
lola: 14408900 markings, 42604335 edges, 64007 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p570) U (2 <= p1351)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p570) U (2 <= p1351)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: 494332 markings, 1045753 edges, 98866 markings/sec, 0 secs
lola: 974788 markings, 2065303 edges, 96091 markings/sec, 5 secs
lola: 1455563 markings, 3091678 edges, 96155 markings/sec, 10 secs
lola: 1944112 markings, 4133692 edges, 97710 markings/sec, 15 secs
lola: 2399484 markings, 5106837 edges, 91074 markings/sec, 20 secs
lola: 2865850 markings, 6100186 edges, 93273 markings/sec, 25 secs
lola: 3333443 markings, 7094393 edges, 93519 markings/sec, 30 secs
lola: 3787622 markings, 8063450 edges, 90836 markings/sec, 35 secs
lola: 4256078 markings, 9056458 edges, 93691 markings/sec, 40 secs
lola: 4706341 markings, 10014270 edges, 90053 markings/sec, 45 secs
lola: 5148157 markings, 10954600 edges, 88363 markings/sec, 50 secs
lola: 5583239 markings, 11879626 edges, 87016 markings/sec, 55 secs
lola: 6033432 markings, 12834891 edges, 90039 markings/sec, 60 secs
lola: 6501146 markings, 13832413 edges, 93543 markings/sec, 65 secs
lola: 6960773 markings, 14818128 edges, 91925 markings/sec, 70 secs
lola: 7422507 markings, 15804257 edges, 92347 markings/sec, 75 secs
lola: 7882395 markings, 16786699 edges, 91978 markings/sec, 80 secs
lola: 8341661 markings, 17764771 edges, 91853 markings/sec, 85 secs
lola: 8794167 markings, 18729929 edges, 90501 markings/sec, 90 secs
lola: 9253827 markings, 19712001 edges, 91932 markings/sec, 95 secs
lola: 9707143 markings, 20685574 edges, 90663 markings/sec, 100 secs
lola: 10165083 markings, 21663473 edges, 91588 markings/sec, 105 secs
lola: 10618861 markings, 22632129 edges, 90756 markings/sec, 110 secs
lola: 11074040 markings, 23605105 edges, 91036 markings/sec, 115 secs
lola: 11523737 markings, 24569538 edges, 89939 markings/sec, 120 secs
lola: 11972110 markings, 25529571 edges, 89675 markings/sec, 125 secs
lola: 12407407 markings, 26463835 edges, 87059 markings/sec, 130 secs
lola: 12849843 markings, 27412712 edges, 88487 markings/sec, 135 secs
lola: 13289717 markings, 28356768 edges, 87975 markings/sec, 140 secs
lola: 13710159 markings, 29257280 edges, 84088 markings/sec, 145 secs
lola: 14124612 markings, 30143549 edges, 82891 markings/sec, 150 secs
lola: 14568599 markings, 31098938 edges, 88797 markings/sec, 155 secs
lola: 15018872 markings, 32066610 edges, 90055 markings/sec, 160 secs
lola: 15476187 markings, 33049014 edges, 91463 markings/sec, 165 secs
lola: 15941894 markings, 34045873 edges, 93141 markings/sec, 170 secs
lola: 16409088 markings, 35050559 edges, 93439 markings/sec, 175 secs
lola: 16867957 markings, 36038123 edges, 91774 markings/sec, 180 secs
lola: 17326572 markings, 37023629 edges, 91723 markings/sec, 185 secs
lola: 17784139 markings, 38006979 edges, 91513 markings/sec, 190 secs
lola: 18233384 markings, 38971836 edges, 89849 markings/sec, 195 secs
lola: 18679788 markings, 39929267 edges, 89281 markings/sec, 200 secs
lola: 19089782 markings, 40813746 edges, 81999 markings/sec, 205 secs
lola: 19495671 markings, 41687388 edges, 81178 markings/sec, 210 secs
lola: 19919051 markings, 42588143 edges, 84676 markings/sec, 215 secs
lola: 20358548 markings, 43524251 edges, 87899 markings/sec, 220 secs
lola: 20785499 markings, 44430172 edges, 85390 markings/sec, 225 secs
lola: 21240672 markings, 45399000 edges, 91035 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p134 <= p163)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p134 <= p163)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: 647024 markings, 682505 edges, 129405 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((1 <= p807) AND (p1236 <= p79)))) AND A (((p393 <= p24) U (p269 <= p1119)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p807 <= 0) OR (p79 + 1 <= p1236))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: ========================================
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 DLCround-PT-03b-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p24 + 1 <= p393) R (p1119 + 1 <= p269)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p393 <= p24) U (p269 <= p1119)))
lola: processed formula length: 39
lola: 11 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((2 <= p449))))) OR E (G (((p715 <= p825) OR (3 <= p1155) OR ((p1013 <= p436) AND (1 <= p113))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((2 <= p449)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((2 <= p449)))))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p715 <= p825) OR (3 <= p1155) OR ((p1013 <= p436) AND (1 <= p113)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p825 + 1 <= p715) AND (p1155 <= 2) AND ((p436 + 1 <= p1013) OR (p113 <= 0)))))
lola: processed formula length: 94
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((2 <= p358))))) AND E (G (((p1121 <= 0) OR (p244 + 1 <= p533)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p358)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p358))
lola: processed formula length: 21
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: (E (G ((3 <= p121))) OR E (F (((p173 + 1 <= p106) AND ((p506 <= p578) OR (2 <= p491))))))
========================================lola:
========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p121)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p121 <= 2)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p173 + 1 <= p106) AND ((p506 <= p578) OR (2 <= p491)))))
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 168 bytes per marking, with 13 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03b-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((2 <= p388) U (p585 <= p50)))) OR A (G ((p527 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p388 <= 1) R (p50 + 1 <= p585)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((2 <= p388) U (p585 <= p50)))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 9 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p527 <= p33)))
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 168 bytes per marking, with 13 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 DLCround-PT-03b-CTLCardinality-9.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: ========================================
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p272 <= p942)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p942 + 1 <= p272))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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 10 will run for 510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= p1309))))
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 168 bytes per marking, with 13 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 DLCround-PT-03b-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-03b-CTLCardinality-10.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 11 will run for 612 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p797) AND ((p586 + 1 <= p778) OR (p718 + 1 <= p1037)))))
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 168 bytes per marking, with 13 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-03b-CTLCardinality-11.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p575 <= p966) U ((1 <= p1000) AND (p1124 <= p820) AND (1 <= p164))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p575 <= p966) U ((1 <= p1000) AND (p1124 <= p820) AND (1 <= p164)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: 777015 markings, 868809 edges, 155403 markings/sec, 0 secs
lola: 1493624 markings, 1679246 edges, 143322 markings/sec, 5 secs
lola: 2207517 markings, 2489171 edges, 142779 markings/sec, 10 secs
lola: 2913674 markings, 3288020 edges, 141231 markings/sec, 15 secs
lola: 3613558 markings, 4079388 edges, 139977 markings/sec, 20 secs
lola: 4331898 markings, 4885136 edges, 143668 markings/sec, 25 secs
lola: 5064428 markings, 5712616 edges, 146506 markings/sec, 30 secs
lola: 5819898 markings, 6562971 edges, 151094 markings/sec, 35 secs
lola: 6472770 markings, 7299065 edges, 130574 markings/sec, 40 secs
lola: 7110310 markings, 8027297 edges, 127508 markings/sec, 45 secs
lola: 7826911 markings, 8841468 edges, 143320 markings/sec, 50 secs
lola: 8560208 markings, 9668933 edges, 146659 markings/sec, 55 secs
lola: 9198510 markings, 10394507 edges, 127660 markings/sec, 60 secs
lola: 9871368 markings, 11165827 edges, 134572 markings/sec, 65 secs
lola: 10527013 markings, 11908614 edges, 131129 markings/sec, 70 secs
lola: 11182421 markings, 12655051 edges, 131082 markings/sec, 75 secs
lola: 11896403 markings, 13469788 edges, 142796 markings/sec, 80 secs
lola: 12608161 markings, 14285478 edges, 142352 markings/sec, 85 secs
lola: 13315532 markings, 15095896 edges, 141474 markings/sec, 90 secs
lola: 13983220 markings, 15856506 edges, 133538 markings/sec, 95 secs
lola: 14611862 markings, 16579071 edges, 125728 markings/sec, 100 secs
lola: 15298839 markings, 17368507 edges, 137395 markings/sec, 105 secs
lola: 15942412 markings, 18103367 edges, 128715 markings/sec, 110 secs
lola: 16583199 markings, 18839973 edges, 128157 markings/sec, 115 secs
lola: 17217609 markings, 19569934 edges, 126882 markings/sec, 120 secs
lola: 17857561 markings, 20304632 edges, 127990 markings/sec, 125 secs
lola: 18490272 markings, 21032961 edges, 126542 markings/sec, 130 secs
lola: 19111088 markings, 21748674 edges, 124163 markings/sec, 135 secs
lola: 19740556 markings, 22475308 edges, 125894 markings/sec, 140 secs
lola: 20363125 markings, 23194673 edges, 124514 markings/sec, 145 secs
lola: 20992329 markings, 23919077 edges, 125841 markings/sec, 150 secs
lola: 21711455 markings, 24737946 edges, 143825 markings/sec, 155 secs
lola: 22403308 markings, 25533698 edges, 138371 markings/sec, 160 secs
lola: 23079721 markings, 26312639 edges, 135283 markings/sec, 165 secs
lola: 23772829 markings, 27106525 edges, 138622 markings/sec, 170 secs
lola: 24521729 markings, 27950310 edges, 149780 markings/sec, 175 secs
lola: 25246222 markings, 28760335 edges, 144899 markings/sec, 180 secs
lola: 25984738 markings, 29573725 edges, 147703 markings/sec, 185 secs
lola: 26788467 markings, 30457328 edges, 160746 markings/sec, 190 secs
lola: 27559489 markings, 31306784 edges, 154204 markings/sec, 195 secs
lola: 28342440 markings, 32171997 edges, 156590 markings/sec, 200 secs
lola: 29104761 markings, 33014814 edges, 152464 markings/sec, 205 secs
lola: 29850081 markings, 33839719 edges, 149064 markings/sec, 210 secs
lola: 30584708 markings, 34655363 edges, 146925 markings/sec, 215 secs
lola: 31308069 markings, 35456573 edges, 144672 markings/sec, 220 secs
lola: 32045279 markings, 36272232 edges, 147442 markings/sec, 225 secs
lola: 32774123 markings, 37078179 edges, 145769 markings/sec, 230 secs
lola: 33573315 markings, 37963014 edges, 159838 markings/sec, 235 secs
lola: 34457487 markings, 38936228 edges, 176834 markings/sec, 240 secs
lola: 35323299 markings, 39893301 edges, 173162 markings/sec, 245 secs
lola: 36161090 markings, 40819492 edges, 167558 markings/sec, 250 secs
lola: 36981893 markings, 41723873 edges, 164161 markings/sec, 255 secs
lola: 37779927 markings, 42602374 edges, 159607 markings/sec, 260 secs
lola: 38473780 markings, 43368362 edges, 138771 markings/sec, 265 secs
lola: 39208546 markings, 44177807 edges, 146953 markings/sec, 270 secs
lola: 39939457 markings, 44982314 edges, 146182 markings/sec, 275 secs
lola: 40721455 markings, 45847977 edges, 156400 markings/sec, 280 secs
lola: 41484874 markings, 46691884 edges, 152684 markings/sec, 285 secs
lola: 42184871 markings, 47464951 edges, 139999 markings/sec, 290 secs
lola: 42892950 markings, 48252320 edges, 141616 markings/sec, 295 secs
lola: 43662667 markings, 49103924 edges, 153943 markings/sec, 300 secs
lola: 44447413 markings, 49967266 edges, 156949 markings/sec, 305 secs
lola: 45203530 markings, 50804434 edges, 151223 markings/sec, 310 secs
lola: 45940613 markings, 51621320 edges, 147417 markings/sec, 315 secs
lola: 46651307 markings, 52408710 edges, 142139 markings/sec, 320 secs
lola: 47362574 markings, 53196105 edges, 142253 markings/sec, 325 secs
lola: 48056359 markings, 53966642 edges, 138757 markings/sec, 330 secs
lola: 48750270 markings, 54736128 edges, 138782 markings/sec, 335 secs
lola: 49465979 markings, 55523508 edges, 143142 markings/sec, 340 secs
lola: 50178375 markings, 56311651 edges, 142479 markings/sec, 345 secs
lola: 50894412 markings, 57104009 edges, 143207 markings/sec, 350 secs
lola: 51645156 markings, 57933917 edges, 150149 markings/sec, 355 secs
lola: 52389389 markings, 58754190 edges, 148847 markings/sec, 360 secs
lola: 53134308 markings, 59573987 edges, 148984 markings/sec, 365 secs
lola: 53862410 markings, 60379817 edges, 145620 markings/sec, 370 secs
lola: 54572626 markings, 61166037 edges, 142043 markings/sec, 375 secs
lola: 55331281 markings, 62000998 edges, 151731 markings/sec, 380 secs
lola: 56086656 markings, 62830705 edges, 151075 markings/sec, 385 secs
lola: 56829548 markings, 63651040 edges, 148578 markings/sec, 390 secs
lola: 57560150 markings, 64458255 edges, 146120 markings/sec, 395 secs
lola: 58325813 markings, 65300212 edges, 153133 markings/sec, 400 secs
lola: 59083529 markings, 66134056 edges, 151543 markings/sec, 405 secs
lola: 59866921 markings, 66996243 edges, 156678 markings/sec, 410 secs
lola: 60692795 markings, 67904846 edges, 165175 markings/sec, 415 secs
lola: 61500050 markings, 68799184 edges, 161451 markings/sec, 420 secs
lola: 62324516 markings, 69708470 edges, 164893 markings/sec, 425 secs
lola: 63134543 markings, 70602394 edges, 162005 markings/sec, 430 secs
lola: 63941404 markings, 71494672 edges, 161372 markings/sec, 435 secs
lola: 64724720 markings, 72355414 edges, 156663 markings/sec, 440 secs
lola: 65496319 markings, 73209606 edges, 154320 markings/sec, 445 secs
lola: 66281405 markings, 74074191 edges, 157017 markings/sec, 450 secs
lola: 67050094 markings, 74920796 edges, 153738 markings/sec, 455 secs
lola: 67838885 markings, 75788412 edges, 157758 markings/sec, 460 secs
lola: 68633258 markings, 76664653 edges, 158875 markings/sec, 465 secs
lola: 69432192 markings, 77547339 edges, 159787 markings/sec, 470 secs
lola: 70226436 markings, 78427482 edges, 158849 markings/sec, 475 secs
lola: 71035951 markings, 79317894 edges, 161903 markings/sec, 480 secs
lola: 71827434 markings, 80195409 edges, 158297 markings/sec, 485 secs
lola: 72628302 markings, 81078013 edges, 160174 markings/sec, 490 secs
lola: 73414130 markings, 81948709 edges, 157166 markings/sec, 495 secs
lola: 74174577 markings, 82792093 edges, 152089 markings/sec, 500 secs
lola: 74934570 markings, 83632428 edges, 151999 markings/sec, 505 secs
lola: 75683393 markings, 84467161 edges, 149765 markings/sec, 510 secs
lola: 76437837 markings, 85306206 edges, 150889 markings/sec, 515 secs
lola: 77214422 markings, 86165508 edges, 155317 markings/sec, 520 secs
lola: 77990470 markings, 87021202 edges, 155210 markings/sec, 525 secs
lola: 78783196 markings, 87897248 edges, 158545 markings/sec, 530 secs
lola: 79554961 markings, 88750559 edges, 154353 markings/sec, 535 secs
lola: 80313519 markings, 89590209 edges, 151712 markings/sec, 540 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 838 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((p870 <= p665))))) OR (p1214 + 1 <= p772))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 838 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p870 <= p665)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p665 + 1 <= p870))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 14 will run for 1257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p691 <= p1216) OR ((p723 <= p143) AND (2 <= p212))) U ((3 <= p142) OR (p1091 + 1 <= p583))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p691 <= p1216) OR ((p723 <= p143) AND (2 <= p212))) U ((3 <= p142) OR (p1091 + 1 <= p583)))
lola: processed formula length: 97
lola: 1 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((p630 <= p502))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p502 + 1 <= p630)))))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 1383 places; total mentions: 0
lola: closed formula file DLCround-PT-03b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 13 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: RESULT
lola:
SUMMARY: no unknown unknown no no yes no yes no yes yes yes unknown yes yes no
lola: ========================================
FORMULA DLCround-PT-03b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-03b-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496537633518
--------------------
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="DLCround-PT-03b"
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/DLCround-PT-03b.tgz
mv DLCround-PT-03b 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 DLCround-PT-03b, 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 r178-csrt-149580961600210"
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 ;