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 irma4mcc-structural
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 r175-smll-152708746600395
=====================================================================

--------------------
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 1527190188995


BK_STOP 1527190979938

--------------------
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 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': 'itstools'}].
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ TriangularGrid-PT-4022 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 236 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: 1526389 markings, 2787628 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2901882 markings, 5438023 edges, 275099 markings/sec, 5 secs
lola: 4169245 markings, 7938769 edges, 253473 markings/sec, 10 secs
lola: 5356858 markings, 10310428 edges, 237523 markings/sec, 15 secs
lola: 6389490 markings, 12454059 edges, 206526 markings/sec, 20 secs
lola: 7302007 markings, 14458853 edges, 182503 markings/sec, 25 secs
lola: 8095735 markings, 16371498 edges, 158746 markings/sec, 30 secs
lola: 9002393 markings, 18402210 edges, 181332 markings/sec, 35 secs
lola: 10218485 markings, 20761748 edges, 243218 markings/sec, 40 secs
lola: 11518739 markings, 23219489 edges, 260051 markings/sec, 45 secs
lola: 12748587 markings, 25576726 edges, 245970 markings/sec, 50 secs
lola: 13770860 markings, 27705685 edges, 204455 markings/sec, 55 secs
lola: 14607606 markings, 29585583 edges, 167349 markings/sec, 60 secs
lola: 15387435 markings, 31428785 edges, 155966 markings/sec, 65 secs
lola: 16242838 markings, 33348810 edges, 171081 markings/sec, 70 secs
lola: 17350252 markings, 35532962 edges, 221483 markings/sec, 75 secs
lola: 18463285 markings, 37795051 edges, 222607 markings/sec, 80 secs
lola: 19414285 markings, 39913282 edges, 190200 markings/sec, 85 secs
lola: 20304570 markings, 41918675 edges, 178057 markings/sec, 90 secs
lola: 21291980 markings, 44053700 edges, 197482 markings/sec, 95 secs
lola: 22544105 markings, 46408721 edges, 250425 markings/sec, 100 secs
lola: 23558572 markings, 48487139 edges, 202893 markings/sec, 105 secs
lola: 24522853 markings, 50504090 edges, 192856 markings/sec, 110 secs
lola: 25596889 markings, 52687120 edges, 214807 markings/sec, 115 secs
lola: 26488003 markings, 54617044 edges, 178223 markings/sec, 120 secs
lola: 27254719 markings, 56432595 edges, 153343 markings/sec, 125 secs
lola: 28031509 markings, 58286873 edges, 155358 markings/sec, 130 secs
lola: 28751863 markings, 60034435 edges, 144071 markings/sec, 135 secs
lola: 29639860 markings, 61951064 edges, 177599 markings/sec, 140 secs
lola: 30434964 markings, 63720713 edges, 159021 markings/sec, 145 secs
lola: 31130577 markings, 65383570 edges, 139123 markings/sec, 150 secs
lola: 31863013 markings, 67124841 edges, 146487 markings/sec, 155 secs
lola: 32499838 markings, 68676834 edges, 127365 markings/sec, 160 secs
lola: 33422495 markings, 70641115 edges, 184531 markings/sec, 165 secs
lola: 34454917 markings, 72610226 edges, 206484 markings/sec, 170 secs
lola: 35314412 markings, 74327817 edges, 171899 markings/sec, 175 secs
lola: 36076486 markings, 76055411 edges, 152415 markings/sec, 180 secs
lola: 36788933 markings, 77749205 edges, 142489 markings/sec, 185 secs
lola: 37556753 markings, 79503095 edges, 153564 markings/sec, 190 secs
lola: 38344726 markings, 81172177 edges, 157595 markings/sec, 195 secs
lola: 39125299 markings, 82783160 edges, 156115 markings/sec, 200 secs
lola: 39883554 markings, 84454059 edges, 151651 markings/sec, 205 secs
lola: 40493104 markings, 85872889 edges, 121910 markings/sec, 210 secs
lola: 41082234 markings, 87283662 edges, 117826 markings/sec, 215 secs
lola: 41900870 markings, 89123145 edges, 163727 markings/sec, 220 secs
lola: 42694444 markings, 90783524 edges, 158715 markings/sec, 225 secs
lola: 43479206 markings, 92426969 edges, 156952 markings/sec, 230 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 235 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 235 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: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-4.sara
lola: 5 markings, 4 edges
lola: ========================================
lola: state equation: calling and running sara
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
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-4.sara.
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
sara: place or transition ordering is non-deterministic

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: 1164144 markings, 2190230 edges, 232829 markings/sec, 0 secs
lola: 2241048 markings, 4239443 edges, 215381 markings/sec, 5 secs
lola: 3319137 markings, 6307778 edges, 215618 markings/sec, 10 secs
lola: 4387730 markings, 8318798 edges, 213719 markings/sec, 15 secs
lola: 5433184 markings, 10277465 edges, 209091 markings/sec, 20 secs
lola: 6500791 markings, 12276681 edges, 213521 markings/sec, 25 secs
lola: 7549023 markings, 14226380 edges, 209646 markings/sec, 30 secs
lola: 8510365 markings, 16099404 edges, 192268 markings/sec, 35 secs
lola: 9501110 markings, 17954473 edges, 198149 markings/sec, 40 secs
lola: 10440847 markings, 19763939 edges, 187947 markings/sec, 45 secs
lola: 11418935 markings, 21566468 edges, 195618 markings/sec, 50 secs
lola: 12447742 markings, 23565665 edges, 205761 markings/sec, 55 secs
lola: 13384287 markings, 25455964 edges, 187309 markings/sec, 60 secs
lola: 14303803 markings, 27312279 edges, 183903 markings/sec, 65 secs
lola: 15182200 markings, 29123941 edges, 175679 markings/sec, 70 secs
lola: 16030931 markings, 30774557 edges, 169746 markings/sec, 75 secs
lola: 16832121 markings, 32416364 edges, 160238 markings/sec, 80 secs
lola: 17773842 markings, 34352340 edges, 188344 markings/sec, 85 secs
lola: 18742178 markings, 36289713 edges, 193667 markings/sec, 90 secs
lola: 19656154 markings, 38127421 edges, 182795 markings/sec, 95 secs
lola: 20517929 markings, 39771455 edges, 172355 markings/sec, 100 secs
lola: 21343172 markings, 41478039 edges, 165049 markings/sec, 105 secs
lola: 22240078 markings, 43339192 edges, 179381 markings/sec, 110 secs
lola: 23135460 markings, 45141712 edges, 179076 markings/sec, 115 secs
lola: 23964807 markings, 46789106 edges, 165869 markings/sec, 120 secs
lola: 24741450 markings, 48496046 edges, 155329 markings/sec, 125 secs
lola: 25626525 markings, 50226258 edges, 177015 markings/sec, 130 secs
lola: 26455202 markings, 51825000 edges, 165735 markings/sec, 135 secs
lola: 27235714 markings, 53490438 edges, 156102 markings/sec, 140 secs
lola: 28046936 markings, 55057270 edges, 162244 markings/sec, 145 secs
lola: 28860886 markings, 56632373 edges, 162790 markings/sec, 150 secs
lola: 29564478 markings, 58105877 edges, 140718 markings/sec, 155 secs
lola: 30354585 markings, 59549110 edges, 158021 markings/sec, 160 secs
lola: 31115790 markings, 60999368 edges, 152241 markings/sec, 165 secs
lola: 31875500 markings, 62477398 edges, 151942 markings/sec, 170 secs
lola: 32739643 markings, 64161731 edges, 172829 markings/sec, 175 secs
lola: 33319156 markings, 65614829 edges, 115903 markings/sec, 180 secs
lola: 33983512 markings, 67167379 edges, 132871 markings/sec, 185 secs
lola: 34968071 markings, 69107991 edges, 196912 markings/sec, 190 secs
lola: 35918556 markings, 71010052 edges, 190097 markings/sec, 195 secs
lola: 36832027 markings, 72916962 edges, 182694 markings/sec, 200 secs
lola: 37720008 markings, 74686626 edges, 177596 markings/sec, 205 secs
lola: 38546854 markings, 76304161 edges, 165369 markings/sec, 210 secs
lola: 39310825 markings, 77986814 edges, 152794 markings/sec, 215 secs
lola: 40331488 markings, 79991246 edges, 204133 markings/sec, 220 secs
lola: 41232131 markings, 81798332 edges, 180129 markings/sec, 225 secs
lola: 42080715 markings, 83460135 edges, 169717 markings/sec, 230 secs
lola: 42859561 markings, 84955285 edges, 155769 markings/sec, 235 secs
lola: 43610537 markings, 86512761 edges, 150195 markings/sec, 240 secs
lola: 44437169 markings, 88210660 edges, 165326 markings/sec, 245 secs
lola: 45253739 markings, 89898626 edges, 163314 markings/sec, 250 secs
lola: 46023335 markings, 91411572 edges, 153919 markings/sec, 255 secs
lola: 46776242 markings, 92950470 edges, 150581 markings/sec, 260 secs
lola: 47496255 markings, 94472733 edges, 144003 markings/sec, 265 secs
lola: 48261216 markings, 96001182 edges, 152992 markings/sec, 270 secs
lola: 49011079 markings, 97424862 edges, 149973 markings/sec, 275 secs
lola: 49694367 markings, 98905503 edges, 136658 markings/sec, 280 secs
lola: 50433538 markings, 100326362 edges, 147834 markings/sec, 285 secs
lola: 51168949 markings, 101754142 edges, 147082 markings/sec, 290 secs
lola: 51776394 markings, 103047562 edges, 121489 markings/sec, 295 secs
lola: 52480782 markings, 104328071 edges, 140878 markings/sec, 300 secs
lola: 53155103 markings, 105608699 edges, 134864 markings/sec, 305 secs
lola: 53834595 markings, 106912513 edges, 135898 markings/sec, 310 secs
lola: 54550580 markings, 108320739 edges, 143197 markings/sec, 315 secs
lola: 55237827 markings, 109766174 edges, 137449 markings/sec, 320 secs
lola: 55729857 markings, 111011217 edges, 98406 markings/sec, 325 secs
lola: 56336725 markings, 112368920 edges, 121374 markings/sec, 330 secs
lola: 57159950 markings, 113966044 edges, 164645 markings/sec, 335 secs
lola: 57987133 markings, 115599648 edges, 165437 markings/sec, 340 secs
lola: 58762446 markings, 117143207 edges, 155063 markings/sec, 345 secs
lola: 59433194 markings, 118455794 edges, 134150 markings/sec, 350 secs
lola: 60091288 markings, 119682882 edges, 131619 markings/sec, 355 secs
lola: 60766340 markings, 121051811 edges, 135010 markings/sec, 360 secs
lola: 61505432 markings, 122580536 edges, 147818 markings/sec, 365 secs
lola: 62257854 markings, 124094987 edges, 150484 markings/sec, 370 secs
lola: 62961735 markings, 125522503 edges, 140776 markings/sec, 375 secs
lola: 63633561 markings, 126835963 edges, 134365 markings/sec, 380 secs
lola: 64307080 markings, 128215552 edges, 134704 markings/sec, 385 secs
lola: 64966937 markings, 129592867 edges, 131971 markings/sec, 390 secs
lola: 65665411 markings, 130962596 edges, 139695 markings/sec, 395 secs
lola: 66335117 markings, 132236866 edges, 133941 markings/sec, 400 secs
lola: 67023209 markings, 133557670 edges, 137618 markings/sec, 405 secs
lola: 67600986 markings, 134822059 edges, 115555 markings/sec, 410 secs
lola: 68252654 markings, 136063246 edges, 130334 markings/sec, 415 secs
lola: 68884976 markings, 137275288 edges, 126464 markings/sec, 420 secs
lola: 69437246 markings, 138500175 edges, 110454 markings/sec, 425 secs
lola: 70068349 markings, 139631797 edges, 126221 markings/sec, 430 secs
lola: 70700733 markings, 140794750 edges, 126477 markings/sec, 435 secs
lola: 71302487 markings, 141938351 edges, 120351 markings/sec, 440 secs
lola: 71912338 markings, 143089217 edges, 121970 markings/sec, 445 secs
lola: 72545551 markings, 144297224 edges, 126643 markings/sec, 450 secs
lola: 73248061 markings, 145640173 edges, 140502 markings/sec, 455 secs
lola: 73777024 markings, 146841089 edges, 105793 markings/sec, 460 secs
lola: 74226973 markings, 147959525 edges, 89990 markings/sec, 465 secs
lola: 74773624 markings, 149197680 edges, 109330 markings/sec, 470 secs
lola: 75567861 markings, 150793684 edges, 158847 markings/sec, 475 secs
lola: 76298391 markings, 152253048 edges, 146106 markings/sec, 480 secs
lola: 76983919 markings, 153604780 edges, 137106 markings/sec, 485 secs
lola: 77651480 markings, 154926831 edges, 133512 markings/sec, 490 secs
lola: 78245708 markings, 156260191 edges, 118846 markings/sec, 495 secs
lola: 78984096 markings, 157734641 edges, 147678 markings/sec, 500 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 559 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 698 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: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-12.sara
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 931 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: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.lola:
state equation: calling and running sara
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1397 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 1397 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 2795 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 2795 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: sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-15.sara.try reading problem file TriangularGrid-PT-4022-CTLCardinality-13.sara.

sara: place or transition ordering is non-deterministic
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: RESULT
lola:
SUMMARY: yes unknown no yes no no yes yes yes yes unknown yes no yes no yes
lola: ========================================
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 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="TriangularGrid-PT-4022"
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/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 irma4mcc-structural"
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 r175-smll-152708746600395"
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 ;