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 272K
-rw-r--r-- 1 mcc users 3.0K 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.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K 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 18K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-60a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-smll-152646382900283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526517592562


BK_STOP 1526518319083

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-60a 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': 2791780, 'Memory': 3316.83, 'Tool': 'lola'}, {'Time': 2792458, 'Memory': 3339.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-60a...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DES-PT-60a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-60a @ 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: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-CTLCardinality.task
lola: E (F (((3 <= p214) AND (2 <= p128)))) : NOT(A (X (A (G ((p282 <= p23)))))) : A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284))) : E (G (E (F ((3 <= p17))))) : ((((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105))) AND NOT((A (F ((3 <= p190))) OR A (G ((1 <= p216)))))) : (E (G ((p126 <= p146))) OR NOT((A (X ((p329 <= p142))) OR (p286 <= p61)))) : A (G (A (F (((2 <= p45) AND (p68 <= p160)))))) : A (F (NOT(A (F ((p266 <= p306)))))) : E (X (E (((p353 <= p256) U (2 <= p130))))) : A ((E (F ((p306 <= p161))) U A (F ((2 <= p322))))) : E (F (E (G ((p180 <= p220))))) : ((p110 <= p6) AND (E (G ((p198 <= 1))) OR (E (G ((3 <= p5))) AND ((p202 <= 1) AND (p293 + 1 <= p67))))) : (E (G ((p340 <= p34))) OR A (F (E (G ((p27 <= p291)))))) : A (G (E (X ((p96 <= p183))))) : NOT((A (F ((p159 + 1 <= p156))) OR (A (F ((p311 <= p34))) AND E (G ((3 <= p0)))))) : ((E (F (((1 <= p122) AND (3 <= p187)))) OR A (G ((p75 + 1 <= p122)))) AND (p1 <= p93))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p214) AND (2 <= p128))))
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 40 bytes per marking, with 25 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 DES-PT-60a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (G ((p282 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p23 + 1 <= p282)))
lola: processed formula length: 31
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 51594 markings, 304274 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: processed formula: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((3 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (3 <= p17)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 533808 markings, 3297264 edges, 3192519972177838080 markings/sec, 0 secs
lola: 1059468 markings, 6724484 edges, 105132 markings/sec, 5 secs
lola: 1445365 markings, 10016933 edges, 77179 markings/sec, 10 secs
lola: 1774940 markings, 13138720 edges, 65915 markings/sec, 15 secs
lola: 2136520 markings, 16320199 edges, 72316 markings/sec, 20 secs
lola: 2460771 markings, 19453841 edges, 64850 markings/sec, 25 secs
lola: 2779200 markings, 22565704 edges, 63686 markings/sec, 30 secs
lola: 3294245 markings, 25940894 edges, 103009 markings/sec, 35 secs
lola: 3644323 markings, 29173400 edges, 70016 markings/sec, 40 secs
lola: 3967030 markings, 32296076 edges, 64541 markings/sec, 45 secs
lola: 4328629 markings, 35535980 edges, 72320 markings/sec, 50 secs
lola: 4655653 markings, 38641122 edges, 65405 markings/sec, 55 secs
lola: 5185607 markings, 42161446 edges, 105991 markings/sec, 60 secs
lola: 5551811 markings, 45569386 edges, 73241 markings/sec, 65 secs
lola: 5895742 markings, 48933548 edges, 68786 markings/sec, 70 secs
lola: 6286570 markings, 52388334 edges, 78166 markings/sec, 75 secs
lola: 6673898 markings, 55755818 edges, 77466 markings/sec, 80 secs
lola: 7081650 markings, 58976051 edges, 81550 markings/sec, 85 secs
lola: 7465334 markings, 62296085 edges, 76737 markings/sec, 90 secs
lola: 7801786 markings, 65545155 edges, 67290 markings/sec, 95 secs
lola: 8174833 markings, 69021865 edges, 74609 markings/sec, 100 secs
lola: 8670180 markings, 72625987 edges, 99069 markings/sec, 105 secs
lola: 9084411 markings, 75970537 edges, 82846 markings/sec, 110 secs
lola: 9473916 markings, 79170792 edges, 77901 markings/sec, 115 secs
lola: 9812924 markings, 82272708 edges, 67802 markings/sec, 120 secs
lola: 10180727 markings, 85351425 edges, 73561 markings/sec, 125 secs
lola: 10505146 markings, 88313790 edges, 64884 markings/sec, 130 secs
lola: 10881544 markings, 91486125 edges, 75280 markings/sec, 135 secs
lola: 11220100 markings, 94581376 edges, 67711 markings/sec, 140 secs
lola: 11623160 markings, 97948835 edges, 80612 markings/sec, 145 secs
lola: 11974074 markings, 101135784 edges, 70183 markings/sec, 150 secs
lola: 12303396 markings, 104164084 edges, 65864 markings/sec, 155 secs
lola: 12594887 markings, 107107283 edges, 58298 markings/sec, 160 secs
lola: 12898540 markings, 109965121 edges, 60731 markings/sec, 165 secs
lola: 13154083 markings, 112539254 edges, 51109 markings/sec, 170 secs
lola: 13456824 markings, 115420307 edges, 60548 markings/sec, 175 secs
lola: 13704907 markings, 117902441 edges, 49617 markings/sec, 180 secs
lola: 14051007 markings, 121064480 edges, 69220 markings/sec, 185 secs
lola: 14494493 markings, 124576052 edges, 88697 markings/sec, 190 secs
lola: 14925512 markings, 128018777 edges, 86204 markings/sec, 195 secs
lola: 15305371 markings, 131368759 edges, 75972 markings/sec, 200 secs
lola: 15686494 markings, 134964914 edges, 76225 markings/sec, 205 secs
lola: 16038222 markings, 138489689 edges, 70346 markings/sec, 210 secs
lola: 16357311 markings, 141840763 edges, 63818 markings/sec, 215 secs
lola: 16778378 markings, 145546619 edges, 84213 markings/sec, 220 secs
lola: 17177276 markings, 149119158 edges, 79780 markings/sec, 225 secs
lola: 17521639 markings, 152429378 edges, 68873 markings/sec, 230 secs
lola: 17916339 markings, 156012817 edges, 78940 markings/sec, 235 secs
lola: 18266239 markings, 159425591 edges, 69980 markings/sec, 240 secs
lola: 18579150 markings, 162684852 edges, 62582 markings/sec, 245 secs
lola: 18907055 markings, 165868613 edges, 65581 markings/sec, 250 secs
lola: 19209794 markings, 169026408 edges, 60548 markings/sec, 255 secs
lola: 19596028 markings, 172482283 edges, 77247 markings/sec, 260 secs
lola: 19942752 markings, 175807559 edges, 69345 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: ((((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105))) AND NOT((A (F ((3 <= p190))) OR A (G ((1 <= p216))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105)))
lola: processed formula length: 84
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: processed formula with 5 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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p190 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p190)))
lola: processed formula length: 26
lola: 9 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p216 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DES-PT-60a-CTLCardinality-6.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p126 <= p146))) OR NOT((A (X ((p329 <= p142))) OR (p286 <= p61))))
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 (G ((p126 <= p146)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p146 + 1 <= p126)))
lola: processed formula length: 33
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 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: A (G (A (F (((2 <= p45) AND (p68 <= p160))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= p45) AND (p68 <= p160))))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((p266 <= p306))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p266 <= p306))))
lola: processed formula length: 39
lola: 6 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 89 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((p353 <= p256) U (2 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((p353 <= p256) U (2 <= p130)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 719430 markings, 3377256 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1372427 markings, 7065643 edges, 130599 markings/sec, 5 secs
lola: 1865594 markings, 10755818 edges, 98633 markings/sec, 10 secs
lola: 2406951 markings, 14492213 edges, 108271 markings/sec, 15 secs
lola: 2983349 markings, 18196008 edges, 115280 markings/sec, 20 secs
lola: 3648796 markings, 22012995 edges, 133089 markings/sec, 25 secs
lola: 4131022 markings, 25607603 edges, 96445 markings/sec, 30 secs
lola: 4604555 markings, 29272215 edges, 94707 markings/sec, 35 secs
lola: 5089722 markings, 32920559 edges, 97033 markings/sec, 40 secs
lola: 5517495 markings, 36443255 edges, 85555 markings/sec, 45 secs
lola: 6024438 markings, 40002848 edges, 101389 markings/sec, 50 secs
lola: 6466599 markings, 43464570 edges, 88432 markings/sec, 55 secs
lola: 6907930 markings, 46892248 edges, 88266 markings/sec, 60 secs
lola: 7335661 markings, 50682992 edges, 85546 markings/sec, 65 secs
lola: 7762119 markings, 54452573 edges, 85292 markings/sec, 70 secs
lola: 8161885 markings, 58032994 edges, 79953 markings/sec, 75 secs
lola: 8567344 markings, 61589325 edges, 81092 markings/sec, 80 secs
lola: 8957245 markings, 65002523 edges, 77980 markings/sec, 85 secs
lola: 9462021 markings, 68503770 edges, 100955 markings/sec, 90 secs
lola: 9845849 markings, 71784844 edges, 76766 markings/sec, 95 secs
lola: 10178839 markings, 75426889 edges, 66598 markings/sec, 100 secs
lola: 10465336 markings, 78888719 edges, 57299 markings/sec, 105 secs
lola: 10819055 markings, 82284965 edges, 70744 markings/sec, 110 secs
lola: 11261711 markings, 85642285 edges, 88531 markings/sec, 115 secs
lola: 11673807 markings, 88901810 edges, 82419 markings/sec, 120 secs
lola: 12054623 markings, 92135658 edges, 76163 markings/sec, 125 secs
lola: 12373876 markings, 95350245 edges, 63851 markings/sec, 130 secs
lola: 12671339 markings, 98819354 edges, 59493 markings/sec, 135 secs
lola: 12917481 markings, 102196679 edges, 49228 markings/sec, 140 secs
lola: 13192409 markings, 105535470 edges, 54986 markings/sec, 145 secs
lola: 13564702 markings, 109193549 edges, 74459 markings/sec, 150 secs
lola: 13894008 markings, 112858579 edges, 65861 markings/sec, 155 secs
lola: 14196746 markings, 116465463 edges, 60548 markings/sec, 160 secs
lola: 14472029 markings, 120046958 edges, 55057 markings/sec, 165 secs
lola: 14823237 markings, 123575679 edges, 70242 markings/sec, 170 secs
lola: 15222928 markings, 127073946 edges, 79938 markings/sec, 175 secs
lola: 15521252 markings, 130621712 edges, 59665 markings/sec, 180 secs
lola: 15835666 markings, 134063644 edges, 62883 markings/sec, 185 secs
lola: 16265998 markings, 137660551 edges, 86066 markings/sec, 190 secs
lola: 16987562 markings, 141411959 edges, 144313 markings/sec, 195 secs
lola: 17433473 markings, 144769769 edges, 89182 markings/sec, 200 secs
lola: 17775773 markings, 148403909 edges, 68460 markings/sec, 205 secs
lola: 18143263 markings, 151927226 edges, 73498 markings/sec, 210 secs
lola: 18592483 markings, 155581448 edges, 89844 markings/sec, 215 secs
lola: 19102081 markings, 159149864 edges, 101920 markings/sec, 220 secs
lola: 19519928 markings, 162566873 edges, 83569 markings/sec, 225 secs
lola: 19920664 markings, 166047112 edges, 80147 markings/sec, 230 secs
lola: 20300606 markings, 169540425 edges, 75988 markings/sec, 235 secs
lola: 20654269 markings, 172794723 edges, 70733 markings/sec, 240 secs
lola: 20923186 markings, 175986402 edges, 53783 markings/sec, 245 secs
lola: 21300828 markings, 179287464 edges, 75528 markings/sec, 250 secs
lola: 21576498 markings, 182595843 edges, 55134 markings/sec, 255 secs
lola: 21865112 markings, 186008806 edges, 57723 markings/sec, 260 secs
lola: 22169151 markings, 189522756 edges, 60808 markings/sec, 265 secs
lola: 22495711 markings, 193014775 edges, 65312 markings/sec, 270 secs
lola: 22779871 markings, 196465132 edges, 56832 markings/sec, 275 secs
lola: 23341220 markings, 200016801 edges, 112270 markings/sec, 280 secs
lola: 23675881 markings, 203461531 edges, 66932 markings/sec, 285 secs
lola: 24256521 markings, 207028923 edges, 116128 markings/sec, 290 secs
lola: 24925157 markings, 210763937 edges, 133727 markings/sec, 295 secs
lola: 25396218 markings, 214430279 edges, 94212 markings/sec, 300 secs
lola: 25825523 markings, 218022863 edges, 85861 markings/sec, 305 secs
lola: 26313482 markings, 221682927 edges, 97592 markings/sec, 310 secs
lola: 26968510 markings, 225193892 edges, 131006 markings/sec, 315 secs
lola: 27446273 markings, 228695465 edges, 95553 markings/sec, 320 secs
lola: 27897351 markings, 232125250 edges, 90216 markings/sec, 325 secs
lola: 28332817 markings, 235602751 edges, 87093 markings/sec, 330 secs
lola: 28764897 markings, 239073841 edges, 86416 markings/sec, 335 secs
lola: 29169362 markings, 242438584 edges, 80893 markings/sec, 340 secs
lola: 29592581 markings, 245830587 edges, 84644 markings/sec, 345 secs
lola: 30025222 markings, 249233040 edges, 86528 markings/sec, 350 secs
lola: 30446858 markings, 252521538 edges, 84327 markings/sec, 355 secs
lola: 30948255 markings, 255688858 edges, 100279 markings/sec, 360 secs
lola: 31344232 markings, 258861381 edges, 79195 markings/sec, 365 secs
lola: 31736300 markings, 261991222 edges, 78414 markings/sec, 370 secs
lola: 32236188 markings, 265341262 edges, 99978 markings/sec, 375 secs
lola: 32632632 markings, 268658532 edges, 79289 markings/sec, 380 secs
lola: 33083150 markings, 271536098 edges, 90104 markings/sec, 385 secs
lola: 33488758 markings, 274919731 edges, 81122 markings/sec, 390 secs
lola: 34109585 markings, 278490988 edges, 124165 markings/sec, 395 secs
lola: 34567942 markings, 282230838 edges, 91671 markings/sec, 400 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p306 <= p161))) U A (F ((2 <= p322)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p306 <= p161)) U A(TRUE U (2 <= p322)))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 178 edges
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p180 <= p220)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p220 + 1 <= p180))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 49 edges
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p110 <= p6) AND (E (G ((p198 <= 1))) OR (E (G ((3 <= p5))) AND ((p202 <= 1) AND (p293 + 1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p110 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p110 <= p6)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p198 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p198)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p340 <= p34))) OR A (F (E (G ((p27 <= p291))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p340 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p34 + 1 <= p340)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 16786 markings, 66503 edges
lola: ========================================
lola: subprocess 13 will run for 953 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p27 <= p291)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p291 + 1 <= p27))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 953 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p96 <= p183)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p96 <= p183)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((p159 + 1 <= p156))) OR (A (F ((p311 <= p34))) AND E (G ((3 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p156 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p159 + 1 <= p156)))
lola: processed formula length: 33
lola: 13 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p34 + 1 <= p311)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p311 <= p34)))
lola: processed formula length: 28
lola: 13 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 1 markings, 0 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: subprocess 15 will run for 2859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (((1 <= p122) AND (3 <= p187)))) OR A (G ((p75 + 1 <= p122)))) AND (p1 <= p93))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p122) AND (3 <= p187))))
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 40 bytes per marking, with 25 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 DES-PT-60a-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1 <= p93)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p93)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown yes yes no no unknown no yes yes yes no unknown unknown
FORMULA DES-PT-60a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-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 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-60a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-60a.tgz
mv DES-PT-60a 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-structural"
echo " Input is DES-PT-60a, 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 r055-smll-152646382900283"
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 ;