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)
...............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is DES-PT-20a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309100265
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20a-CTLFireability-0
FORMULA_NAME DES-PT-20a-CTLFireability-1
FORMULA_NAME DES-PT-20a-CTLFireability-10
FORMULA_NAME DES-PT-20a-CTLFireability-11
FORMULA_NAME DES-PT-20a-CTLFireability-12
FORMULA_NAME DES-PT-20a-CTLFireability-13
FORMULA_NAME DES-PT-20a-CTLFireability-14
FORMULA_NAME DES-PT-20a-CTLFireability-15
FORMULA_NAME DES-PT-20a-CTLFireability-2
FORMULA_NAME DES-PT-20a-CTLFireability-3
FORMULA_NAME DES-PT-20a-CTLFireability-4
FORMULA_NAME DES-PT-20a-CTLFireability-5
FORMULA_NAME DES-PT-20a-CTLFireability-6
FORMULA_NAME DES-PT-20a-CTLFireability-7
FORMULA_NAME DES-PT-20a-CTLFireability-8
FORMULA_NAME DES-PT-20a-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1494627688391


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ DES-PT-20a @ 3540 seconds
----- 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: 347/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 152 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 177 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20a-CTLFireability.task
lola: E (F (E (F (FIREABLE(t49))))) : A (F (FIREABLE(t67))) : A (((FIREABLE(t110) OR FIREABLE(t35) OR NOT FIREABLE(t3) OR FIREABLE(t142)) U (((FIREABLE(t123) OR FIREABLE(t115)) AND (FIREABLE(t36) OR FIREABLE(t10))) AND E (G (FIREABLE(t13)))))) : A (G (NOT FIREABLE(t103))) : A (F ((A (F ((FIREABLE(t63) AND FIREABLE(t15)))) AND E (X ((FIREABLE(t112) AND FIREABLE(t111))))))) : NOT((A (F ((FIREABLE(t8) AND NOT FIREABLE(t125)))) AND (NOT(E (F (FIREABLE(t53)))) AND ((NOT FIREABLE(t97) OR NOT FIREABLE(t56)) OR A (G (FIREABLE(t122))))))) : A (G ((A (X ((FIREABLE(t72) OR FIREABLE(t54)))) OR A (F ((FIREABLE(t123) AND FIREABLE(t43))))))) : (E ((E (G (FIREABLE(t147))) U FIREABLE(t85))) OR NOT((A (G (NOT FIREABLE(t52))) OR A ((FIREABLE(t109) U FIREABLE(t82)))))) : NOT(A (F (A (F ((FIREABLE(t112) AND FIREABLE(t145))))))) : E (X ((E (F (FIREABLE(t142))) OR ((FIREABLE(t36) OR FIREABLE(t43)) AND (NOT FIREABLE(t43) OR FIREABLE(t151)))))) : (E (F (FIREABLE(t17))) AND A (F ((A (G (FIREABLE(t150))) OR E (G (FIREABLE(t53))))))) : (FIREABLE(t126) OR A (F (FIREABLE(t67)))) : A (F (A (G (A (F (FIREABLE(t28))))))) : (((E (F (NOT FIREABLE(t121))) AND A (G (NOT FIREABLE(t82)))) OR A (((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15)))) AND NOT((A ((FIREABLE(t71) U FIREABLE(t5))) OR FIREABLE(t100)))) : (E (G (NOT FIREABLE(t27))) OR (E (((FIREABLE(t47) OR FIREABLE(t118)) U (FIREABLE(t140) AND FIREABLE(t86)))) AND FIREABLE(t89))) : E (F (FIREABLE(t27)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (FIREABLE(t49)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t67)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t67))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t110) OR FIREABLE(t35) OR NOT FIREABLE(t3) OR FIREABLE(t142)) U (((FIREABLE(t123) OR FIREABLE(t115)) AND (FIREABLE(t36) OR FIREABLE(t10))) AND E (G (FIREABLE(t13))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(t110) OR FIREABLE(t35) OR NOT FIREABLE(t3) OR FIREABLE(t142)) U (((FIREABLE(t123) OR FIREABLE(t115)) AND (FIREABLE(t36) OR FIREABLE(t10))) AND NOT(A(TRUE U NOT FIREABLE(t13)))))
lola: processed formula length: 194
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t103)))
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 20 bytes per marking, with 24 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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((FIREABLE(t63) AND FIREABLE(t15)))) AND E (X ((FIREABLE(t112) AND FIREABLE(t111)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (FIREABLE(t63) AND FIREABLE(t15))) AND EX((FIREABLE(t112) AND FIREABLE(t111)))))
lola: processed formula length: 99
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((FIREABLE(t8) AND NOT FIREABLE(t125)))) AND (NOT(E (F (FIREABLE(t53)))) AND ((NOT FIREABLE(t97) OR NOT FIREABLE(t56)) OR A (G (FIREABLE(t122)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t8) OR FIREABLE(t125))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t8) AND NOT FIREABLE(t125))))
lola: processed formula length: 52
lola: 18 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t53)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((FIREABLE(t72) OR FIREABLE(t54)))) OR A (F ((FIREABLE(t123) AND FIREABLE(t43)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(AX((FIREABLE(t72) OR FIREABLE(t54)))) AND NOT(A(TRUE U (FIREABLE(t123) AND FIREABLE(t43)))))))
lola: processed formula length: 113
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((E (G (FIREABLE(t147))) U FIREABLE(t85))) OR NOT((A (G (NOT FIREABLE(t52))) OR A ((FIREABLE(t109) U FIREABLE(t82))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G (FIREABLE(t147))) U FIREABLE(t85)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U NOT FIREABLE(t147))) U FIREABLE(t85))
lola: processed formula length: 52
lola: 11 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t52)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t109) R NOT FIREABLE(t82)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(FIREABLE(t109) U FIREABLE(t82)))
lola: processed formula length: 38
lola: 11 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (F ((FIREABLE(t112) AND FIREABLE(t145)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t112) AND FIREABLE(t145))))
lola: processed formula length: 50
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((E (F (FIREABLE(t142))) OR ((FIREABLE(t36) OR FIREABLE(t43)) AND (NOT FIREABLE(t43) OR FIREABLE(t151))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t142)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U FIREABLE(t142)))
lola: processed formula length: 28
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 444948 markings, 3234624 edges, 88990 markings/sec, 0 secs
lola: 793940 markings, 6171831 edges, 69798 markings/sec, 5 secs
lola: 1190195 markings, 9328728 edges, 79251 markings/sec, 10 secs
lola: 1586683 markings, 12364025 edges, 79298 markings/sec, 15 secs
lola: 2008416 markings, 15241545 edges, 84347 markings/sec, 20 secs
lola: 2418144 markings, 18382269 edges, 81946 markings/sec, 25 secs
lola: 2780396 markings, 21345414 edges, 72450 markings/sec, 30 secs
lola: 3134180 markings, 24219010 edges, 70757 markings/sec, 35 secs
lola: 3509824 markings, 27127861 edges, 75129 markings/sec, 40 secs
lola: 3904663 markings, 30129622 edges, 78968 markings/sec, 45 secs
lola: 4252077 markings, 32979706 edges, 69483 markings/sec, 50 secs
lola: 4593996 markings, 35747268 edges, 68384 markings/sec, 55 secs
lola: 4955060 markings, 38533816 edges, 72213 markings/sec, 60 secs
lola: 5339455 markings, 41482044 edges, 76879 markings/sec, 65 secs
lola: 5678698 markings, 44279150 edges, 67849 markings/sec, 70 secs
lola: 6025246 markings, 47003463 edges, 69310 markings/sec, 75 secs
lola: 6356357 markings, 49696450 edges, 66222 markings/sec, 80 secs
lola: 6746417 markings, 52600393 edges, 78012 markings/sec, 85 secs
lola: 7072664 markings, 55349886 edges, 65249 markings/sec, 90 secs
lola: 7423807 markings, 58066926 edges, 70229 markings/sec, 95 secs
lola: 7732751 markings, 60692433 edges, 61789 markings/sec, 100 secs
lola: 8118583 markings, 63514965 edges, 77166 markings/sec, 105 secs
lola: 8458275 markings, 66237791 edges, 67938 markings/sec, 110 secs
lola: 8797062 markings, 68910914 edges, 67757 markings/sec, 115 secs
lola: 9093448 markings, 71478688 edges, 59277 markings/sec, 120 secs
lola: 9464522 markings, 74220446 edges, 74215 markings/sec, 125 secs
lola: 9819249 markings, 76918715 edges, 70945 markings/sec, 130 secs
lola: 10143306 markings, 79542442 edges, 64811 markings/sec, 135 secs
lola: 10457266 markings, 82103951 edges, 62792 markings/sec, 140 secs
lola: 10787100 markings, 84662948 edges, 65967 markings/sec, 145 secs
lola: 11144888 markings, 87376523 edges, 71558 markings/sec, 150 secs
lola: 11452907 markings, 89964927 edges, 61604 markings/sec, 155 secs
lola: 11784603 markings, 92523724 edges, 66339 markings/sec, 160 secs
lola: 12069971 markings, 95003137 edges, 57074 markings/sec, 165 secs
lola: 12422315 markings, 97623318 edges, 70469 markings/sec, 170 secs
lola: 12760080 markings, 100186258 edges, 67553 markings/sec, 175 secs
lola: 13070531 markings, 102684308 edges, 62090 markings/sec, 180 secs
lola: 13373294 markings, 105126489 edges, 60553 markings/sec, 185 secs
lola: 13659352 markings, 107491619 edges, 57212 markings/sec, 190 secs
lola: 14008127 markings, 110037504 edges, 69755 markings/sec, 195 secs
lola: 14309591 markings, 112494282 edges, 60293 markings/sec, 200 secs
lola: 14618526 markings, 114909614 edges, 61787 markings/sec, 205 secs
lola: 14898182 markings, 117283766 edges, 55931 markings/sec, 210 secs
lola: 15217811 markings, 119673465 edges, 63926 markings/sec, 215 secs
lola: 15542825 markings, 122147953 edges, 65003 markings/sec, 220 secs
lola: 15831571 markings, 124565959 edges, 57749 markings/sec, 225 secs
lola: 16139791 markings, 126972379 edges, 61644 markings/sec, 230 secs
lola: 16408065 markings, 129307041 edges, 53655 markings/sec, 235 secs
lola: 16736099 markings, 131709511 edges, 65607 markings/sec, 240 secs
lola: 17054967 markings, 134103091 edges, 63774 markings/sec, 245 secs
lola: 17332800 markings, 136467957 edges, 55567 markings/sec, 250 secs
lola: 17642197 markings, 138835140 edges, 61879 markings/sec, 255 secs
lola: 17903751 markings, 141123140 edges, 52311 markings/sec, 260 secs
lola: 18268298 markings, 143831516 edges, 72909 markings/sec, 265 secs
lola: 18650175 markings, 146778085 edges, 76375 markings/sec, 270 secs
lola: 19008710 markings, 149612126 edges, 71707 markings/sec, 275 secs
lola: 19325009 markings, 152340497 edges, 63260 markings/sec, 280 secs
lola: 19715651 markings, 155265029 edges, 78128 markings/sec, 285 secs
lola: 20099249 markings, 158223880 edges, 76720 markings/sec, 290 secs
lola: 20456897 markings, 161062831 edges, 71530 markings/sec, 295 secs
lola: 20779416 markings, 163818246 edges, 64504 markings/sec, 300 secs
lola: 21167901 markings, 166728843 edges, 77697 markings/sec, 305 secs
lola: 21550746 markings, 169680089 edges, 76569 markings/sec, 310 secs
lola: 21904733 markings, 172508734 edges, 70797 markings/sec, 315 secs
lola: 22228440 markings, 175240795 edges, 64741 markings/sec, 320 secs
lola: 22607698 markings, 178121633 edges, 75852 markings/sec, 325 secs
lola: 22995097 markings, 181075878 edges, 77480 markings/sec, 330 secs
lola: 23342490 markings, 183894065 edges, 69479 markings/sec, 335 secs
lola: 23673998 markings, 186634486 edges, 66302 markings/sec, 340 secs
lola: 24043443 markings, 189481950 edges, 73889 markings/sec, 345 secs
lola: 24432496 markings, 192439036 edges, 77811 markings/sec, 350 secs
lola: 24779529 markings, 195270817 edges, 69407 markings/sec, 355 secs
lola: 25115524 markings, 198007320 edges, 67199 markings/sec, 360 secs
lola: 25462814 markings, 200816049 edges, 69458 markings/sec, 365 secs
lola: 25841114 markings, 203778193 edges, 75660 markings/sec, 370 secs
lola: 26210695 markings, 206669524 edges, 73916 markings/sec, 375 secs
lola: 26530753 markings, 209419671 edges, 64012 markings/sec, 380 secs
lola: 26943368 markings, 212427817 edges, 82523 markings/sec, 385 secs
lola: 27297877 markings, 215416083 edges, 70902 markings/sec, 390 secs
lola: 27610804 markings, 218212248 edges, 62585 markings/sec, 395 secs
lola: 27883595 markings, 220963137 edges, 54558 markings/sec, 400 secs
lola: 28175750 markings, 223671916 edges, 58431 markings/sec, 405 secs
lola: 28430114 markings, 226379749 edges, 50873 markings/sec, 410 secs
lola: 28692499 markings, 229027626 edges, 52477 markings/sec, 415 secs
lola: 28932722 markings, 231593657 edges, 48045 markings/sec, 420 secs
lola: 29220186 markings, 234331253 edges, 57493 markings/sec, 425 secs
lola: 29520471 markings, 237052709 edges, 60057 markings/sec, 430 secs
lola: 29889066 markings, 239983696 edges, 73719 markings/sec, 435 secs
lola: 30189194 markings, 242822316 edges, 60026 markings/sec, 440 secs
lola: 30480968 markings, 245466314 edges, 58355 markings/sec, 445 secs
lola: 30767087 markings, 248166872 edges, 57224 markings/sec, 450 secs
lola: 31164302 markings, 251312011 edges, 79443 markings/sec, 455 secs
lola: 31595394 markings, 254392065 edges, 86218 markings/sec, 460 secs
lola: 31972678 markings, 257313684 edges, 75457 markings/sec, 465 secs
lola: 32372897 markings, 260237506 edges, 80044 markings/sec, 470 secs
lola: 32721213 markings, 263199730 edges, 69663 markings/sec, 475 secs
lola: 33061970 markings, 266196969 edges, 68151 markings/sec, 480 secs
lola: 33376982 markings, 268963240 edges, 63002 markings/sec, 485 secs
lola: 33653093 markings, 271690306 edges, 55222 markings/sec, 490 secs
lola: 33961598 markings, 274474546 edges, 61701 markings/sec, 495 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 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t17))) AND A (F ((A (G (FIREABLE(t150))) OR E (G (FIREABLE(t53)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t17)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (FIREABLE(t150))) OR E (G (FIREABLE(t53))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U NOT FIREABLE(t150))) OR NOT(A(TRUE U NOT FIREABLE(t53)))))
lola: processed formula length: 81
lola: 5 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t126) OR A (F (FIREABLE(t67))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t126)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t126)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t67)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t67))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (A (F (FIREABLE(t28)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT(A(TRUE U FIREABLE(t28))))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F (NOT FIREABLE(t121))) AND A (G (NOT FIREABLE(t82)))) OR A (((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15)))) AND NOT((A ((FIREABLE(t71) U FIREABLE(t5))) OR FIREABLE(t100))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t121)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t82)))
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 20 bytes per marking, with 24 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: ========================================
lola: subprocess 15 will run for 3035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15))
lola: processed formula length: 54
lola: 7 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (NOT FIREABLE(t27))) OR (E (((FIREABLE(t47) OR FIREABLE(t118)) U (FIREABLE(t140) AND FIREABLE(t86)))) AND FIREABLE(t89)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: lola: RUNNING
========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t27)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t27)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t27)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes no no no no yes no yes yes unknown no no no no yes yes
lola: ========================================
FORMULA DES-PT-20a-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494628194003

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DES-PT-20a, 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 r018-ebro-149436309100265"
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 ;