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 236K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K 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.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 79K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DES-PT-10b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385600220
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526535764322


BK_STOP 1526536550188

--------------------
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 DES-PT-10b as instance name.
Using DES 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': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 887564, 'Memory': 2207.61, 'Tool': 'lola'}, {'Time': 891369, 'Memory': 2227.37, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-10b...

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


checking for too many tokens
===========================================================================================
DES-PT-10b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-10b @ 3540 seconds
----- Start make result stderr -----
----- 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: 591/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 320 places, 271 transitions, 255 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-10b-CTLCardinality.task
lola: (A (G (((p232 <= 1) AND ((3 <= p204) OR (p137 <= p170))))) AND (p168 <= p45)) : E (G (((p239 <= 2) OR (p144 + 1 <= p238)))) : A (G (A (G (((p69 <= p105) OR (1 <= p43)))))) : NOT(E (F (E (X ((2 <= p293)))))) : NOT(E (F (A (X ((1 <= p75)))))) : NOT((NOT(E (X ((2 <= p315)))) AND A (G ((p258 <= 0))))) : NOT(NOT(E (G ((p300 <= p143))))) : ((2 <= p141) OR NOT(A (((p237 <= p272) U (2 <= p114))))) : E (G (((p33 <= 0) AND ((p108 <= 1) OR (p279 <= 1))))) : A (G (E (((p274 <= p21) U (1 <= p213))))) : A (F (NOT(A (F ((p36 <= p248)))))) : A (((p279 <= p315) U ((p145 + 1 <= p195) OR ((p28 <= p25) AND (1 <= p165))))) : A (G (A (F (((2 <= p144) AND (3 <= p221)))))) : (((E (G ((p268 <= p42))) OR ((p71 <= p49) OR (p40 <= p26) OR ((3 <= p133) AND (2 <= p254)))) AND ((p313 <= p180) AND (p264 <= p158) AND ((2 <= p104) OR (p101 <= p205)) AND (p208 <= p101) AND (3 <= p291) AND ((p55 <= p56) OR (3 <= p246)))) OR (E (G ((p257 <= p39))) OR (E (X ((2 <= p166))) AND (((p150 <= p185) AND (p92 <= p265)) OR ((p56 <= p204) AND (2 <= p135)))))) : ((p211 <= p88) AND E ((((p90 <= p262) AND (p31 <= p176)) U (p198 + 1 <= p181)))) : A (X (A (F ((p52 + 1 <= p268)))))
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 (((p232 <= 1) AND ((3 <= p204) OR (p137 <= p170))))) AND (p168 <= p45))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p232 <= 1) AND ((3 <= p204) OR (p137 <= p170)))))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p239 <= 2) OR (p144 + 1 <= p238))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= p239) AND (p238 <= p144))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (G (((p69 <= p105) OR (1 <= p43))))))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: state equation: write sara problem file to DES-PT-10b-CTLCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (X ((2 <= p293))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((p293 <= 1)))))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 586916 markings, 3176041 edges, 1880864585209085952 markings/sec, 0 secs
lola: 1099234 markings, 6410082 edges, 102464 markings/sec, 5 secs
lola: 1607398 markings, 9704397 edges, 101633 markings/sec, 10 secs
lola: 2119666 markings, 13037968 edges, 102454 markings/sec, 15 secs
lola: 2619622 markings, 16112721 edges, 99991 markings/sec, 20 secs
lola: 3078963 markings, 19254485 edges, 91868 markings/sec, 25 secs
lola: 3609800 markings, 22534664 edges, 106167 markings/sec, 30 secs
lola: 4104517 markings, 25856641 edges, 98943 markings/sec, 35 secs
lola: 4557837 markings, 29132888 edges, 90664 markings/sec, 40 secs
lola: 5047892 markings, 32349786 edges, 98011 markings/sec, 45 secs
lola: 5548172 markings, 35567624 edges, 100056 markings/sec, 50 secs
lola: 6035355 markings, 38837478 edges, 97437 markings/sec, 55 secs
lola: 6514942 markings, 41899644 edges, 95917 markings/sec, 60 secs
lola: 6981995 markings, 45048073 edges, 93411 markings/sec, 65 secs
lola: 7485041 markings, 48364592 edges, 100609 markings/sec, 70 secs
lola: 7899000 markings, 51572042 edges, 82792 markings/sec, 75 secs
lola: 8428316 markings, 54663615 edges, 105863 markings/sec, 80 secs
lola: 8906920 markings, 57860057 edges, 95721 markings/sec, 85 secs
lola: 9389948 markings, 61049095 edges, 96606 markings/sec, 90 secs
lola: 9855243 markings, 64105382 edges, 93059 markings/sec, 95 secs
lola: 10344273 markings, 67272691 edges, 97806 markings/sec, 100 secs
lola: 10818601 markings, 70535977 edges, 94866 markings/sec, 105 secs
lola: 11212013 markings, 73702883 edges, 78682 markings/sec, 110 secs
lola: 11559623 markings, 76686505 edges, 69522 markings/sec, 115 secs
lola: 11899781 markings, 79711048 edges, 68032 markings/sec, 120 secs
lola: 12223285 markings, 82641901 edges, 64701 markings/sec, 125 secs
lola: 12575018 markings, 85758987 edges, 70347 markings/sec, 130 secs
lola: 12867425 markings, 88851844 edges, 58481 markings/sec, 135 secs
lola: 13413679 markings, 91843820 edges, 109251 markings/sec, 140 secs
lola: 13900655 markings, 94854477 edges, 97395 markings/sec, 145 secs
lola: 14379609 markings, 97962893 edges, 95791 markings/sec, 150 secs
lola: 14858576 markings, 101096951 edges, 95793 markings/sec, 155 secs
lola: 15349378 markings, 104065852 edges, 98160 markings/sec, 160 secs
lola: 15774009 markings, 106939256 edges, 84926 markings/sec, 165 secs
lola: 16240677 markings, 110015840 edges, 93334 markings/sec, 170 secs
lola: 16741954 markings, 113172639 edges, 100255 markings/sec, 175 secs
lola: 17202702 markings, 116324245 edges, 92150 markings/sec, 180 secs
lola: 17598903 markings, 119439049 edges, 79240 markings/sec, 185 secs
lola: 18115431 markings, 122436883 edges, 103306 markings/sec, 190 secs
lola: 18579648 markings, 125538583 edges, 92843 markings/sec, 195 secs
lola: 19049319 markings, 128631928 edges, 93934 markings/sec, 200 secs
lola: 19493329 markings, 131560332 edges, 88802 markings/sec, 205 secs
lola: 19962025 markings, 134607616 edges, 93739 markings/sec, 210 secs
lola: 20429965 markings, 137784414 edges, 93588 markings/sec, 215 secs
lola: 20838145 markings, 140899272 edges, 81636 markings/sec, 220 secs
lola: 21345554 markings, 143875082 edges, 101482 markings/sec, 225 secs
lola: 21805491 markings, 146948607 edges, 91987 markings/sec, 230 secs
lola: 22277739 markings, 150051528 edges, 94450 markings/sec, 235 secs
lola: 22729051 markings, 153023925 edges, 90262 markings/sec, 240 secs
lola: 23203916 markings, 156101671 edges, 94973 markings/sec, 245 secs
lola: 23668582 markings, 159287574 edges, 92933 markings/sec, 250 secs
lola: 24061136 markings, 162426059 edges, 78511 markings/sec, 255 secs
lola: 24408576 markings, 165389746 edges, 69488 markings/sec, 260 secs
lola: 24747949 markings, 168420212 edges, 67875 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((1 <= p75))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p75 <= 0)))))
lola: processed formula length: 34
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (X ((2 <= p315)))) AND A (G ((p258 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p315)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p315))
lola: processed formula length: 15
lola: 11 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p258)))
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 32 bytes per marking, with 1 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 DES-PT-10b-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10b-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19278 markings, 19849 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G ((p300 <= p143)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p143 + 1 <= p300)))
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p141) OR NOT(A (((p237 <= p272) U (2 <= p114)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p141)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p141)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p272 + 1 <= p237) R (p114 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p237 <= p272) U (2 <= p114)))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p33 <= 0) AND ((p108 <= 1) OR (p279 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p33) OR ((2 <= p108) AND (2 <= p279)))))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((p274 <= p21) U (1 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((p274 <= p21) U (1 <= p213)))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 1276776 markings, 3432094 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2275923 markings, 6903815 edges, 199829 markings/sec, 5 secs
lola: 3387214 markings, 10367113 edges, 222258 markings/sec, 10 secs
lola: 4437787 markings, 13787296 edges, 210115 markings/sec, 15 secs
lola: 5318654 markings, 17013393 edges, 176173 markings/sec, 20 secs
lola: 6230223 markings, 20421000 edges, 182314 markings/sec, 25 secs
lola: 7206720 markings, 23824671 edges, 195299 markings/sec, 30 secs
lola: 8264800 markings, 27233519 edges, 211616 markings/sec, 35 secs
lola: 9354289 markings, 30629746 edges, 217898 markings/sec, 40 secs
lola: 10398271 markings, 33996006 edges, 208796 markings/sec, 45 secs
lola: 11391417 markings, 37349444 edges, 198629 markings/sec, 50 secs
lola: 12141173 markings, 40702826 edges, 149951 markings/sec, 55 secs
lola: 12826250 markings, 43890004 edges, 137015 markings/sec, 60 secs
lola: 13883532 markings, 47204254 edges, 211456 markings/sec, 65 secs
lola: 14866524 markings, 50401345 edges, 196598 markings/sec, 70 secs
lola: 15860306 markings, 53609100 edges, 198756 markings/sec, 75 secs
lola: 16848573 markings, 56861559 edges, 197653 markings/sec, 80 secs
lola: 17572633 markings, 60056740 edges, 144812 markings/sec, 85 secs
lola: 18227711 markings, 63110271 edges, 131016 markings/sec, 90 secs
lola: 19194537 markings, 66281284 edges, 193365 markings/sec, 95 secs
lola: 20204681 markings, 69546569 edges, 202029 markings/sec, 100 secs
lola: 21208281 markings, 72788293 edges, 200720 markings/sec, 105 secs
lola: 22237050 markings, 76078520 edges, 205754 markings/sec, 110 secs
lola: 22965738 markings, 79283756 edges, 145738 markings/sec, 115 secs
lola: 23642655 markings, 82372121 edges, 135383 markings/sec, 120 secs
lola: 24377685 markings, 85666008 edges, 147006 markings/sec, 125 secs
lola: 25083012 markings, 88888318 edges, 141065 markings/sec, 130 secs
lola: 25797573 markings, 92087089 edges, 142912 markings/sec, 135 secs
lola: 26538129 markings, 95404782 edges, 148111 markings/sec, 140 secs
lola: 27232329 markings, 98606132 edges, 138840 markings/sec, 145 secs
lola: 27796564 markings, 101827644 edges, 112847 markings/sec, 150 secs
lola: 28342480 markings, 104950918 edges, 109183 markings/sec, 155 secs
lola: 29196005 markings, 108134006 edges, 170705 markings/sec, 160 secs
lola: 30198999 markings, 111376921 edges, 200599 markings/sec, 165 secs
lola: 31171277 markings, 114571422 edges, 194456 markings/sec, 170 secs
lola: 32190160 markings, 117838894 edges, 203777 markings/sec, 175 secs
lola: 33036439 markings, 121122010 edges, 169256 markings/sec, 180 secs
lola: 33707319 markings, 124198457 edges, 134176 markings/sec, 185 secs
lola: 34554913 markings, 127352361 edges, 169519 markings/sec, 190 secs
lola: 35558247 markings, 130573137 edges, 200667 markings/sec, 195 secs
lola: 36559007 markings, 133778663 edges, 200152 markings/sec, 200 secs
lola: 37570536 markings, 137039315 edges, 202306 markings/sec, 205 secs
lola: 38426657 markings, 140300652 edges, 171224 markings/sec, 210 secs
lola: 39090797 markings, 143346063 edges, 132828 markings/sec, 215 secs
lola: 39837034 markings, 146542089 edges, 149247 markings/sec, 220 secs
lola: 40595763 markings, 149716734 edges, 151746 markings/sec, 225 secs
lola: 41402192 markings, 152956912 edges, 161286 markings/sec, 230 secs
lola: 42220471 markings, 156232287 edges, 163656 markings/sec, 235 secs
lola: 42979265 markings, 159419944 edges, 151759 markings/sec, 240 secs
lola: 43587846 markings, 162633850 edges, 121716 markings/sec, 245 secs
lola: 44144490 markings, 165689402 edges, 111329 markings/sec, 250 secs
lola: 45160650 markings, 168932513 edges, 203232 markings/sec, 255 secs
lola: 46157672 markings, 172136147 edges, 199404 markings/sec, 260 secs
lola: 47204159 markings, 175416658 edges, 209297 markings/sec, 265 secs
lola: 48090149 markings, 178674462 edges, 177198 markings/sec, 270 secs
lola: 48777173 markings, 181769806 edges, 137405 markings/sec, 275 secs
lola: 49564199 markings, 184812645 edges, 157405 markings/sec, 280 secs
lola: 50362300 markings, 187778857 edges, 159620 markings/sec, 285 secs
lola: 51114290 markings, 190670220 edges, 150398 markings/sec, 290 secs
lola: 51917527 markings, 193570582 edges, 160647 markings/sec, 295 secs
lola: 52744295 markings, 196591024 edges, 165354 markings/sec, 300 secs
lola: 53446550 markings, 199416256 edges, 140451 markings/sec, 305 secs
lola: 54285526 markings, 202370247 edges, 167795 markings/sec, 310 secs
lola: 55134371 markings, 205386467 edges, 169769 markings/sec, 315 secs
lola: 55911862 markings, 208355268 edges, 155498 markings/sec, 320 secs
lola: 56697895 markings, 211294563 edges, 157207 markings/sec, 325 secs
lola: 57467072 markings, 214173111 edges, 153835 markings/sec, 330 secs
lola: 58068465 markings, 217055277 edges, 120279 markings/sec, 335 secs
lola: 58619551 markings, 219835208 edges, 110217 markings/sec, 340 secs
lola: 59127067 markings, 222485454 edges, 101503 markings/sec, 345 secs
lola: 59694816 markings, 225247007 edges, 113550 markings/sec, 350 secs
lola: 60197542 markings, 227889350 edges, 100545 markings/sec, 355 secs
lola: 60863623 markings, 230872506 edges, 133216 markings/sec, 360 secs
lola: 61551890 markings, 233888532 edges, 137653 markings/sec, 365 secs
lola: 62190727 markings, 236753985 edges, 127767 markings/sec, 370 secs
lola: 62927507 markings, 239705374 edges, 147356 markings/sec, 375 secs
lola: 63746336 markings, 242854107 edges, 163766 markings/sec, 380 secs
lola: 64447269 markings, 246003644 edges, 140187 markings/sec, 385 secs
lola: 65227379 markings, 249127317 edges, 156022 markings/sec, 390 secs
lola: 66058473 markings, 252252881 edges, 166219 markings/sec, 395 secs
lola: 66756853 markings, 255390352 edges, 139676 markings/sec, 400 secs
lola: 67551840 markings, 258566306 edges, 158997 markings/sec, 405 secs
lola: 68383451 markings, 261687896 edges, 166322 markings/sec, 410 secs
lola: 69083109 markings, 264859838 edges, 139932 markings/sec, 415 secs
lola: 69772906 markings, 268072297 edges, 137959 markings/sec, 420 secs
lola: 70348585 markings, 271209997 edges, 115136 markings/sec, 425 secs
lola: 70897014 markings, 274164387 edges, 109686 markings/sec, 430 secs
lola: 71447864 markings, 277129234 edges, 110170 markings/sec, 435 secs
lola: 72005727 markings, 280137623 edges, 111573 markings/sec, 440 secs
lola: 72623356 markings, 283154648 edges, 123526 markings/sec, 445 secs
lola: 73249886 markings, 286056503 edges, 125306 markings/sec, 450 secs
lola: 73835251 markings, 288856237 edges, 117073 markings/sec, 455 secs
lola: 74619630 markings, 291920566 edges, 156876 markings/sec, 460 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((p36 <= p248))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p36 <= p248))))
lola: processed formula length: 38
lola: 6 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 169 edges
lola: ========================================
lola: subprocess 11 will run for 560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p279 <= p315) U ((p145 + 1 <= p195) OR ((p28 <= p25) AND (1 <= p165)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p279 <= p315) U ((p145 + 1 <= p195) OR ((p28 <= p25) AND (1 <= p165)))))
lola: processed formula: A (((p279 <= p315) U ((p145 + 1 <= p195) OR ((p28 <= p25) AND (1 <= p165)))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 87 markings, 87 edges
lola: ========================================
lola: subprocess 12 will run for 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= p144) AND (3 <= p221))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= p144) AND (3 <= p221))))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 85 edges
lola: ========================================
lola: subprocess 13 will run for 934 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((p268 <= p42))) OR ((p71 <= p49) OR (p40 <= p26) OR ((3 <= p133) AND (2 <= p254)))) AND ((p313 <= p180) AND (p264 <= p158) AND ((2 <= p104) OR (p101 <= p205)) AND (p208 <= p101) AND (3 <= p291) AND ((p55 <= p56) OR (3 <= p246)))) OR (E (G ((p257 <= p39))) OR (E (X ((2 <= p166))) AND (((p150 <= p185) AND (p92 <= p265)) OR ((p56 <= p204) AND (2 <= p135))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 934 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p268 <= p42)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p42 + 1 <= p268)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 14 will run for 1401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p313 <= p180) AND (p264 <= p158) AND ((2 <= p104) OR (p101 <= p205)) AND (p208 <= p101) AND (3 <= p291) AND ((p55 <= p56) OR (3 <= p246)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p313 <= p180) AND (p264 <= p158) AND ((2 <= p104) OR (p101 <= p205)) AND (p208 <= p101) AND (3 <= p291) AND ((p55 <= p56) OR (3 <= p246)))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: processed formula with 8 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 2801 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p257 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p39 + 1 <= p257)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p211 <= p88) AND E ((((p90 <= p262) AND (p31 <= p176)) U (p198 + 1 <= p181))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p211 <= p88)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p211 <= p88)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-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: subprocess 15 will run for 2801 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p90 <= p262) AND (p31 <= p176)) U (p198 + 1 <= p181)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p90 <= p262) AND (p31 <= p176)) U (p198 + 1 <= p181))
lola: processed formula length: 57
lola: 1 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 358982 markings, 1308361 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2799 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((p52 + 1 <= p268)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (p52 + 1 <= p268)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 84 markings, 83 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown no yes yes yes yes unknown no no no yes yes no
FORMULA DES-PT-10b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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="DES-PT-10b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/DES-PT-10b.tgz
mv DES-PT-10b 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 mcc4mcc-full"
echo " Input is DES-PT-10b, 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 r058-smll-152646385600220"
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 ;