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 304K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 130K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is SquareGrid-PT-040204, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r163-smll-152705514900186
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527071217868


BK_STOP 1527071814128

--------------------
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 SquareGrid-PT-040204 as instance name.
Using SquareGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', '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': 237226, 'Memory': 2468.39, 'Tool': 'lola'}, {'Time': 253323, 'Memory': 2684.98, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLFireability lola SquareGrid-PT-040204...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
SquareGrid-PT-040204: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ SquareGrid-PT-040204 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 512/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 240 places, 272 transitions, 143 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-040204-CTLFireability.task
lola: NOT(E (F (NOT(E (X (FIREABLE(t4i2_4_2))))))) : E (F ((A (X (NOT FIREABLE(t4i3_2_2))) OR FIREABLE(t2i1_1_4)))) : (E (G (E (F ((FIREABLE(t4o_1_2)))))) AND A (G (NOT(A (G (FIREABLE(t2i1_2_4))))))) : NOT(A (F (A (G (FIREABLE(t4i1_3_4)))))) : A (((NOT FIREABLE(t3o_3_4) OR FIREABLE(t3o_1_3)) U E (G ((FIREABLE(t1o_4_2)))))) : E (F (A (G (FIREABLE(t1i2_2_3))))) : (FIREABLE(t2i3_2_3) OR E (G ((NOT FIREABLE(tf_u_1) OR NOT FIREABLE(t2i3_2_3) OR (NOT FIREABLE(t3i4_3_1) AND NOT FIREABLE(t1i2_1_1)))))) : NOT((A (F (A (G (FIREABLE(t2i1_4_1))))) OR A ((FIREABLE(tf_d_3) U FIREABLE(t1i4_3_1))))) : ((A (F (E (X (FIREABLE(t3i4_4_2))))) OR (NOT(E (X (FIREABLE(t4i3_2_2)))) AND NOT FIREABLE(t2o_3_4))) OR FIREABLE(t1i3_3_3)) : ((E (X ((NOT FIREABLE(t4i3_3_2) AND NOT FIREABLE(t3i4_4_4)))) AND A (X ((FIREABLE(t1i3_1_1) AND (FIREABLE(t1i4_3_3) OR FIREABLE(t1o_3_2)))))) OR A (F (A (X (FIREABLE(t4i1_4_3)))))) : ((A (F (FIREABLE(t4i1_1_3))) AND FIREABLE(t3o_2_1)) OR FIREABLE(t1i3_1_3)) : (FIREABLE(t3o_1_1) AND E (G (E (F ((FIREABLE(tf_u_1) OR FIREABLE(t3i1_2_2))))))) : E (G ((E (X (NOT FIREABLE(t4o_4_1))) OR ((NOT FIREABLE(t3i2_3_3) AND NOT FIREABLE(t4i3_2_4)) OR (NOT FIREABLE(t4i3_1_4) AND NOT FIREABLE(t1i3_3_3)))))) : E (F (E (G (FIREABLE(t2i3_3_1))))) : ((A (G ((FIREABLE(t4i1_1_1) AND FIREABLE(t4o_3_2) AND NOT FIREABLE(t1i4_3_3)))) OR (A (F (FIREABLE(t4i2_3_2))) AND (NOT FIREABLE(t4i3_1_2) AND NOT FIREABLE(t1i2_1_3) AND FIREABLE(t2o_4_3) AND (FIREABLE(t3o_3_2) OR FIREABLE(t1o_2_3))))) OR E ((E (X (FIREABLE(t3o_1_4))) U (FIREABLE(t3i4_4_3) AND FIREABLE(t4i1_4_4) AND (FIREABLE(t1i4_2_4) OR FIREABLE(t4o_2_4)))))) : E (F (E (G (NOT FIREABLE(t4i3_3_3)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (NOT(E (X (FIREABLE(t4i2_4_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(FIREABLE(t4i2_4_2)))))
lola: processed formula length: 42
lola: 10 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 46 markings, 45 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (NOT FIREABLE(t4i3_2_2))) OR FIREABLE(t2i1_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (NOT FIREABLE(t4i3_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(NOT FIREABLE(t4i3_2_2)))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 102 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((FIREABLE(t4o_1_2)))))) AND A (G (NOT(A (G (FIREABLE(t2i1_2_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(t4o_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FIREABLE(t4o_1_2))))))
lola: processed formula length: 49
lola: 5 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 865 markings, 1901 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(t2i1_2_4)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(t2i1_2_4)))))
lola: processed formula length: 52
lola: 5 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 697091 markings, 2632967 edges, 139418 markings/sec, 0 secs
lola: 1277289 markings, 4900940 edges, 116040 markings/sec, 5 secs
lola: 1857687 markings, 7175243 edges, 116080 markings/sec, 10 secs
lola: 2281485 markings, 9238672 edges, 84760 markings/sec, 15 secs
lola: 2639035 markings, 11147740 edges, 71510 markings/sec, 20 secs
lola: 3115803 markings, 13248070 edges, 95354 markings/sec, 25 secs
lola: 3543411 markings, 15265111 edges, 85522 markings/sec, 30 secs
lola: 3952582 markings, 17210346 edges, 81834 markings/sec, 35 secs
lola: 4378949 markings, 19305763 edges, 85273 markings/sec, 40 secs
lola: 4892549 markings, 21136795 edges, 102720 markings/sec, 45 secs
lola: 5376759 markings, 22818801 edges, 96842 markings/sec, 50 secs
lola: 5658703 markings, 24323958 edges, 56389 markings/sec, 55 secs
lola: 6054937 markings, 26199236 edges, 79247 markings/sec, 60 secs
lola: 6621431 markings, 28374023 edges, 113299 markings/sec, 65 secs
lola: 7194947 markings, 30615835 edges, 114703 markings/sec, 70 secs
lola: 7622416 markings, 32691799 edges, 85494 markings/sec, 75 secs
lola: 7966651 markings, 34553958 edges, 68847 markings/sec, 80 secs
lola: 8412804 markings, 36583799 edges, 89231 markings/sec, 85 secs
lola: 8843547 markings, 38562768 edges, 86149 markings/sec, 90 secs
lola: 9262162 markings, 40574239 edges, 83723 markings/sec, 95 secs
lola: 9735963 markings, 42621591 edges, 94760 markings/sec, 100 secs
lola: 10252702 markings, 44396271 edges, 103348 markings/sec, 105 secs
lola: 10652686 markings, 46022561 edges, 79997 markings/sec, 110 secs
lola: 10939075 markings, 47599557 edges, 57278 markings/sec, 115 secs
lola: 11432396 markings, 49629176 edges, 98664 markings/sec, 120 secs
lola: 11952541 markings, 51663155 edges, 104029 markings/sec, 125 secs
lola: 12359134 markings, 53629825 edges, 81319 markings/sec, 130 secs
lola: 12674352 markings, 55332192 edges, 63044 markings/sec, 135 secs
lola: 13070073 markings, 57203592 edges, 79144 markings/sec, 140 secs
lola: 13490875 markings, 59079639 edges, 84160 markings/sec, 145 secs
lola: 13895380 markings, 60979318 edges, 80901 markings/sec, 150 secs
lola: 14359244 markings, 62819622 edges, 92773 markings/sec, 155 secs
lola: 14830532 markings, 64435289 edges, 94258 markings/sec, 160 secs
lola: 15177601 markings, 65926493 edges, 69414 markings/sec, 165 secs
lola: 15446120 markings, 67409108 edges, 53704 markings/sec, 170 secs
lola: 15961313 markings, 69480550 edges, 103039 markings/sec, 175 secs
lola: 16395686 markings, 71465461 edges, 86875 markings/sec, 180 secs
lola: 16772948 markings, 73308438 edges, 75452 markings/sec, 185 secs
lola: 17105979 markings, 75145142 edges, 66606 markings/sec, 190 secs
lola: 17552249 markings, 77078606 edges, 89254 markings/sec, 195 secs
lola: 18004639 markings, 79063107 edges, 90478 markings/sec, 200 secs
lola: 18497882 markings, 80841012 edges, 98649 markings/sec, 205 secs
lola: 18955233 markings, 82484001 edges, 91470 markings/sec, 210 secs
lola: 19231464 markings, 83983547 edges, 55246 markings/sec, 215 secs
lola: 19627842 markings, 85726484 edges, 79276 markings/sec, 220 secs
lola: 20062379 markings, 87606085 edges, 86907 markings/sec, 225 secs
lola: 20469530 markings, 89529599 edges, 81430 markings/sec, 230 secs
lola: 20971353 markings, 91380794 edges, 100365 markings/sec, 235 secs
lola: 21454437 markings, 93036426 edges, 96617 markings/sec, 240 secs
lola: 21793479 markings, 94550424 edges, 67808 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G (FIREABLE(t4i1_3_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT FIREABLE(t4i1_3_4)))))
lola: processed formula length: 52
lola: 7 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 417 markings, 941 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t3o_3_4) OR FIREABLE(t3o_1_3)) U E (G ((FIREABLE(t1o_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NOT FIREABLE(t3o_3_4) OR FIREABLE(t3o_1_3)) U NOT(A(TRUE U (NOT FIREABLE(t1o_4_2)))))
lola: processed formula length: 89
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 431 markings, 432 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t1i2_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U NOT FIREABLE(t1i2_2_3))))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 806418 markings, 2990985 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1485840 markings, 5636224 edges, 135884 markings/sec, 5 secs
lola: 2117990 markings, 8191323 edges, 126430 markings/sec, 10 secs
lola: 2579098 markings, 10331422 edges, 92222 markings/sec, 15 secs
lola: 3239227 markings, 12801826 edges, 132026 markings/sec, 20 secs
lola: 3802695 markings, 15333693 edges, 112694 markings/sec, 25 secs
lola: 4433266 markings, 17756767 edges, 126114 markings/sec, 30 secs
lola: 5040912 markings, 20164967 edges, 121529 markings/sec, 35 secs
lola: 5618411 markings, 22469260 edges, 115500 markings/sec, 40 secs
lola: 6208808 markings, 24794930 edges, 118079 markings/sec, 45 secs
lola: 6689381 markings, 26930473 edges, 96115 markings/sec, 50 secs
lola: 7074015 markings, 28878948 edges, 76927 markings/sec, 55 secs
lola: 7533462 markings, 30718607 edges, 91889 markings/sec, 60 secs
lola: 7861929 markings, 32648481 edges, 65693 markings/sec, 65 secs
lola: 8405109 markings, 34857097 edges, 108636 markings/sec, 70 secs
lola: 8905291 markings, 36846748 edges, 100036 markings/sec, 75 secs
lola: 9294191 markings, 38665053 edges, 77780 markings/sec, 80 secs
lola: 9660167 markings, 40595806 edges, 73195 markings/sec, 85 secs
lola: 10048524 markings, 42396020 edges, 77671 markings/sec, 90 secs
lola: 10341603 markings, 44187861 edges, 58616 markings/sec, 95 secs
lola: 10538628 markings, 45920098 edges, 39405 markings/sec, 100 secs
lola: 10944097 markings, 47781559 edges, 81094 markings/sec, 105 secs
lola: 11403433 markings, 49817183 edges, 91867 markings/sec, 110 secs
lola: 11764406 markings, 51832502 edges, 72195 markings/sec, 115 secs
lola: 12052837 markings, 53513972 edges, 57686 markings/sec, 120 secs
lola: 12419057 markings, 55272651 edges, 73244 markings/sec, 125 secs
lola: 12821867 markings, 57114517 edges, 80562 markings/sec, 130 secs
lola: 13239764 markings, 59012109 edges, 83579 markings/sec, 135 secs
lola: 13634255 markings, 60813576 edges, 78898 markings/sec, 140 secs
lola: 14226277 markings, 62757035 edges, 118404 markings/sec, 145 secs
lola: 14819586 markings, 64641826 edges, 118662 markings/sec, 150 secs
lola: 15357695 markings, 66438124 edges, 107622 markings/sec, 155 secs
lola: 15774617 markings, 68273673 edges, 83384 markings/sec, 160 secs
lola: 16115596 markings, 69876247 edges, 68196 markings/sec, 165 secs
lola: 16393763 markings, 71422211 edges, 55633 markings/sec, 170 secs
lola: 16672304 markings, 73006381 edges, 55708 markings/sec, 175 secs
lola: 17284152 markings, 75596859 edges, 122370 markings/sec, 180 secs
lola: 17955221 markings, 78232870 edges, 134214 markings/sec, 185 secs
lola: 18615535 markings, 80743824 edges, 132063 markings/sec, 190 secs
lola: 19204474 markings, 83083553 edges, 117788 markings/sec, 195 secs
lola: 19830953 markings, 85487906 edges, 125296 markings/sec, 200 secs
lola: 20347448 markings, 87791634 edges, 103299 markings/sec, 205 secs
lola: 20911398 markings, 89995014 edges, 112790 markings/sec, 210 secs
lola: 21419608 markings, 92140715 edges, 101642 markings/sec, 215 secs
lola: 21858615 markings, 94114444 edges, 87801 markings/sec, 220 secs
lola: 22253430 markings, 95994852 edges, 78963 markings/sec, 225 secs
lola: 22591178 markings, 97718478 edges, 67550 markings/sec, 230 secs
lola: 23109792 markings, 99823322 edges, 103723 markings/sec, 235 secs
lola: 23643059 markings, 101914807 edges, 106653 markings/sec, 240 secs
lola: 24022728 markings, 103778814 edges, 75934 markings/sec, 245 secs
lola: 24408548 markings, 105744907 edges, 77164 markings/sec, 250 secs
lola: 24789273 markings, 107526406 edges, 76145 markings/sec, 255 secs
lola: 25048654 markings, 109279036 edges, 51876 markings/sec, 260 secs
lola: 25268158 markings, 111011049 edges, 43901 markings/sec, 265 secs
lola: 25724337 markings, 113043932 edges, 91236 markings/sec, 270 secs
lola: 26128534 markings, 114982940 edges, 80839 markings/sec, 275 secs
lola: 26518536 markings, 116873335 edges, 78000 markings/sec, 280 secs
lola: 26839402 markings, 118610021 edges, 64173 markings/sec, 285 secs
lola: 27149884 markings, 120303088 edges, 62096 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t2i3_2_3) OR E (G ((NOT FIREABLE(tf_u_1) OR NOT FIREABLE(t2i3_2_3) OR (NOT FIREABLE(t3i4_3_1) AND NOT FIREABLE(t1i2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t2i3_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t2i3_2_3)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(tf_u_1) OR NOT FIREABLE(t2i3_2_3) OR (NOT FIREABLE(t3i4_3_1) AND NOT FIREABLE(t1i2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(tf_u_1) AND FIREABLE(t2i3_2_3) AND (FIREABLE(t3i4_3_1) OR FIREABLE(t1i2_1_1)))))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 578 markings, 578 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (A (G (FIREABLE(t2i1_4_1))))) OR A ((FIREABLE(tf_d_3) U FIREABLE(t1i4_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (NOT FIREABLE(t2i1_4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT FIREABLE(t2i1_4_1)))))
lola: processed formula length: 52
lola: 12 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 424 markings, 848 edges
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(tf_d_3) R NOT FIREABLE(t1i4_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(FIREABLE(tf_d_3) U FIREABLE(t1i4_3_1)))
lola: processed formula length: 45
lola: 13 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (E (X (FIREABLE(t3i4_4_2))))) OR (NOT(E (X (FIREABLE(t4i3_2_2)))) AND NOT FIREABLE(t2o_3_4))) OR FIREABLE(t1i3_3_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (FIREABLE(t3i4_4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(FIREABLE(t3i4_4_2)))
lola: processed formula length: 32
lola: 6 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 660 markings, 660 edges
lola: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(t4i3_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(t4i3_2_2)))
lola: processed formula: A (X (NOT FIREABLE(t4i3_2_2)))
lola: processed formula length: 30
lola: 4 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 576 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 652 markings, 652 edges
lola: ========================================
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1i3_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1i3_3_3)
lola: processed formula length: 18
lola: 4 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 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 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X ((NOT FIREABLE(t4i3_3_2) AND NOT FIREABLE(t3i4_4_4)))) AND A (X ((FIREABLE(t1i3_1_1) AND (FIREABLE(t1i4_3_3) OR FIREABLE(t1o_3_2)))))) OR A (F (A (X (FIREABLE(t4i1_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((NOT FIREABLE(t4i3_3_2) AND NOT FIREABLE(t3i4_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT FIREABLE(t4i3_3_2) AND NOT FIREABLE(t3i4_4_4)))
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: subprocess 10 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t1i3_1_1) AND (FIREABLE(t1i4_3_3) OR FIREABLE(t1o_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(t1i3_1_1) AND (FIREABLE(t1i4_3_3) OR FIREABLE(t1o_3_2)))))
lola: processed formula: A (X ((FIREABLE(t1i3_1_1) AND (FIREABLE(t1i4_3_3) OR FIREABLE(t1o_3_2)))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 576 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 641 markings, 641 edges
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (FIREABLE(t4i1_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(FIREABLE(t4i1_4_3)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 641 markings, 641 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(t4i1_1_3))) AND FIREABLE(t3o_2_1)) OR FIREABLE(t1i3_1_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t4i1_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t4i1_1_3)))
lola: processed formula: A (F (FIREABLE(t4i1_1_3)))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 576 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: 638 markings, 643 edges
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1i3_1_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1i3_1_3)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 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 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t3o_1_1) AND E (G (E (F ((FIREABLE(tf_u_1) OR FIREABLE(t3i1_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t3o_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t3o_1_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(tf_u_1) OR FIREABLE(t3i1_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FIREABLE(tf_u_1) OR FIREABLE(t3i1_2_2))))))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 93960 markings, 116810 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X (NOT FIREABLE(t4o_4_1))) OR ((NOT FIREABLE(t3i2_3_3) AND NOT FIREABLE(t4i3_2_4)) OR (NOT FIREABLE(t4i3_1_4) AND NOT FIREABLE(t1i3_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(EX(NOT FIREABLE(t4o_4_1))) AND ((FIREABLE(t3i2_3_3) OR FIREABLE(t4i3_2_4)) AND (FIREABLE(t4i3_1_4) OR FIREABLE(t1i3_3_3))))))
lola: processed formula length: 145
lola: 4 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 641 markings, 641 edges
lola: ========================================
lola: subprocess 13 will run for 996 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t2i3_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT FIREABLE(t2i3_3_1))))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 92538 markings, 207376 edges
lola: ========================================
lola: subprocess 14 will run for 1494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(t4i1_1_1) AND FIREABLE(t4o_3_2) AND NOT FIREABLE(t1i4_3_3)))) OR (A (F (FIREABLE(t4i2_3_2))) AND (NOT FIREABLE(t4i3_1_2) AND NOT FIREABLE(t1i2_1_3) AND FIREABLE(t2o_4_3) AND (FIREABLE(t3o_3_2) OR FIREABLE(t1o_2_3))))) OR E ((E (X (FIREABLE(t3o_1_4))) U (FIREABLE(t3i4_4_3) AND FIREABLE(t4i1_4_4) AND (FIREABLE(t1i4_2_4) OR FIREABLE(t4o_2_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4i1_1_1) AND FIREABLE(t4o_3_2) AND NOT FIREABLE(t1i4_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2989 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t4i2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t4i2_3_2)))
lola: processed formula: A (F (FIREABLE(t4i2_3_2)))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 576 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: 657 markings, 660 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: 'V'
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2988 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (NOT FIREABLE(t4i3_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U FIREABLE(t4i3_3_3))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 448 markings, 449 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown yes yes unknown yes yes no no no yes yes yes unknown yes
FORMULA SquareGrid-PT-040204-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-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="SquareGrid-PT-040204"
export BK_EXAMINATION="CTLFireability"
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/SquareGrid-PT-040204.tgz
mv SquareGrid-PT-040204 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 SquareGrid-PT-040204, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r163-smll-152705514900186"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;