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 300K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K 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 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 121K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is TriangularGrid-PT-4022, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748600395
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527207813099


BK_STOP 1527208651210

--------------------
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 TriangularGrid-PT-4022 as instance name.
Using TriangularGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 969160, 'Memory': 10342.19, 'Tool': 'lola'}, {'Time': 969513, 'Memory': 9604.09, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TriangularGrid-PT-4022...

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


checking for too many tokens
===========================================================================================
TriangularGrid-PT-4022: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ TriangularGrid-PT-4022 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 340/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 184 places, 156 transitions, 107 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-4022-CTLCardinality.task
lola: E (G (E (F (((3 <= pol1_3_3) OR (1 <= pi1_4_3)))))) : E (((pbl_2_2 <= pbl_4_4) U (pb2_4_4 + 1 <= po2_2_3))) : (E (X (A (F ((3 <= pol2_4_1))))) OR E ((((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3))))) : (NOT(E (F (((2 <= pil3_4_5) AND (1 <= pil3_4_7))))) AND ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3))) : ((A (G (((pol2_3_5 <= pb2_3_3) OR (1 <= pol1_4_1)))) OR ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))) AND ((pb1_3_4 + 1 <= pi2_4_1) OR ((pb1_4_7 <= pbl_3_1) AND (pi3_2_1 <= pil2_4_7)))) : A (F (NOT(E (F ((pil2_3_5 <= po1_3_1)))))) : E (G (((po2_4_1 <= 1) AND (pil2_4_3 <= 1) AND (pi3_2_3 <= pb3_4_5)))) : E (G (((1 <= pb2_4_7) OR (3 <= pol3_3_1) OR ((pi1_2_1 <= pol2_4_1) AND (pol2_2_3 <= pil2_4_1)) OR (((pol2_4_5 <= pi2_2_1) OR (po1_1_1 <= pb1_3_1)) AND (pb3_4_6 <= 0))))) : (((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0)))) AND NOT((E (F ((2 <= pil3_1_1))) OR A (X ((2 <= pil1_4_7)))))) : E (G ((E (F ((po1_2_1 <= pb1_1_1))) OR (2 <= po3_3_5)))) : NOT(E ((((pi2_3_3 <= pb2_3_5) AND (2 <= pb1_4_3)) U ((3 <= pi3_4_7) AND (3 <= po3_1_1))))) : E (G (((pol2_4_3 <= pi1_4_1) OR (po1_2_1 <= pil3_4_7) OR (pb1_4_2 <= 2) OR (pbl_2_3 + 1 <= pb3_4_7)))) : A (G (((pi2_4_7 <= pol2_4_3) AND ((pb2_1_1 <= pil3_4_5) OR (pol3_3_3 <= pb3_3_2) OR ((pil2_2_1 <= pb3_4_7) AND (2 <= pol1_1_1)))))) : E (F ((pb1_3_5 + 1 <= po2_3_5))) : (A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1)))) OR (3 <= pb3_1_1)) : NOT(NOT(A (G ((pi1_2_3 <= 1)))))
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 (G (E (F (((3 <= pol1_3_3) OR (1 <= pi1_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((3 <= pol1_3_3) OR (1 <= pi1_4_3))))))
lola: processed formula length: 66
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 505 markings, 1427 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((pbl_2_2 <= pbl_4_4) U (pb2_4_4 + 1 <= po2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((pbl_2_2 <= pbl_4_4) U (pb2_4_4 + 1 <= po2_2_3))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1420978 markings, 2602712 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2772249 markings, 5206814 edges, 270254 markings/sec, 5 secs
lola: 4064286 markings, 7716584 edges, 258407 markings/sec, 10 secs
lola: 5229248 markings, 10045043 edges, 232992 markings/sec, 15 secs
lola: 6259591 markings, 12193790 edges, 206069 markings/sec, 20 secs
lola: 7185503 markings, 14185500 edges, 185182 markings/sec, 25 secs
lola: 7980722 markings, 16090032 edges, 159044 markings/sec, 30 secs
lola: 8869329 markings, 18081345 edges, 177721 markings/sec, 35 secs
lola: 9962887 markings, 20293173 edges, 218712 markings/sec, 40 secs
lola: 11133783 markings, 22464424 edges, 234179 markings/sec, 45 secs
lola: 12355895 markings, 24834674 edges, 244422 markings/sec, 50 secs
lola: 13413576 markings, 26980329 edges, 211536 markings/sec, 55 secs
lola: 14313094 markings, 28894633 edges, 179904 markings/sec, 60 secs
lola: 15097795 markings, 30754685 edges, 156940 markings/sec, 65 secs
lola: 15932694 markings, 32636529 edges, 166980 markings/sec, 70 secs
lola: 16944608 markings, 34719147 edges, 202383 markings/sec, 75 secs
lola: 18095638 markings, 36996756 edges, 230206 markings/sec, 80 secs
lola: 19007633 markings, 39040888 edges, 182399 markings/sec, 85 secs
lola: 20006360 markings, 41169561 edges, 199745 markings/sec, 90 secs
lola: 20819776 markings, 43089830 edges, 162683 markings/sec, 95 secs
lola: 22035748 markings, 45484791 edges, 243194 markings/sec, 100 secs
lola: 23138599 markings, 47633233 edges, 220570 markings/sec, 105 secs
lola: 24161974 markings, 49735663 edges, 204675 markings/sec, 110 secs
lola: 25152064 markings, 51761632 edges, 198018 markings/sec, 115 secs
lola: 26122492 markings, 53803906 edges, 194086 markings/sec, 120 secs
lola: 26931793 markings, 55660248 edges, 161860 markings/sec, 125 secs
lola: 27690106 markings, 57476795 edges, 151663 markings/sec, 130 secs
lola: 28471400 markings, 59341416 edges, 156259 markings/sec, 135 secs
lola: 29249163 markings, 61111427 edges, 155553 markings/sec, 140 secs
lola: 30000793 markings, 62718133 edges, 150326 markings/sec, 145 secs
lola: 30622242 markings, 64162650 edges, 124290 markings/sec, 150 secs
lola: 31332766 markings, 65864875 edges, 142105 markings/sec, 155 secs
lola: 32080216 markings, 67643742 edges, 149490 markings/sec, 160 secs
lola: 32749911 markings, 69229008 edges, 133939 markings/sec, 165 secs
lola: 33880527 markings, 71457370 edges, 226123 markings/sec, 170 secs
lola: 34915019 markings, 73479318 edges, 206898 markings/sec, 175 secs
lola: 35749296 markings, 75285611 edges, 166855 markings/sec, 180 secs
lola: 36491408 markings, 77056999 edges, 148422 markings/sec, 185 secs
lola: 37272638 markings, 78812496 edges, 156246 markings/sec, 190 secs
lola: 38055451 markings, 80584173 edges, 156563 markings/sec, 195 secs
lola: 38865225 markings, 82243769 edges, 161955 markings/sec, 200 secs
lola: 39673747 markings, 83975149 edges, 161704 markings/sec, 205 secs
lola: 40360294 markings, 85555972 edges, 137309 markings/sec, 210 secs
lola: 40906268 markings, 86902750 edges, 109195 markings/sec, 215 secs
lola: 41746307 markings, 88747415 edges, 168008 markings/sec, 220 secs
lola: 42543846 markings, 90474734 edges, 159508 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((3 <= pol2_4_1))))) OR E ((((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= pol2_4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= pol2_4_1)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6224 markings, 6271 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((pb3_3_4 <= pol1_4_3) OR (1 <= po1_4_5)) U ((3 <= po1_4_3) OR (pb3_4_7 <= po2_4_3)))
lola: processed formula length: 89
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= pil3_4_5) AND (1 <= pil3_4_7))))) AND ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil3_4_5 <= 1) OR (pil3_4_7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb2_4_4 + 1 <= pol2_3_3) OR (pol3_4_3 <= 2) OR (3 <= pil1_1_1) OR (po3_4_5 <= pol3_4_3))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((pol2_3_5 <= pb2_3_3) OR (1 <= pol1_4_1)))) OR ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))) AND ((pb1_3_4 + 1 <= pi2_4_1) OR ((pb1_4_7 <= pbl_3_1) AND (pi3_2_1 <= pil2_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol2_3_5 <= pb2_3_3) OR (1 <= pol1_4_1))))
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 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= pil2_2_1) AND ((pol3_3_1 <= 2) OR (pol3_2_1 <= 2)))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((pil2_3_5 <= po1_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((po1_3_1 + 1 <= pil2_3_5)))))
lola: processed formula: A (F (A (G ((po1_3_1 + 1 <= pil2_3_5)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 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: 434 markings, 435 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((po2_4_1 <= 1) AND (pil2_4_3 <= 1) AND (pi3_2_3 <= pb3_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= po2_4_1) OR (2 <= pil2_4_3) OR (pb3_4_5 + 1 <= pi3_2_3))))
lola: processed formula length: 80
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 649 markings, 649 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= pb2_4_7) OR (3 <= pol3_3_1) OR ((pi1_2_1 <= pol2_4_1) AND (pol2_2_3 <= pil2_4_1)) OR (((pol2_4_5 <= pi2_2_1) OR (po1_1_1 <= pb1_3_1)) AND (pb3_4_6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pb2_4_7 <= 0) AND (pol3_3_1 <= 2) AND ((pol2_4_1 + 1 <= pi1_2_1) OR (pil2_4_1 + 1 <= pol2_2_3)) AND (((pi2_2_1 + 1 <= pol2_4_5) AND (pb1_3_1 + 1 <= po1_1_1)) OR (1 <= pb3_4_6)))))
lola: processed formula length: 196
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 460 markings, 460 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0)))) AND NOT((E (F ((2 <= pil3_1_1))) OR A (X ((2 <= pil1_4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi1_2_1 <= 1) OR ((pi2_1_1 <= 2) AND (pi1_4_7 <= 2) AND ((pb2_4_7 <= 1) OR (pol2_1_1 <= 0))))
lola: processed formula length: 97
lola: 7 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-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 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pil3_1_1 <= 1)))
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 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((pil1_4_7 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((pil1_4_7 <= 1))
lola: processed formula length: 19
lola: 8 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((po1_2_1 <= pb1_1_1))) OR (2 <= po3_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (po1_2_1 <= pb1_1_1))) AND (po3_3_5 <= 1))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 529 markings, 1058 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((pi2_3_3 <= pb2_3_5) AND (2 <= pb1_4_3)) U ((3 <= pi3_4_7) AND (3 <= po3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((pb2_3_5 + 1 <= pi2_3_3) OR (pb1_4_3 <= 1)) R ((pi3_4_7 <= 2) OR (po3_1_1 <= 2))))
lola: processed formula: A ((((pb2_3_5 + 1 <= pi2_3_3) OR (pb1_4_3 <= 1)) R ((pi3_4_7 <= 2) OR (po3_1_1 <= 2))))
lola: processed formula length: 89
lola: 4 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1183858 markings, 2230418 edges, 236772 markings/sec, 0 secs
lola: 2294121 markings, 4337002 edges, 222053 markings/sec, 5 secs
lola: 3414903 markings, 6486342 edges, 224156 markings/sec, 10 secs
lola: 4530682 markings, 8588711 edges, 223156 markings/sec, 15 secs
lola: 5639485 markings, 10655594 edges, 221761 markings/sec, 20 secs
lola: 6762936 markings, 12760368 edges, 224690 markings/sec, 25 secs
lola: 7834675 markings, 14787641 edges, 214348 markings/sec, 30 secs
lola: 8867534 markings, 16773752 edges, 206572 markings/sec, 35 secs
lola: 9894122 markings, 18720520 edges, 205318 markings/sec, 40 secs
lola: 10925182 markings, 20667441 edges, 206212 markings/sec, 45 secs
lola: 12023479 markings, 22734195 edges, 219659 markings/sec, 50 secs
lola: 13018293 markings, 24724528 edges, 198963 markings/sec, 55 secs
lola: 13982089 markings, 26666367 edges, 192759 markings/sec, 60 secs
lola: 14918213 markings, 28563485 edges, 187225 markings/sec, 65 secs
lola: 15791347 markings, 30331153 edges, 174627 markings/sec, 70 secs
lola: 16648897 markings, 32008564 edges, 171510 markings/sec, 75 secs
lola: 17565872 markings, 33961993 edges, 183395 markings/sec, 80 secs
lola: 18562066 markings, 35931629 edges, 199239 markings/sec, 85 secs
lola: 19494201 markings, 37804031 edges, 186427 markings/sec, 90 secs
lola: 20370297 markings, 39489545 edges, 175219 markings/sec, 95 secs
lola: 21239792 markings, 41213615 edges, 173899 markings/sec, 100 secs
lola: 22109457 markings, 43049695 edges, 173933 markings/sec, 105 secs
lola: 23009856 markings, 44901570 edges, 180080 markings/sec, 110 secs
lola: 23859546 markings, 46577361 edges, 169938 markings/sec, 115 secs
lola: 24654052 markings, 48298740 edges, 158901 markings/sec, 120 secs
lola: 25521696 markings, 50030308 edges, 173529 markings/sec, 125 secs
lola: 26369748 markings, 51656044 edges, 169610 markings/sec, 130 secs
lola: 27174298 markings, 53333363 edges, 160910 markings/sec, 135 secs
lola: 27973155 markings, 54923180 edges, 159771 markings/sec, 140 secs
lola: 28784564 markings, 56492130 edges, 162282 markings/sec, 145 secs
lola: 29512158 markings, 58011539 edges, 145519 markings/sec, 150 secs
lola: 30305101 markings, 59458621 edges, 158589 markings/sec, 155 secs
lola: 31061960 markings, 60898613 edges, 151372 markings/sec, 160 secs
lola: 31832839 markings, 62396539 edges, 154176 markings/sec, 165 secs
lola: 32711275 markings, 64090624 edges, 175687 markings/sec, 170 secs
lola: 33296279 markings, 65554946 edges, 117001 markings/sec, 175 secs
lola: 33943520 markings, 67086718 edges, 129448 markings/sec, 180 secs
lola: 34934375 markings, 69040828 edges, 198171 markings/sec, 185 secs
lola: 35894957 markings, 70964935 edges, 192116 markings/sec, 190 secs
lola: 36816644 markings, 72887339 edges, 184337 markings/sec, 195 secs
lola: 37715127 markings, 74676587 edges, 179697 markings/sec, 200 secs
lola: 38547236 markings, 76304948 edges, 166422 markings/sec, 205 secs
lola: 39322006 markings, 78008281 edges, 154954 markings/sec, 210 secs
lola: 40338066 markings, 80007685 edges, 203212 markings/sec, 215 secs
lola: 41285462 markings, 81907072 edges, 189479 markings/sec, 220 secs
lola: 42174332 markings, 83642203 edges, 177774 markings/sec, 225 secs
lola: 43005243 markings, 85241053 edges, 166182 markings/sec, 230 secs
lola: 43796957 markings, 86942809 edges, 158343 markings/sec, 235 secs
lola: 44727869 markings, 88819514 edges, 186182 markings/sec, 240 secs
lola: 45587849 markings, 90563287 edges, 171996 markings/sec, 245 secs
lola: 46393933 markings, 92155043 edges, 161217 markings/sec, 250 secs
lola: 47185384 markings, 93876991 edges, 158290 markings/sec, 255 secs
lola: 48032992 markings, 95539326 edges, 169522 markings/sec, 260 secs
lola: 48839530 markings, 97091770 edges, 161308 markings/sec, 265 secs
lola: 49561056 markings, 98664145 edges, 144305 markings/sec, 270 secs
lola: 50361841 markings, 100186260 edges, 160157 markings/sec, 275 secs
lola: 51156965 markings, 101725765 edges, 159025 markings/sec, 280 secs
lola: 51832921 markings, 103149386 edges, 135191 markings/sec, 285 secs
lola: 52597966 markings, 104546512 edges, 153009 markings/sec, 290 secs
lola: 53333716 markings, 105947046 edges, 147150 markings/sec, 295 secs
lola: 54077866 markings, 107394078 edges, 148830 markings/sec, 300 secs
lola: 54917524 markings, 109005332 edges, 167932 markings/sec, 305 secs
lola: 55508276 markings, 110447374 edges, 118150 markings/sec, 310 secs
lola: 56054329 markings, 111831187 edges, 109211 markings/sec, 315 secs
lola: 56968666 markings, 113577515 edges, 182867 markings/sec, 320 secs
lola: 57831232 markings, 115292580 edges, 172513 markings/sec, 325 secs
lola: 58662520 markings, 116924620 edges, 166258 markings/sec, 330 secs
lola: 59447366 markings, 118480889 edges, 156969 markings/sec, 335 secs
lola: 60209226 markings, 119905839 edges, 152372 markings/sec, 340 secs
lola: 60922670 markings, 121446582 edges, 142689 markings/sec, 345 secs
lola: 61768555 markings, 123122049 edges, 169177 markings/sec, 350 secs
lola: 62553462 markings, 124711966 edges, 156981 markings/sec, 355 secs
lola: 63290106 markings, 126159479 edges, 147329 markings/sec, 360 secs
lola: 63993499 markings, 127547347 edges, 140679 markings/sec, 365 secs
lola: 64696539 markings, 129080219 edges, 140608 markings/sec, 370 secs
lola: 65462536 markings, 130570178 edges, 153199 markings/sec, 375 secs
lola: 66198849 markings, 131977624 edges, 147263 markings/sec, 380 secs
lola: 66919551 markings, 133365711 edges, 144140 markings/sec, 385 secs
lola: 67596831 markings, 134812666 edges, 135456 markings/sec, 390 secs
lola: 68311045 markings, 136177832 edges, 142843 markings/sec, 395 secs
lola: 69005696 markings, 137513123 edges, 138930 markings/sec, 400 secs
lola: 69638929 markings, 138862132 edges, 126647 markings/sec, 405 secs
lola: 70326844 markings, 140099037 edges, 137583 markings/sec, 410 secs
lola: 71010561 markings, 141375236 edges, 136743 markings/sec, 415 secs
lola: 71682802 markings, 142656474 edges, 134448 markings/sec, 420 secs
lola: 72361194 markings, 143952819 edges, 135678 markings/sec, 425 secs
lola: 73099793 markings, 145356447 edges, 147720 markings/sec, 430 secs
lola: 73745897 markings, 146762787 edges, 129221 markings/sec, 435 secs
lola: 74265783 markings, 148056213 edges, 103977 markings/sec, 440 secs
lola: 74950887 markings, 149547753 edges, 137021 markings/sec, 445 secs
lola: 75770843 markings, 151185315 edges, 163991 markings/sec, 450 secs
lola: 76538505 markings, 152726731 edges, 153532 markings/sec, 455 secs
lola: 77264488 markings, 154159885 edges, 145197 markings/sec, 460 secs
lola: 77974281 markings, 155652307 edges, 141959 markings/sec, 465 secs
lola: 78678560 markings, 157106633 edges, 140856 markings/sec, 470 secs
lola: 79112586 markings, 157991238 edges, 86805 markings/sec, 475 secs
lola: 79118172 markings, 158002230 edges, 1117 markings/sec, 480 secs
lola: 79120668 markings, 158007259 edges, 499 markings/sec, 485 secs
lola: 79122612 markings, 158010746 edges, 389 markings/sec, 490 secs
lola: 79122643 markings, 158010806 edges, 6 markings/sec, 495 secs
lola: 79149286 markings, 158062158 edges, 5329 markings/sec, 500 secs
lola: 79149310 markings, 158062218 edges, 5 markings/sec, 505 secs
lola: 79149331 markings, 158062267 edges, 4 markings/sec, 510 secs
lola: 79149357 markings, 158062338 edges, 5 markings/sec, 515 secs
lola: 79150735 markings, 158064800 edges, 276 markings/sec, 520 secs
lola: 79150745 markings, 158064823 edges, 2 markings/sec, 525 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((pol2_4_3 <= pi1_4_1) OR (po1_2_1 <= pil3_4_7) OR (pb1_4_2 <= 2) OR (pbl_2_3 + 1 <= pb3_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pi1_4_1 + 1 <= pol2_4_3) AND (pil3_4_7 + 1 <= po1_2_1) AND (3 <= pb1_4_2) AND (pb3_4_7 <= pbl_2_3))))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 496 markings, 496 edges
lola: ========================================
lola: subprocess 12 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi2_4_7 <= pol2_4_3) AND ((pb2_1_1 <= pil3_4_5) OR (pol3_3_3 <= pb3_3_2) OR ((pil2_2_1 <= pb3_4_7) AND (2 <= pol1_1_1))))))
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 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 916 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb1_3_5 + 1 <= po2_3_5)))
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 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1374 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1)))) OR (3 <= pb3_1_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1374 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1))))
lola: processed formula: A (F (((pb2_4_3 <= 1) AND (pil3_2_3 <= 1))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: 568 markings, 568 edges
lola: ========================================
lola: subprocess 15 will run for 2748 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= pb3_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pb3_1_1)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2748 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G ((pi1_2_3 <= 1)))))
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 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no yes no no yes yes yes yes unknown yes no yes no yes
FORMULA TriangularGrid-PT-4022-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TriangularGrid-PT-4022"
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/TriangularGrid-PT-4022.tgz
mv TriangularGrid-PT-4022 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 TriangularGrid-PT-4022, 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 r178-smll-152708748600395"
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 ;