fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r008-csrt-149436126500597
Last Updated
June 27, 2017

About the Execution of LoLA for CircadianClock-PT-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15947.170 985792.00 985978.00 2384.20 T?F???TFF?????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 CircadianClock-PT-010000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500597
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494621727711


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ CircadianClock-PT-010000 @ 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-010000-CTLCardinality.task
lola: ((2 <= ma) OR E (F ((a_cap <= 0)))) : A (F (NOT(A (G ((da_a <= r_cap)))))) : (A (G ((mr <= c_cap))) OR ((E (X ((1 <= c))) AND ((r_cap <= mr) OR (da_a <= 2))) AND ((3 <= r_cap) OR (mr <= r_cap)))) : A (F (A (G (((3 <= a) OR (dr <= mr_cap)))))) : E (F (NOT(E (G ((1 <= a_cap)))))) : A (G ((E (F ((1 <= mr_cap))) OR ((1 <= dr_a) AND (dr_a <= ma) AND ((1 <= r_cap) OR (dr_a <= ma)))))) : E ((A (F ((a <= da_a))) U A (G ((dr <= a_cap))))) : E (G ((E (F ((3 <= dr_a))) AND ((ma <= c_cap) OR (ma_cap <= mr) OR ((ma <= da_a) AND (3 <= c)))))) : (A (G (A (G ((dr <= ma_cap))))) OR NOT((((mr + 1 <= dr)) AND A (X (TRUE))))) : NOT(A (G (E (X ((da_a <= mr_cap)))))) : NOT((E (F (((3 <= dr_a) OR (a_cap <= a)))) OR A (G ((1 <= c))))) : NOT((E (((1 <= ma_cap) U (c_cap <= mr))) AND ((1 <= da) OR (2 <= ma_cap) OR (1 <= dr_a) OR ((c_cap <= mr_cap) AND (r <= c_cap) AND (dr <= 0))))) : E (F (NOT(E (G ((3 <= mr_cap)))))) : E ((((c <= a) OR (3 <= r_cap) OR (a_cap <= ma)) U E (F ((c_cap <= mr))))) : A (G (E (F (())))) : A (G (NOT(E (F ((c_cap <= da))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= ma) OR E (F ((a_cap <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= ma)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ma)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((a_cap <= 0)))
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 28 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 CircadianClock-PT-010000-CTLCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (G ((da_a <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (r_cap + 1 <= da_a)))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6162823 markings, 9243132 edges, 1232565 markings/sec, 0 secs
lola: 12596433 markings, 18892236 edges, 1286722 markings/sec, 5 secs
lola: 18987187 markings, 28478137 edges, 1278151 markings/sec, 10 secs
lola: 24937113 markings, 37402978 edges, 1189985 markings/sec, 15 secs
lola: 30670356 markings, 46001889 edges, 1146649 markings/sec, 20 secs
lola: 36554069 markings, 54826309 edges, 1176743 markings/sec, 25 secs
lola: 42606250 markings, 63908381 edges, 1210436 markings/sec, 30 secs
lola: 48523332 markings, 72784238 edges, 1183416 markings/sec, 35 secs
lola: 54235157 markings, 81347869 edges, 1142365 markings/sec, 40 secs
lola: 59824822 markings, 89736652 edges, 1117933 markings/sec, 45 secs
lola: 65782756 markings, 98672223 edges, 1191587 markings/sec, 50 secs
lola: 71605104 markings, 107406627 edges, 1164470 markings/sec, 55 secs
lola: 77264621 markings, 115895379 edges, 1131903 markings/sec, 60 secs
lola: 82756006 markings, 124130144 edges, 1098277 markings/sec, 65 secs
lola: 88727076 markings, 133089715 edges, 1194214 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((mr <= c_cap))) OR ((E (X ((1 <= c))) AND ((r_cap <= mr) OR (da_a <= 2))) AND ((3 <= r_cap) OR (mr <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((mr <= c_cap)))
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 28 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: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= c)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= c))
lola: processed formula length: 12
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= a) OR (dr <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((a <= 2) AND (mr_cap + 1 <= dr)))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6593353 markings, 9886374 edges, 3111071724204982272 markings/sec, 0 secs
lola: 12999507 markings, 19498362 edges, 1281231 markings/sec, 5 secs
lola: 19238303 markings, 28855644 edges, 1247759 markings/sec, 10 secs
lola: 25434810 markings, 38148348 edges, 1239301 markings/sec, 15 secs
lola: 31390963 markings, 47082533 edges, 1191231 markings/sec, 20 secs
lola: 37195195 markings, 55788529 edges, 1160846 markings/sec, 25 secs
lola: 43060554 markings, 64588955 edges, 1173072 markings/sec, 30 secs
lola: 49021332 markings, 73530212 edges, 1192156 markings/sec, 35 secs
lola: 54983474 markings, 82474198 edges, 1192428 markings/sec, 40 secs
lola: 60938259 markings, 91403471 edges, 1190957 markings/sec, 45 secs
lola: 67004112 markings, 100504874 edges, 1213171 markings/sec, 50 secs
lola: 73058683 markings, 109583713 edges, 1210914 markings/sec, 55 secs
lola: 78625612 markings, 117937293 edges, 1113386 markings/sec, 60 secs
lola: 84328782 markings, 126492999 edges, 1140634 markings/sec, 65 secs
lola: 90259503 markings, 135384493 edges, 1186144 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (G ((1 <= a_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (a_cap <= 0)))
lola: processed formula length: 32
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 3569655 markings, 12470548 edges, 713931 markings/sec, 0 secs
lola: 6910692 markings, 24169500 edges, 668207 markings/sec, 5 secs
lola: 10255037 markings, 35889632 edges, 668869 markings/sec, 10 secs
lola: 13688249 markings, 47891672 edges, 686642 markings/sec, 15 secs
lola: 16991700 markings, 59454332 edges, 660690 markings/sec, 20 secs
lola: 20308321 markings, 71063399 edges, 663324 markings/sec, 25 secs
lola: 23532354 markings, 82343718 edges, 644807 markings/sec, 30 secs
lola: 26815291 markings, 93849822 edges, 656587 markings/sec, 35 secs
lola: 29933333 markings, 104761834 edges, 623608 markings/sec, 40 secs
lola: 33041504 markings, 115644360 edges, 621634 markings/sec, 45 secs
lola: 36113616 markings, 126392657 edges, 614422 markings/sec, 50 secs
lola: 39364853 markings, 137774696 edges, 650247 markings/sec, 55 secs
lola: 42454246 markings, 148580657 edges, 617879 markings/sec, 60 secs
lola: 45702113 markings, 159956166 edges, 649573 markings/sec, 65 secs
lola: 48759619 markings, 170656034 edges, 611501 markings/sec, 70 secs
lola: 51776830 markings, 181214730 edges, 603442 markings/sec, 75 secs
lola: 55014541 markings, 192528294 edges, 647542 markings/sec, 80 secs
lola: 58139714 markings, 203485947 edges, 625035 markings/sec, 85 secs
lola: 61049402 markings, 213664665 edges, 581938 markings/sec, 90 secs
lola: 64206342 markings, 224722156 edges, 631388 markings/sec, 95 secs
lola: 67316732 markings, 235594334 edges, 622078 markings/sec, 100 secs
lola: 70557056 markings, 246938962 edges, 648065 markings/sec, 105 secs
lola: 73877388 markings, 258564586 edges, 664066 markings/sec, 110 secs
lola: 77117712 markings, 269889005 edges, 648065 markings/sec, 115 secs
lola: 80258026 markings, 280897287 edges, 628063 markings/sec, 120 secs
lola: 83564415 markings, 292473478 edges, 661278 markings/sec, 125 secs
lola: 87012926 markings, 304534679 edges, 689702 markings/sec, 130 secs
lola: 90282179 markings, 315984198 edges, 653851 markings/sec, 135 secs
lola: 93437190 markings, 327010548 edges, 631002 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((1 <= mr_cap))) OR ((1 <= dr_a) AND (dr_a <= ma) AND ((1 <= r_cap) OR (dr_a <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (1 <= mr_cap))) AND ((dr_a <= 0) OR (ma + 1 <= dr_a) OR ((r_cap <= 0) AND (ma + 1 <= dr_a))))))
lola: processed formula length: 124
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 4471496 markings, 11174263 edges, 3108995021618020352 markings/sec, 0 secs
lola: 8843363 markings, 22107168 edges, 874373 markings/sec, 5 secs
lola: 13139058 markings, 32846516 edges, 859139 markings/sec, 10 secs
lola: 17401875 markings, 43504620 edges, 852563 markings/sec, 15 secs
lola: 21498467 markings, 53744324 edges, 819318 markings/sec, 20 secs
lola: 25737918 markings, 64342466 edges, 847890 markings/sec, 25 secs
lola: 29728909 markings, 74319303 edges, 798198 markings/sec, 30 secs
lola: 33931593 markings, 84824881 edges, 840537 markings/sec, 35 secs
lola: 38076211 markings, 95186726 edges, 828924 markings/sec, 40 secs
lola: 42224013 markings, 105559927 edges, 829560 markings/sec, 45 secs
lola: 46497725 markings, 116240848 edges, 854742 markings/sec, 50 secs
lola: 50534496 markings, 126331518 edges, 807354 markings/sec, 55 secs
lola: 54597220 markings, 136488929 edges, 812545 markings/sec, 60 secs
lola: 58555812 markings, 146384550 edges, 791718 markings/sec, 65 secs
lola: 62600934 markings, 156499670 edges, 809024 markings/sec, 70 secs
lola: 66616626 markings, 166536581 edges, 803138 markings/sec, 75 secs
lola: 70702706 markings, 176754580 edges, 817216 markings/sec, 80 secs
lola: 74868853 markings, 187171449 edges, 833229 markings/sec, 85 secs
lola: 78890902 markings, 197225748 edges, 804410 markings/sec, 90 secs
lola: 82863167 markings, 207155355 edges, 794453 markings/sec, 95 secs
lola: 87075526 markings, 217685404 edges, 842472 markings/sec, 100 secs
lola: 91141436 markings, 227849749 edges, 813182 markings/sec, 105 secs
lola: 94345312 markings, 235861217 edges, 640775 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((a <= da_a))) U A (G ((dr <= a_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (a <= da_a)) U NOT(E(TRUE U (a_cap + 1 <= dr))))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 6480001 markings, 9719678 edges, 3096159597753270272 markings/sec, 0 secs
lola: 12388611 markings, 18579230 edges, 1181722 markings/sec, 5 secs
lola: 18206200 markings, 27307111 edges, 1163518 markings/sec, 10 secs
lola: 24299036 markings, 36446856 edges, 1218567 markings/sec, 15 secs
lola: 30511906 markings, 45763431 edges, 1242574 markings/sec, 20 secs
lola: 36522395 markings, 54782964 edges, 1202098 markings/sec, 25 secs
lola: 42157708 markings, 63233308 edges, 1127063 markings/sec, 30 secs
lola: 47876825 markings, 71811255 edges, 1143823 markings/sec, 35 secs
lola: 53418496 markings, 80124320 edges, 1108334 markings/sec, 40 secs
lola: 58994236 markings, 88487185 edges, 1115148 markings/sec, 45 secs
lola: 64676831 markings, 97010427 edges, 1136519 markings/sec, 50 secs
lola: 70327702 markings, 105491219 edges, 1130174 markings/sec, 55 secs
lola: 75990344 markings, 113984144 edges, 1132528 markings/sec, 60 secs
lola: 81437482 markings, 122151554 edges, 1089428 markings/sec, 65 secs
lola: 87680354 markings, 131516323 edges, 1248574 markings/sec, 70 secs
lola: 93569015 markings, 140353352 edges, 1177732 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((3 <= dr_a))) AND ((ma <= c_cap) OR (ma_cap <= mr) OR ((ma <= da_a) AND (3 <= c))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (3 <= dr_a))) OR ((c_cap + 1 <= ma) AND (mr + 1 <= ma_cap) AND ((da_a + 1 <= ma) OR (c <= 2))))))
lola: processed formula length: 125
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6251583 markings, 9372853 edges, 3225847544005263360 markings/sec, 0 secs
lola: 12526873 markings, 18787500 edges, 1255058 markings/sec, 5 secs
lola: 18749296 markings, 28120234 edges, 1244485 markings/sec, 10 secs
lola: 24691304 markings, 37032539 edges, 1188402 markings/sec, 15 secs
lola: 30452905 markings, 45674428 edges, 1152320 markings/sec, 20 secs
lola: 36395500 markings, 54589180 edges, 1188519 markings/sec, 25 secs
lola: 42499942 markings, 63747759 edges, 1220888 markings/sec, 30 secs
lola: 48652602 markings, 72975035 edges, 1230532 markings/sec, 35 secs
lola: 54616480 markings, 81920228 edges, 1192776 markings/sec, 40 secs
lola: 60612889 markings, 90915920 edges, 1199282 markings/sec, 45 secs
lola: 66763092 markings, 100142844 edges, 1230041 markings/sec, 50 secs
lola: 72823788 markings, 109233935 edges, 1212139 markings/sec, 55 secs
lola: 78722897 markings, 118081857 edges, 1179822 markings/sec, 60 secs
lola: 84745956 markings, 127117674 edges, 1204612 markings/sec, 65 secs
lola: 91016519 markings, 136521070 edges, 1254113 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((dr <= ma_cap))))) OR NOT((((mr + 1 <= dr)) AND A (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((dr <= ma_cap)))
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 28 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 CircadianClock-PT-010000-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((dr <= mr))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((dr <= mr))
lola: processed formula length: 12
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (X ((da_a <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: ========================================
lola: ========================================
lola: processed formula: E(TRUE U AX((mr_cap + 1 <= da_a)))
lola: processed formula length: 34
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 5628984 markings, 8439265 edges, 1125797 markings/sec, 0 secs
lola: 11088908 markings, 16629462 edges, 1091985 markings/sec, 5 secs
lola: 16536736 markings, 24802643 edges, 1089566 markings/sec, 10 secs
lola: 21891880 markings, 32832974 edges, 1071029 markings/sec, 15 secs
lola: 27485249 markings, 41226622 edges, 1118674 markings/sec, 20 secs
lola: 32415151 markings, 48618680 edges, 985980 markings/sec, 25 secs
lola: 37246853 markings, 55868715 edges, 966340 markings/sec, 30 secs
lola: 42105385 markings, 63157490 edges, 971706 markings/sec, 35 secs
lola: 47075539 markings, 70608721 edges, 994031 markings/sec, 40 secs
lola: 51872344 markings, 77804936 edges, 959361 markings/sec, 45 secs
lola: 56657527 markings, 84982220 edges, 957037 markings/sec, 50 secs
lola: 61343725 markings, 92014381 edges, 937240 markings/sec, 55 secs
lola: 66185052 markings, 99276792 edges, 968265 markings/sec, 60 secs
lola: 70915197 markings, 106368742 edges, 946029 markings/sec, 65 secs
lola: 75593145 markings, 113386923 edges, 935590 markings/sec, 70 secs
lola: 79820019 markings, 119726044 edges, 845375 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((3 <= dr_a) OR (a_cap <= a)))) OR A (G ((1 <= c)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((dr_a <= 2) AND (a + 1 <= a_cap))))
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 28 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-010000-CTLCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((1 <= ma_cap) U (c_cap <= mr))) AND ((1 <= da) OR (2 <= ma_cap) OR (1 <= dr_a) OR ((c_cap <= mr_cap) AND (r <= c_cap) AND (dr <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((ma_cap <= 0) R (mr + 1 <= c_cap)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((1 <= ma_cap) U (c_cap <= mr)))
lola: processed formula length: 37
lola: 9 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6178836 markings, 9267361 edges, 3689348869717491712 markings/sec, 0 secs
lola: 11939748 markings, 17908897 edges, 1152182 markings/sec, 5 secs
lola: 17535826 markings, 26300773 edges, 1119216 markings/sec, 10 secs
lola: 23453200 markings, 35175225 edges, 1183475 markings/sec, 15 secs
lola: 29652322 markings, 44473804 edges, 1239824 markings/sec, 20 secs
lola: 35905602 markings, 53857397 edges, 1250656 markings/sec, 25 secs
lola: 42052137 markings, 63074239 edges, 1229307 markings/sec, 30 secs
lola: 48141717 markings, 72211026 edges, 1217916 markings/sec, 35 secs
lola: 54221168 markings, 81329622 edges, 1215890 markings/sec, 40 secs
lola: 60318951 markings, 90474885 edges, 1219557 markings/sec, 45 secs
lola: 66373769 markings, 99557087 edges, 1210964 markings/sec, 50 secs
lola: 72273677 markings, 108407290 edges, 1179982 markings/sec, 55 secs
lola: 77934570 markings, 116898466 edges, 1132179 markings/sec, 60 secs
lola: 83783539 markings, 125672887 edges, 1169794 markings/sec, 65 secs
lola: 90063863 markings, 135093222 edges, 1256065 markings/sec, 70 secs
lola: 94352543 markings, 141527260 edges, 857736 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((da <= 0) AND (ma_cap <= 1) AND (dr_a <= 0) AND ((mr_cap + 1 <= c_cap) OR (c_cap + 1 <= r) OR (1 <= dr)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((da <= 0) AND (ma_cap <= 1) AND (dr_a <= 0) AND ((mr_cap + 1 <= c_cap) OR (c_cap + 1 <= r) OR (1 <= dr)))
lola: processed formula length: 108
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: processed formula with 6 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (G ((3 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (mr_cap <= 2)))
lola: processed formula length: 33
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: ========================================
lola: ========================================
lola: 3658231 markings, 12802740 edges, 731646 markings/sec, 0 secs
lola: 7130714 markings, 24932497 edges, 694497 markings/sec, 5 secs
lola: 10465721 markings, 36618339 edges, 667001 markings/sec, 10 secs
lola: 13919248 markings, 48716292 edges, 690705 markings/sec, 15 secs
lola: 17274366 markings, 60456596 edges, 671024 markings/sec, 20 secs
lola: 20611966 markings, 72117119 edges, 667520 markings/sec, 25 secs
lola: 24032404 markings, 84102791 edges, 684088 markings/sec, 30 secs
lola: 27254251 markings, 95385639 edges, 644369 markings/sec, 35 secs
lola: 30361749 markings, 106265477 edges, 621500 markings/sec, 40 secs
lola: 33454059 markings, 117084562 edges, 618462 markings/sec, 45 secs
lola: 36533654 markings, 127858593 edges, 615919 markings/sec, 50 secs
lola: 39753976 markings, 139119306 edges, 644064 markings/sec, 55 secs
lola: 43179646 markings, 151126424 edges, 685134 markings/sec, 60 secs
lola: 46674668 markings, 163336336 edges, 699004 markings/sec, 65 secs
lola: 50067550 markings, 175230068 edges, 678576 markings/sec, 70 secs
lola: 53398620 markings, 186891807 edges, 666214 markings/sec, 75 secs
lola: 56715672 markings, 198482282 edges, 663410 markings/sec, 80 secs
lola: 59981395 markings, 209932577 edges, 653145 markings/sec, 85 secs
lola: 63216322 markings, 221243099 edges, 646985 markings/sec, 90 secs
lola: 66576658 markings, 232993301 edges, 672067 markings/sec, 95 secs
lola: 69907125 markings, 244674603 edges, 666093 markings/sec, 100 secs
lola: 73062521 markings, 255716428 edges, 631079 markings/sec, 105 secs
lola: 76178556 markings, 266620414 edges, 623207 markings/sec, 110 secs
lola: 79380080 markings, 277826350 edges, 640305 markings/sec, 115 secs
lola: 82558256 markings, 288940985 edges, 635635 markings/sec, 120 secs
lola: 86045331 markings, 301157021 edges, 697415 markings/sec, 125 secs
lola: 89458999 markings, 313101520 edges, 682734 markings/sec, 130 secs
lola: 92844551 markings, 324953560 edges, 677110 markings/sec, 135 secs
lola: 94355125 markings, 330228831 edges, 302115 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((c <= a) OR (3 <= r_cap) OR (a_cap <= ma)) U E (F ((c_cap <= mr)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((c <= a) OR (3 <= r_cap) OR (a_cap <= ma)) U E(TRUE U (c_cap <= mr)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 6713992 markings, 10067648 edges, 2069776350901698560 markings/sec, 0 secs
lola: 12919277 markings, 19377908 edges, 1241057 markings/sec, 5 secs
lola: 19257730 markings, 28884496 edges, 1267691 markings/sec, 10 secs
lola: 25494687 markings, 38238098 edges, 1247391 markings/sec, 15 secs
lola: 31577295 markings, 47363010 edges, 1216522 markings/sec, 20 secs
lola: 37347758 markings, 56019626 edges, 1154093 markings/sec, 25 secs
lola: 43055946 markings, 64579739 edges, 1141638 markings/sec, 30 secs
lola: 48856134 markings, 73279825 edges, 1160038 markings/sec, 35 secs
lola: 54867095 markings, 82299839 edges, 1202192 markings/sec, 40 secs
lola: 60912587 markings, 91365632 edges, 1209098 markings/sec, 45 secs
lola: 67116001 markings, 100669357 edges, 1240683 markings/sec, 50 secs
lola: 73189852 markings, 109783512 edges, 1214770 markings/sec, 55 secs
lola: 79137865 markings, 118701822 edges, 1189603 markings/sec, 60 secs
lola: 85262849 markings, 127891435 edges, 1224997 markings/sec, 65 secs
lola: 91440964 markings, 137157356 edges, 1235623 markings/sec, 70 secs
lola: 94306683 markings, 141458650 edges, 573144 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-010000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: subprocess 15 will run for 2554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((c_cap <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 CircadianClock-PT-010000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-010000-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no unknown unknown unknown unknown unknown no unknown no unknown unknown unknown yes no
FORMULA CircadianClock-PT-010000-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-010000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494622713503

--------------------
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="CircadianClock-PT-010000"
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/CircadianClock-PT-010000.tgz
mv CircadianClock-PT-010000 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 CircadianClock-PT-010000, 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 r008-csrt-149436126500597"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;