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)
.....................
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is SwimmingPool-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-152705514200269
=====================================================================

--------------------
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-09-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527076439940


BK_STOP 1527077447275

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SwimmingPool-PT-09 as instance name.
Using SwimmingPool as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 559272, 'Memory': 5391.98, 'Tool': 'lola'}, {'Time': 559594, 'Memory': 5392.56, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SwimmingPool-PT-09...

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


checking for too many tokens
===========================================================================================
SwimmingPool-PT-09: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ SwimmingPool-PT-09 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-09-CTLCardinality.task
lola: NOT(A (G (E (F ((1 <= Undress)))))) : A (G ((1 <= Bags))) : (((E (G ((Out <= Cabins))) AND A (F ((Undress <= WaitBag)))) AND E (G (((1 <= Cabins) AND (3 <= WaitBag))))) OR A (G (E (F (TRUE))))) : (A (X (A (F ((Out <= Entered))))) OR E (F (((Out <= 2) AND (Bags <= 2))))) : A (X (NOT(E (G ((Undress <= Dressed)))))) : A (G ((WaitBag <= Cabins))) : E (X (E (((3 <= Out) U (Cabins <= InBath))))) : NOT(A (G ((3 <= Bags)))) : E (G (((1 <= InBath) OR ((Dress <= Out) AND (WaitBag <= Entered) AND (WaitBag <= Dress))))) : ((A (F ((1 <= WaitBag))) AND (3 <= Out)) OR E (X ((((3 <= Undress) AND (3 <= Dress)) OR ((2 <= Undress) AND (3 <= InBath)))))) : E (((3 <= Out) U A (G ((2 <= Cabins))))) : A (G ((3 <= Cabins))) : (A (X (E (F ((Bags <= Cabins))))) OR E (X ((Cabins <= WaitBag)))) : A (G ((3 <= Bags))) : ((((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered)) OR E (F (((Bags <= 1))))) : (A (G ((((1 <= Dressed) AND (2 <= Dressed)) OR (1 <= Bags)))) OR E (X ((1 <= Undress))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((1 <= Undress))))))
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 (1 <= Undress))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 1676160 markings, 4637519 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Bags)))
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: 451 markings, 450 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((Out <= Cabins))) AND A (F ((Undress <= WaitBag)))) AND E (G (((1 <= Cabins) AND (3 <= WaitBag))))) OR A (G (E (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((Out <= Entered))))) OR E (F (((Out <= 2) AND (Bags <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((Out <= Entered)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (Out <= Entered)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 501 markings, 501 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Out <= 2) AND (Bags <= 2))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 488 markings, 487 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((Undress <= Dressed))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (Dressed + 1 <= Undress)))
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24570 markings, 36674 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((WaitBag <= 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: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 93 markings, 92 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((3 <= Out) U (Cabins <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((3 <= Out) U (Cabins <= InBath)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 357 markings, 356 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((3 <= Bags))))
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-09-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 443 markings, 442 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= InBath) OR ((Dress <= Out) AND (WaitBag <= Entered) AND (WaitBag <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((InBath <= 0) AND ((Out + 1 <= Dress) OR (Entered + 1 <= WaitBag) OR (Dress + 1 <= WaitBag)))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 361 markings, 360 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((1 <= WaitBag))) AND (3 <= Out)) OR E (X ((((3 <= Undress) AND (3 <= Dress)) OR ((2 <= Undress) AND (3 <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 182 markings, 181 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= Out)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Out)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= Out) U A (G ((2 <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= Out) U NOT(E(TRUE U (Cabins <= 1))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 1170744 markings, 4353934 edges, 1996758058579001344 markings/sec, 0 secs
lola: 2413290 markings, 9031566 edges, 248509 markings/sec, 5 secs
lola: 3607830 markings, 13541832 edges, 238908 markings/sec, 10 secs
lola: 4775372 markings, 17948851 edges, 233508 markings/sec, 15 secs
lola: 5937213 markings, 22344674 edges, 232368 markings/sec, 20 secs
lola: 7088252 markings, 26698368 edges, 230208 markings/sec, 25 secs
lola: 8232115 markings, 31033512 edges, 228773 markings/sec, 30 secs
lola: 9371959 markings, 35343781 edges, 227969 markings/sec, 35 secs
lola: 10505471 markings, 39642590 edges, 226702 markings/sec, 40 secs
lola: 11633377 markings, 43911287 edges, 225581 markings/sec, 45 secs
lola: 12756257 markings, 48166334 edges, 224576 markings/sec, 50 secs
lola: 13879251 markings, 52422893 edges, 224599 markings/sec, 55 secs
lola: 14991979 markings, 56636583 edges, 222546 markings/sec, 60 secs
lola: 16109221 markings, 60870140 edges, 223448 markings/sec, 65 secs
lola: 17219679 markings, 65072979 edges, 222092 markings/sec, 70 secs
lola: 18311866 markings, 69206545 edges, 218437 markings/sec, 75 secs
lola: 19402418 markings, 73337182 edges, 218110 markings/sec, 80 secs
lola: 20490472 markings, 77458257 edges, 217611 markings/sec, 85 secs
lola: 21584588 markings, 81603644 edges, 218823 markings/sec, 90 secs
lola: 22682557 markings, 85754989 edges, 219594 markings/sec, 95 secs
lola: 23775331 markings, 89897508 edges, 218555 markings/sec, 100 secs
lola: 24866800 markings, 94024459 edges, 218294 markings/sec, 105 secs
lola: 25953571 markings, 98138275 edges, 217354 markings/sec, 110 secs
lola: 27043906 markings, 102264997 edges, 218067 markings/sec, 115 secs
lola: 28133965 markings, 106386764 edges, 218012 markings/sec, 120 secs
lola: 29219455 markings, 110495081 edges, 217098 markings/sec, 125 secs
lola: 30302942 markings, 114589770 edges, 216697 markings/sec, 130 secs
lola: 31385624 markings, 118678191 edges, 216536 markings/sec, 135 secs
lola: 32466082 markings, 122765022 edges, 216092 markings/sec, 140 secs
lola: 33549530 markings, 126861115 edges, 216690 markings/sec, 145 secs
lola: 34628192 markings, 130940617 edges, 215732 markings/sec, 150 secs
lola: 35695749 markings, 134975154 edges, 213511 markings/sec, 155 secs
lola: 36750228 markings, 138959556 edges, 210896 markings/sec, 160 secs
lola: 37797405 markings, 142915328 edges, 209435 markings/sec, 165 secs
lola: 38844217 markings, 146873133 edges, 209362 markings/sec, 170 secs
lola: 39885889 markings, 150807030 edges, 208334 markings/sec, 175 secs
lola: 40921995 markings, 154724849 edges, 207221 markings/sec, 180 secs
lola: 41955047 markings, 158625757 edges, 206610 markings/sec, 185 secs
lola: 42986291 markings, 162518248 edges, 206249 markings/sec, 190 secs
lola: 44017158 markings, 166417118 edges, 206173 markings/sec, 195 secs
lola: 45044522 markings, 170297397 edges, 205473 markings/sec, 200 secs
lola: 46070528 markings, 174169392 edges, 205201 markings/sec, 205 secs
lola: 47091967 markings, 178023280 edges, 204288 markings/sec, 210 secs
lola: 48117204 markings, 181894906 edges, 205047 markings/sec, 215 secs
lola: 49138597 markings, 185751335 edges, 204279 markings/sec, 220 secs
lola: 50162827 markings, 189615890 edges, 204846 markings/sec, 225 secs
lola: 51179769 markings, 193456052 edges, 203388 markings/sec, 230 secs
lola: 52160571 markings, 197158131 edges, 196160 markings/sec, 235 secs
lola: 53255499 markings, 201282158 edges, 218986 markings/sec, 240 secs
lola: 54355691 markings, 205429964 edges, 220038 markings/sec, 245 secs
lola: 55455484 markings, 209574682 edges, 219959 markings/sec, 250 secs
lola: 56557032 markings, 213723961 edges, 220310 markings/sec, 255 secs
lola: 57664526 markings, 217890837 edges, 221499 markings/sec, 260 secs
lola: 58768193 markings, 222045783 edges, 220733 markings/sec, 265 secs
lola: 59873913 markings, 226202449 edges, 221144 markings/sec, 270 secs
lola: 60982097 markings, 230364360 edges, 221637 markings/sec, 275 secs
lola: 62089396 markings, 234522393 edges, 221460 markings/sec, 280 secs
lola: 63196079 markings, 238679197 edges, 221337 markings/sec, 285 secs
lola: 64305722 markings, 242841051 edges, 221929 markings/sec, 290 secs
lola: 65419243 markings, 247006506 edges, 222704 markings/sec, 295 secs
lola: 66532377 markings, 251171580 edges, 222627 markings/sec, 300 secs
lola: 67652898 markings, 255356123 edges, 224104 markings/sec, 305 secs
lola: 68774962 markings, 259533456 edges, 224413 markings/sec, 310 secs
lola: 69892740 markings, 263684981 edges, 223556 markings/sec, 315 secs
lola: 71000319 markings, 267784030 edges, 221516 markings/sec, 320 secs
lola: 72131347 markings, 271930655 edges, 226206 markings/sec, 325 secs
lola: 73207112 markings, 276493005 edges, 215153 markings/sec, 330 secs
lola: 73885279 markings, 281461949 edges, 135633 markings/sec, 335 secs
lola: 74592662 markings, 286285519 edges, 141477 markings/sec, 340 secs
lola: 75311954 markings, 291067017 edges, 143858 markings/sec, 345 secs
lola: 76003303 markings, 295601279 edges, 138270 markings/sec, 350 secs
lola: 76600713 markings, 299481531 edges, 119482 markings/sec, 355 secs
lola: 77209208 markings, 303400482 edges, 121699 markings/sec, 360 secs
lola: 77840806 markings, 307440598 edges, 126320 markings/sec, 365 secs
lola: 78478403 markings, 311506132 edges, 127519 markings/sec, 370 secs
lola: 79121124 markings, 315587834 edges, 128544 markings/sec, 375 secs
lola: 79771156 markings, 319708568 edges, 130006 markings/sec, 380 secs
lola: 80426760 markings, 323855740 edges, 131121 markings/sec, 385 secs
lola: 81091519 markings, 328056009 edges, 132952 markings/sec, 390 secs
lola: 81783672 markings, 332430486 edges, 138431 markings/sec, 395 secs
lola: 82534008 markings, 337170460 edges, 150067 markings/sec, 400 secs
lola: 83291969 markings, 341957417 edges, 151592 markings/sec, 405 secs
lola: 84059331 markings, 346803525 edges, 153472 markings/sec, 410 secs
lola: 84830026 markings, 351669846 edges, 154139 markings/sec, 415 secs
lola: 85605833 markings, 356568765 edges, 155161 markings/sec, 420 secs
lola: 86391559 markings, 361527891 edges, 157145 markings/sec, 425 secs
lola: 87187536 markings, 366550242 edges, 159195 markings/sec, 430 secs
lola: 87997583 markings, 371654127 edges, 162009 markings/sec, 435 secs
lola: 88831524 markings, 376901525 edges, 166788 markings/sec, 440 secs
lola: 89721636 markings, 382488054 edges, 178022 markings/sec, 445 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 89885381 markings, 383503003 edges
lola: ========================================
lola: subprocess 11 will run for 616 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-11.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: 177 markings, 176 edges
lola: ========================================
lola: subprocess 12 will run for 770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((Bags <= Cabins))))) OR E (X ((Cabins <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((Bags <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (Bags <= Cabins)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 1832697 markings, 5082527 edges, 2851541625195200512 markings/sec, 0 secs
lola: 3365293 markings, 9778661 edges, 306519 markings/sec, 5 secs
lola: 4761461 markings, 14173112 edges, 279234 markings/sec, 10 secs
lola: 6068779 markings, 18367310 edges, 261464 markings/sec, 15 secs
lola: 7322283 markings, 22425219 edges, 250701 markings/sec, 20 secs
lola: 8533922 markings, 26361686 edges, 242328 markings/sec, 25 secs
lola: 9720583 markings, 30262059 edges, 237332 markings/sec, 30 secs
lola: 10889520 markings, 34117294 edges, 233787 markings/sec, 35 secs
lola: 12011667 markings, 37842254 edges, 224429 markings/sec, 40 secs
lola: 13126867 markings, 41551819 edges, 223040 markings/sec, 45 secs
lola: 14228866 markings, 45246870 edges, 220400 markings/sec, 50 secs
lola: 15316361 markings, 48908335 edges, 217499 markings/sec, 55 secs
lola: 16394702 markings, 52522622 edges, 215668 markings/sec, 60 secs
lola: 17439532 markings, 56052696 edges, 208966 markings/sec, 65 secs
lola: 18471345 markings, 59538750 edges, 206363 markings/sec, 70 secs
lola: 19490958 markings, 62984515 edges, 203923 markings/sec, 75 secs
lola: 20489413 markings, 66386783 edges, 199691 markings/sec, 80 secs
lola: 21486136 markings, 69767138 edges, 199345 markings/sec, 85 secs
lola: 22463170 markings, 73100069 edges, 195407 markings/sec, 90 secs
lola: 23431252 markings, 76412992 edges, 193616 markings/sec, 95 secs
lola: 24390706 markings, 79699047 edges, 191891 markings/sec, 100 secs
lola: 25338260 markings, 82957932 edges, 189511 markings/sec, 105 secs
lola: 26284648 markings, 86202358 edges, 189278 markings/sec, 110 secs
lola: 27210661 markings, 89401809 edges, 185203 markings/sec, 115 secs
lola: 28124331 markings, 92570640 edges, 182734 markings/sec, 120 secs
lola: 29041233 markings, 95739523 edges, 183380 markings/sec, 125 secs
lola: 29946725 markings, 98877896 edges, 181098 markings/sec, 130 secs
lola: 30845083 markings, 101989932 edges, 179672 markings/sec, 135 secs
lola: 31738717 markings, 105084974 edges, 178727 markings/sec, 140 secs
lola: 32635287 markings, 108181410 edges, 179314 markings/sec, 145 secs
lola: 33525391 markings, 111259379 edges, 178021 markings/sec, 150 secs
lola: 34409831 markings, 114324489 edges, 176888 markings/sec, 155 secs
lola: 35288145 markings, 117375278 edges, 175663 markings/sec, 160 secs
lola: 36133490 markings, 120313210 edges, 169069 markings/sec, 165 secs
lola: 36997421 markings, 123319102 edges, 172786 markings/sec, 170 secs
lola: 37835078 markings, 126235841 edges, 167531 markings/sec, 175 secs
lola: 38693477 markings, 129232838 edges, 171680 markings/sec, 180 secs
lola: 39555318 markings, 132227958 edges, 172368 markings/sec, 185 secs
lola: 40413610 markings, 135219841 edges, 171658 markings/sec, 190 secs
lola: 41262653 markings, 138192588 edges, 169809 markings/sec, 195 secs
lola: 42118482 markings, 141175787 edges, 171166 markings/sec, 200 secs
lola: 42983427 markings, 144185491 edges, 172989 markings/sec, 205 secs
lola: 43840995 markings, 147179675 edges, 171514 markings/sec, 210 secs
lola: 44704804 markings, 150192112 edges, 172762 markings/sec, 215 secs
lola: 45565815 markings, 153203041 edges, 172202 markings/sec, 220 secs
lola: 46422208 markings, 156212006 edges, 171279 markings/sec, 225 secs
lola: 47240374 markings, 159083192 edges, 163633 markings/sec, 230 secs
lola: 48085146 markings, 162038503 edges, 168954 markings/sec, 235 secs
lola: 48953707 markings, 165076732 edges, 173712 markings/sec, 240 secs
lola: 49816152 markings, 168095653 edges, 172489 markings/sec, 245 secs
lola: 50663058 markings, 171064189 edges, 169381 markings/sec, 250 secs
lola: 51530241 markings, 174120203 edges, 173437 markings/sec, 255 secs
lola: 52410482 markings, 177202454 edges, 176048 markings/sec, 260 secs
lola: 53287133 markings, 180279294 edges, 175330 markings/sec, 265 secs
lola: 54157890 markings, 183340845 edges, 174151 markings/sec, 270 secs
lola: 55031362 markings, 186408980 edges, 174694 markings/sec, 275 secs
lola: 55907888 markings, 189484777 edges, 175305 markings/sec, 280 secs
lola: 56771099 markings, 192531328 edges, 172642 markings/sec, 285 secs
lola: 57637134 markings, 195583820 edges, 173207 markings/sec, 290 secs
lola: 58507314 markings, 198640056 edges, 174036 markings/sec, 295 secs
lola: 59373165 markings, 201691093 edges, 173170 markings/sec, 300 secs
lola: 60239086 markings, 204747977 edges, 173184 markings/sec, 305 secs
lola: 60969565 markings, 207324892 edges, 146096 markings/sec, 310 secs
lola: 61793558 markings, 210234819 edges, 164799 markings/sec, 315 secs
lola: 62644072 markings, 213237457 edges, 170103 markings/sec, 320 secs
lola: 63480325 markings, 216214837 edges, 167251 markings/sec, 325 secs
lola: 64313627 markings, 219176480 edges, 166660 markings/sec, 330 secs
lola: 65154301 markings, 222163887 edges, 168135 markings/sec, 335 secs
lola: 65994306 markings, 225145817 edges, 168001 markings/sec, 340 secs
lola: 66829149 markings, 228114999 edges, 166969 markings/sec, 345 secs
lola: 67654443 markings, 231060905 edges, 165059 markings/sec, 350 secs
lola: 68486283 markings, 234018141 edges, 166368 markings/sec, 355 secs
lola: 69327102 markings, 236998903 edges, 168164 markings/sec, 360 secs
lola: 70164073 markings, 239961114 edges, 167394 markings/sec, 365 secs
lola: 71000749 markings, 242933958 edges, 167335 markings/sec, 370 secs
lola: 71835310 markings, 245899699 edges, 166912 markings/sec, 375 secs
lola: 72673263 markings, 248870904 edges, 167591 markings/sec, 380 secs
lola: 73500254 markings, 251812055 edges, 165398 markings/sec, 385 secs
lola: 74326756 markings, 254761245 edges, 165300 markings/sec, 390 secs
lola: 75093432 markings, 257489247 edges, 153335 markings/sec, 395 secs
lola: 75906247 markings, 260398490 edges, 162563 markings/sec, 400 secs
lola: 76715605 markings, 263277771 edges, 161872 markings/sec, 405 secs
lola: 77504567 markings, 266085787 edges, 157792 markings/sec, 410 secs
lola: 78332469 markings, 269030030 edges, 165580 markings/sec, 415 secs
lola: 79155337 markings, 271960852 edges, 164574 markings/sec, 420 secs
lola: 79978704 markings, 274898526 edges, 164673 markings/sec, 425 secs
lola: 80791591 markings, 277805856 edges, 162577 markings/sec, 430 secs
lola: 81608497 markings, 280723046 edges, 163381 markings/sec, 435 secs
lola: 82438844 markings, 283675216 edges, 166069 markings/sec, 440 secs
lola: 83259527 markings, 286593653 edges, 164137 markings/sec, 445 secs
lola: 84081791 markings, 289527445 edges, 164453 markings/sec, 450 secs
lola: 84888898 markings, 292420725 edges, 161421 markings/sec, 455 secs
lola: 85701652 markings, 295324509 edges, 162551 markings/sec, 460 secs
lola: 86507948 markings, 298211998 edges, 161259 markings/sec, 465 secs
lola: 87325716 markings, 301124242 edges, 163554 markings/sec, 470 secs
lola: 88140175 markings, 304031116 edges, 162892 markings/sec, 475 secs
lola: 88954678 markings, 306945175 edges, 162901 markings/sec, 480 secs
lola: 89764559 markings, 309855454 edges, 161976 markings/sec, 485 secs
lola: 90310414 markings, 311802798 edges, 109171 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Bags)))
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: 443 markings, 442 edges
lola: ========================================
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered)) OR E (F (((Bags <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: processed formula with 4 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Bags <= 1))))
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-09-CTLCardinality-15.sara
lola: SUBRESULT
lola: lola: result: yesstate equation: calling and running sara

lola: produced by: state space
lola: The predicate is reachable.
lola: 447 markings, 446 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= Dressed) AND (2 <= Dressed)) OR (1 <= Bags)))) OR E (X ((1 <= Undress))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= Dressed) AND (2 <= Dressed)) OR (1 <= Bags))))
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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 451 markings, 450 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes no yes no no unknown no yes unknown
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA SwimmingPool-PT-09-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="SwimmingPool-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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/SwimmingPool-PT-09.tgz
mv SwimmingPool-PT-09 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is SwimmingPool-PT-09, 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 r162-smll-152705514200269"
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 ;