Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_SwimmingPool-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496564588119


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SwimmingPool-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_SwimmingPool-PT-10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SwimmingPool-PT-10 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-10-CTLCardinality.task
lola: A (G ((A (F ((2 <= Dressed))) OR ((Dress <= Bags) OR (Out <= Undress) OR (1 <= InBath))))) : A ((((Cabins <= 1)) U A (F ((1 <= WaitBag))))) : NOT((E (((Entered <= Undress) U (1 <= WaitBag))) OR NOT(A (G ((2 <= Cabins)))))) : E ((() U A (G ((3 <= Bags))))) : A ((A (X ((3 <= Out))) U (1 <= Dressed))) : E (G (A (((3 <= Entered) U (WaitBag <= Undress))))) : A (F (((Cabins + 1 <= WaitBag) OR (Bags + 1 <= Cabins) OR ((InBath <= 0) AND (InBath + 1 <= Undress))))) : E (F ((Out <= 0))) : E (F (A (G ((Undress + 1 <= Bags))))) : (E (F (((3 <= Bags) AND (1 <= Out) AND (Out <= InBath) AND (Dress <= Dressed)))) OR (((Entered + 1 <= InBath) AND (InBath + 1 <= Dressed) AND (Undress <= Cabins)) AND E (((3 <= Bags) U (Dress <= WaitBag))))) : A (F (E (F ((Out <= WaitBag))))) : NOT(((3 <= Dressed) OR (E (F ((1 <= Undress))) AND A (F ((1 <= Dressed)))))) : A (G (((Cabins <= Out) AND (InBath + 1 <= Out)))) : E ((((WaitBag + 1 <= Dressed) OR (WaitBag + 1 <= Dressed)) U E (G ((Dress <= Dressed))))) : (((Undress <= 0) AND A (G (TRUE))) AND (WaitBag <= Entered)) : A (F (E (F ((Bags + 1 <= Cabins)))))
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 (G ((A (F ((2 <= Dressed))) OR ((Dress <= Bags) OR (Out <= Undress) OR (1 <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (2 <= Dressed))) AND ((Bags + 1 <= Dress) AND (Undress + 1 <= Out) AND (InBath <= 0)))))
lola: processed formula length: 115
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 904692 markings, 3764551 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1605875 markings, 6884639 edges, 140237 markings/sec, 5 secs
lola: 2310970 markings, 10045029 edges, 141019 markings/sec, 10 secs
lola: 3001458 markings, 13174264 edges, 138098 markings/sec, 15 secs
lola: 3685990 markings, 16293686 edges, 136906 markings/sec, 20 secs
lola: 4358254 markings, 19370905 edges, 134453 markings/sec, 25 secs
lola: 5024650 markings, 22426398 edges, 133279 markings/sec, 30 secs
lola: 5670905 markings, 25395515 edges, 129251 markings/sec, 35 secs
lola: 6312331 markings, 28352344 edges, 128285 markings/sec, 40 secs
lola: 6945433 markings, 31282500 edges, 126620 markings/sec, 45 secs
lola: 7563297 markings, 34140048 edges, 123573 markings/sec, 50 secs
lola: 8156169 markings, 36887603 edges, 118574 markings/sec, 55 secs
lola: 8773233 markings, 39746747 edges, 123413 markings/sec, 60 secs
lola: 9392921 markings, 42610401 edges, 123938 markings/sec, 65 secs
lola: 9980250 markings, 45350280 edges, 117466 markings/sec, 70 secs
lola: 10531788 markings, 47945582 edges, 110308 markings/sec, 75 secs
lola: 11085669 markings, 50536695 edges, 110776 markings/sec, 80 secs
lola: 11655250 markings, 53203333 edges, 113916 markings/sec, 85 secs
lola: 12255348 markings, 56000906 edges, 120020 markings/sec, 90 secs
lola: 12849898 markings, 58775668 edges, 118910 markings/sec, 95 secs
lola: 13427677 markings, 61486266 edges, 115556 markings/sec, 100 secs
lola: 14022735 markings, 64270444 edges, 119012 markings/sec, 105 secs
lola: 14621124 markings, 67074137 edges, 119678 markings/sec, 110 secs
lola: 15224459 markings, 69887860 edges, 120667 markings/sec, 115 secs
lola: 15812838 markings, 72663000 edges, 117676 markings/sec, 120 secs
lola: 16405623 markings, 75446126 edges, 118557 markings/sec, 125 secs
lola: 16988098 markings, 78193578 edges, 116495 markings/sec, 130 secs
lola: 17571723 markings, 80948542 edges, 116725 markings/sec, 135 secs
lola: 18154935 markings, 83704531 edges, 116642 markings/sec, 140 secs
lola: 18741346 markings, 86471862 edges, 117282 markings/sec, 145 secs
lola: 19323557 markings, 89226683 edges, 116442 markings/sec, 150 secs
lola: 19897643 markings, 91941766 edges, 114817 markings/sec, 155 secs
lola: 20402014 markings, 94321058 edges, 100874 markings/sec, 160 secs
lola: 20953533 markings, 96919784 edges, 110304 markings/sec, 165 secs
lola: 21539860 markings, 99697655 edges, 117265 markings/sec, 170 secs
lola: 22122444 markings, 102452055 edges, 116517 markings/sec, 175 secs
lola: 22710926 markings, 105239951 edges, 117696 markings/sec, 180 secs
lola: 23288481 markings, 107989247 edges, 115511 markings/sec, 185 secs
lola: 23876936 markings, 110781021 edges, 117691 markings/sec, 190 secs
lola: 24464741 markings, 113562291 edges, 117561 markings/sec, 195 secs
lola: 25052316 markings, 116340367 edges, 117515 markings/sec, 200 secs
lola: 25635130 markings, 119103220 edges, 116563 markings/sec, 205 secs
lola: 26215728 markings, 121855638 edges, 116120 markings/sec, 210 secs
lola: 26796486 markings, 124612925 edges, 116152 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((Cabins <= 1)) U A (F ((1 <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((Cabins <= 1)) U A(TRUE U (1 <= WaitBag)))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((Entered <= Undress) U (1 <= WaitBag))) OR NOT(A (G ((2 <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Undress + 1 <= Entered) R (WaitBag <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((Entered <= Undress) U (1 <= WaitBag)))
lola: processed formula length: 45
lola: 14 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Cabins)))
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 24 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: state equation: write sara problem file to SwimmingPool-PT-10-CTLCardinality-3.sara
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((() U A (G ((3 <= Bags)))))
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 (Bags <= 2))))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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).
sara: try reading problem file SwimmingPool-PT-10-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: 1391337 markings, 4546936 edges, 2025528017270341632 markings/sec, 0 secs
lola: 2098912 markings, 8215909 edges, 141515 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((3 <= Out))) U (1 <= Dressed)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((3 <= Out)) U (1 <= Dressed))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= Entered) U (WaitBag <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= Entered) U (WaitBag <= Undress)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((Cabins + 1 <= WaitBag) OR (Bags + 1 <= Cabins) OR ((InBath <= 0) AND (InBath + 1 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((Cabins + 1 <= WaitBag) OR (Bags + 1 <= Cabins) OR ((InBath <= 0) AND (InBath + 1 <= Undress))))
lola: processed formula length: 108
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Out <= 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 24 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 SwimmingPool-PT-10-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: lola: state equation: calling and running sara
produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Undress + 1 <= Bags)))))
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 (Bags <= Undress))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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).
sara: try reading problem file SwimmingPool-PT-10-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: 811648 markings, 2865205 edges, 2199487249458921472 markings/sec, 0 secs
lola: 1567488 markings, 5572252 edges, 151168 markings/sec, 5 secs
lola: 2305520 markings, 8213202 edges, 147606 markings/sec, 10 secs
lola: 3043956 markings, 10860817 edges, 147687 markings/sec, 15 secs
lola: 3766025 markings, 13458385 edges, 144414 markings/sec, 20 secs
lola: 4491448 markings, 16060356 edges, 145085 markings/sec, 25 secs
lola: 5213679 markings, 18652142 edges, 144446 markings/sec, 30 secs
lola: 5935682 markings, 21234137 edges, 144401 markings/sec, 35 secs
lola: 6653066 markings, 23802457 edges, 143477 markings/sec, 40 secs
lola: 7376462 markings, 26386148 edges, 144679 markings/sec, 45 secs
lola: 8098618 markings, 28972746 edges, 144431 markings/sec, 50 secs
lola: 8815762 markings, 31543317 edges, 143429 markings/sec, 55 secs
lola: 9546993 markings, 34142750 edges, 146246 markings/sec, 60 secs
lola: 10281564 markings, 36749762 edges, 146914 markings/sec, 65 secs
lola: 11008841 markings, 39344432 edges, 145455 markings/sec, 70 secs
lola: 11725656 markings, 41912380 edges, 143363 markings/sec, 75 secs
lola: 12474706 markings, 44548269 edges, 149810 markings/sec, 80 secs
lola: 13206920 markings, 47149750 edges, 146443 markings/sec, 85 secs
lola: 13944222 markings, 49768589 edges, 147460 markings/sec, 90 secs
lola: 14684311 markings, 52397444 edges, 148018 markings/sec, 95 secs
lola: 15429411 markings, 55041132 edges, 149020 markings/sec, 100 secs
lola: 16142968 markings, 57549496 edges, 142711 markings/sec, 105 secs
lola: 16865437 markings, 60080964 edges, 144494 markings/sec, 110 secs
lola: 17589135 markings, 62611820 edges, 144740 markings/sec, 115 secs
lola: 18312713 markings, 65167831 edges, 144716 markings/sec, 120 secs
lola: 19046434 markings, 67733014 edges, 146744 markings/sec, 125 secs
lola: 19801365 markings, 70373422 edges, 150986 markings/sec, 130 secs
lola: 20554169 markings, 73007852 edges, 150561 markings/sec, 135 secs
lola: 21309222 markings, 75639061 edges, 151011 markings/sec, 140 secs
lola: 22070701 markings, 78280048 edges, 152296 markings/sec, 145 secs
lola: 22818028 markings, 80891250 edges, 149465 markings/sec, 150 secs
lola: 23594257 markings, 83562669 edges, 155246 markings/sec, 155 secs
lola: 24358571 markings, 86211248 edges, 152863 markings/sec, 160 secs
lola: 25131533 markings, 88851988 edges, 154592 markings/sec, 165 secs
lola: 25896971 markings, 91504959 edges, 153088 markings/sec, 170 secs
lola: 26672927 markings, 94174526 edges, 155191 markings/sec, 175 secs
lola: 27464807 markings, 96877602 edges, 158376 markings/sec, 180 secs
lola: 28259208 markings, 99594143 edges, 158880 markings/sec, 185 secs
lola: 29055633 markings, 102309972 edges, 159285 markings/sec, 190 secs
lola: 29885668 markings, 105088140 edges, 166007 markings/sec, 195 secs
lola: 30668598 markings, 107770462 edges, 156586 markings/sec, 200 secs
lola: 31492392 markings, 110539969 edges, 164759 markings/sec, 205 secs
lola: 32311334 markings, 113295836 edges, 163788 markings/sec, 210 secs
lola: 33118356 markings, 116025930 edges, 161404 markings/sec, 215 secs
lola: 33950624 markings, 118802229 edges, 166454 markings/sec, 220 secs
lola: 34755850 markings, 121528052 edges, 161045 markings/sec, 225 secs
lola: 35601509 markings, 124330740 edges, 169132 markings/sec, 230 secs
lola: 36431413 markings, 127101442 edges, 165981 markings/sec, 235 secs
lola: 37276639 markings, 129901725 edges, 169045 markings/sec, 240 secs
lola: 38118362 markings, 132691119 edges, 168345 markings/sec, 245 secs
lola: 38964513 markings, 135487634 edges, 169230 markings/sec, 250 secs
lola: 39831631 markings, 138329096 edges, 173424 markings/sec, 255 secs
lola: 40683376 markings, 141136256 edges, 170349 markings/sec, 260 secs
lola: 41547670 markings, 143969286 edges, 172859 markings/sec, 265 secs
lola: 42417069 markings, 146814217 edges, 173880 markings/sec, 270 secs
lola: 43291097 markings, 149669279 edges, 174806 markings/sec, 275 secs
lola: 44177461 markings, 152547638 edges, 177273 markings/sec, 280 secs
lola: 45061426 markings, 155420662 edges, 176793 markings/sec, 285 secs
lola: 45956067 markings, 158315154 edges, 178928 markings/sec, 290 secs
lola: 46862696 markings, 161227525 edges, 181326 markings/sec, 295 secs
lola: 47764572 markings, 164136982 edges, 180375 markings/sec, 300 secs
lola: 48683179 markings, 167082938 edges, 183721 markings/sec, 305 secs
lola: 49603712 markings, 170034228 edges, 184107 markings/sec, 310 secs
lola: 50529690 markings, 172996751 edges, 185196 markings/sec, 315 secs
lola: 51477436 markings, 176079282 edges, 189549 markings/sec, 320 secs
lola: 51505246 markings, 179131796 edges, 5562 markings/sec, 325 secs
lola: 51515907 markings, 181954642 edges, 2132 markings/sec, 330 secs
lola: 51521810 markings, 184698999 edges, 1181 markings/sec, 335 secs
lola: 51525459 markings, 187401059 edges, 730 markings/sec, 340 secs
lola: 51528134 markings, 190080587 edges, 535 markings/sec, 345 secs
lola: 51530324 markings, 192756132 edges, 438 markings/sec, 350 secs
lola: 51532169 markings, 195412220 edges, 369 markings/sec, 355 secs
lola: 51533890 markings, 198053094 edges, 344 markings/sec, 360 secs
lola: 51535349 markings, 200697767 edges, 292 markings/sec, 365 secs
lola: 51536715 markings, 203354131 edges, 273 markings/sec, 370 secs
lola: 51537954 markings, 205996110 edges, 248 markings/sec, 375 secs
lola: 51539029 markings, 208684309 edges, 215 markings/sec, 380 secs
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 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= Bags) AND (1 <= Out) AND (Out <= InBath) AND (Dress <= Dressed)))) OR (((Entered + 1 <= InBath) AND (InBath + 1 <= Dressed) AND (Undress <= Cabins)) AND E (((3 <= Bags) U (Dress <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Bags) AND (1 <= Out) AND (Out <= InBath) AND (Dress <= Dressed))))
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 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: state equation: write sara problem file to SwimmingPool-PT-10-CTLCardinality-9.sara
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: lola: ...considering subproblem: A (F (E (F ((Out <= WaitBag)))))
lola: state equation: calling and running sara
========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Out <= WaitBag)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: sara: produced by: CTL model checkertry reading problem file SwimmingPool-PT-10-CTLCardinality-9.sara.

lola: The net satisfies the given formula.
lola: ========================================
sara: place or transition ordering is non-deterministiclola:
subprocess 11 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((3 <= Dressed) OR (E (F ((1 <= Undress))) AND A (F ((1 <= Dressed))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Dressed <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= 2)
lola: processed formula length: 14
lola: 9 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola:
produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Undress <= 0)))
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 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to SwimmingPool-PT-10-CTLCardinality-12.sara
lola: subprocess 13 will run for 972 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((Dressed <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= Dressed)))
lola: processed formula length: 29
lola: lola: 11 rewrites
lola: ========================================
formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: state equation: calling and running sara
sara: try reading problem file SwimmingPool-PT-10-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

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 12 will run for 729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Cabins <= Out) AND (InBath + 1 <= Out))))
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 24 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to SwimmingPool-PT-10-CTLCardinality-12.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 972 seconds at most (--localtimelimit=-1)
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: E ((((WaitBag + 1 <= Dressed) OR (WaitBag + 1 <= Dressed)) U E (G ((Dress <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((WaitBag + 1 <= Dressed) OR (WaitBag + 1 <= Dressed)) U NOT(A(TRUE U (Dressed + 1 <= Dress))))
lola: processed formula length: 98
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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).
sara: try reading problem file SwimmingPool-PT-10-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Undress <= 0) AND A (G (TRUE))) AND (WaitBag <= Entered))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Undress <= 0) AND (WaitBag <= Entered))
lola: processed formula length: 41
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2918 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((Bags + 1 <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Bags + 1 <= Cabins)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 1806928 markings, 3911450 edges, 3225412962034384896 markings/sec, 0 secs
lola: 3351517 markings, 7410284 edges, 308918 markings/sec, 5 secs
lola: 4806282 markings, 10759523 edges, 290953 markings/sec, 10 secs
lola: 6210719 markings, 14024793 edges, 280887 markings/sec, 15 secs
lola: 7580048 markings, 17215453 edges, 273866 markings/sec, 20 secs
lola: 8909609 markings, 20331657 edges, 265912 markings/sec, 25 secs
lola: 10216383 markings, 23402825 edges, 261355 markings/sec, 30 secs
lola: 11489645 markings, 26410219 edges, 254652 markings/sec, 35 secs
lola: 12741865 markings, 29374500 edges, 250444 markings/sec, 40 secs
lola: 13985725 markings, 32327121 edges, 248772 markings/sec, 45 secs
lola: 15220316 markings, 35258351 edges, 246918 markings/sec, 50 secs
lola: 16457788 markings, 38208673 edges, 247494 markings/sec, 55 secs
lola: 17673786 markings, 41109890 edges, 243200 markings/sec, 60 secs
lola: 18874553 markings, 43974641 edges, 240153 markings/sec, 65 secs
lola: 20077572 markings, 46852086 edges, 240604 markings/sec, 70 secs
lola: 21273851 markings, 49716172 edges, 239256 markings/sec, 75 secs
lola: 22457243 markings, 52548759 edges, 236678 markings/sec, 80 secs
lola: 23633523 markings, 55373972 edges, 235256 markings/sec, 85 secs
lola: 24805951 markings, 58188494 edges, 234486 markings/sec, 90 secs
lola: 25980214 markings, 61012523 edges, 234853 markings/sec, 95 secs
lola: 27151648 markings, 63832460 edges, 234287 markings/sec, 100 secs
lola: 28314569 markings, 66627254 edges, 232584 markings/sec, 105 secs
lola: 29478202 markings, 69427284 edges, 232727 markings/sec, 110 secs
lola: 30645641 markings, 72246723 edges, 233488 markings/sec, 115 secs
lola: 31804255 markings, 75045604 edges, 231723 markings/sec, 120 secs
lola: 32960215 markings, 77835215 edges, 231192 markings/sec, 125 secs
lola: 34113732 markings, 80620022 edges, 230703 markings/sec, 130 secs
lola: 35267292 markings, 83409700 edges, 230712 markings/sec, 135 secs
lola: 36415802 markings, 86180228 edges, 229702 markings/sec, 140 secs
lola: 37556289 markings, 88938376 edges, 228097 markings/sec, 145 secs
lola: 38702745 markings, 91714096 edges, 229291 markings/sec, 150 secs
lola: 39849555 markings, 94490654 edges, 229362 markings/sec, 155 secs
lola: 40998260 markings, 97277775 edges, 229741 markings/sec, 160 secs
lola: 42147829 markings, 100060652 edges, 229914 markings/sec, 165 secs
lola: 43296588 markings, 102842962 edges, 229752 markings/sec, 170 secs
lola: 44440280 markings, 105615380 edges, 228738 markings/sec, 175 secs
lola: 45578996 markings, 108379533 edges, 227743 markings/sec, 180 secs
lola: 46687220 markings, 111067683 edges, 221645 markings/sec, 185 secs
lola: 47815060 markings, 113806248 edges, 225568 markings/sec, 190 secs
lola: 48928505 markings, 116517650 edges, 222689 markings/sec, 195 secs
lola: 50044300 markings, 119225002 edges, 223159 markings/sec, 200 secs
lola: 51162280 markings, 121943040 edges, 223596 markings/sec, 205 secs
lola: 52288697 markings, 124686141 edges, 225283 markings/sec, 210 secs
lola: 53407117 markings, 127401227 edges, 223684 markings/sec, 215 secs
lola: 54526292 markings, 130126923 edges, 223835 markings/sec, 220 secs
lola: 55648637 markings, 132856418 edges, 224469 markings/sec, 225 secs
lola: 56765554 markings, 135573151 edges, 223383 markings/sec, 230 secs
lola: 57876515 markings, 138275872 edges, 222192 markings/sec, 235 secs
lola: 58983054 markings, 140971361 edges, 221308 markings/sec, 240 secs
lola: 60105710 markings, 143707648 edges, 224531 markings/sec, 245 secs
lola: 61212772 markings, 146403996 edges, 221412 markings/sec, 250 secs
lola: 62326039 markings, 149119523 edges, 222653 markings/sec, 255 secs
lola: 63436953 markings, 151828924 edges, 222183 markings/sec, 260 secs
lola: 64553750 markings, 154551505 edges, 223359 markings/sec, 265 secs
lola: 65668382 markings, 157268442 edges, 222926 markings/sec, 270 secs
lola: 66776468 markings, 159967752 edges, 221617 markings/sec, 275 secs
lola: 67892264 markings, 162688100 edges, 223159 markings/sec, 280 secs
lola: 69006993 markings, 165412590 edges, 222946 markings/sec, 285 secs
lola: 70124950 markings, 168140971 edges, 223591 markings/sec, 290 secs
lola: 71232306 markings, 170837096 edges, 221471 markings/sec, 295 secs
lola: 72297255 markings, 173434302 edges, 212990 markings/sec, 300 secs
lola: 73404474 markings, 176137571 edges, 221444 markings/sec, 305 secs
lola: 74510723 markings, 178838168 edges, 221250 markings/sec, 310 secs
lola: 75615180 markings, 181533822 edges, 220891 markings/sec, 315 secs
lola: 76736627 markings, 184273043 edges, 224289 markings/sec, 320 secs
lola: 77849521 markings, 186993245 edges, 222579 markings/sec, 325 secs
lola: 78961170 markings, 189709991 edges, 222330 markings/sec, 330 secs
lola: 80054449 markings, 192378527 edges, 218656 markings/sec, 335 secs
lola: 81154933 markings, 195063574 edges, 220097 markings/sec, 340 secs
lola: 82251592 markings, 197747140 edges, 219332 markings/sec, 345 secs
lola: 83336006 markings, 200396507 edges, 216883 markings/sec, 350 secs
lola: 84428122 markings, 203068257 edges, 218423 markings/sec, 355 secs
lola: 85511253 markings, 205714040 edges, 216626 markings/sec, 360 secs
lola: 86599264 markings, 208372607 edges, 217602 markings/sec, 365 secs
lola: 87675480 markings, 211006789 edges, 215243 markings/sec, 370 secs
lola: 88761709 markings, 213665889 edges, 217246 markings/sec, 375 secs
lola: 89844989 markings, 216316203 edges, 216656 markings/sec, 380 secs
lola: 90926857 markings, 218957248 edges, 216374 markings/sec, 385 secs
lola: 92017122 markings, 221617789 edges, 218053 markings/sec, 390 secs
lola: 93102561 markings, 224273868 edges, 217088 markings/sec, 395 secs
lola: 94195004 markings, 226948541 edges, 218489 markings/sec, 400 secs
lola: 95281939 markings, 229607697 edges, 217387 markings/sec, 405 secs
lola: 96371260 markings, 232270039 edges, 217864 markings/sec, 410 secs
lola: 97463422 markings, 234941497 edges, 218432 markings/sec, 415 secs
lola: 98558537 markings, 237619284 edges, 219023 markings/sec, 420 secs
lola: 99637874 markings, 240258191 edges, 215867 markings/sec, 425 secs
lola: 100728573 markings, 242924814 edges, 218140 markings/sec, 430 secs
lola: 101814934 markings, 245582479 edges, 217272 markings/sec, 435 secs
lola: 102908692 markings, 248258672 edges, 218752 markings/sec, 440 secs
lola: 103982421 markings, 250884920 edges, 214746 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes no no no no yes yes no yes yes no no no yes unknown
FORMULA SwimmingPool-PT-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496565663915

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_SwimmingPool-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/S_SwimmingPool-PT-10.tgz
mv S_SwimmingPool-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SwimmingPool-PT-10, 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 r158-ebro-149443464100192"
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 ;