About the Execution of ITS-LoLa for SmallOperatingSystem-PT-MT1024DC0256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15792.070 | 3600000.00 | 1166344.00 | 11658.60 | ?TTFT??TFT?T?TFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389500092.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SmallOperatingSystem-PT-MT1024DC0256, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389500092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.8K Apr 12 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Apr 10 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 05:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 10 05:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 24 05:38 model.pnml
--------------------
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 SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591199399668
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:50:02] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-06-03 15:50:02] [INFO ] Transformed 9 places.
[2020-06-03 15:50:02] [INFO ] Transformed 8 transitions.
[2020-06-03 15:50:02] [INFO ] Parsed PT model containing 9 places and 8 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Finished random walk after 6426 steps, including 0 resets, run visited all 21 properties in 10 ms. (steps per millisecond=642 )
[2020-06-03 15:50:02] [INFO ] Flatten gal took : 25 ms
[2020-06-03 15:50:02] [INFO ] Flatten gal took : 5 ms
[2020-06-03 15:50:02] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 15:50:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SmallOperatingSystem-PT-MT1024DC0256 @ 3570 seconds
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT1024DC0256-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ SmallOperatingSystem-PT-MT1024DC0256
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2457
},
"exit":
{
"localtimelimitreached": false,
"memory": 3208,
"runtime": 3570.000000,
"signal": "User defined signal 1"
},
"result":
{
"preliminary_value": "unknown yes yes no yes unknown unknown yes no yes unknown yes unknown yes no yes "
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: E (F (((NOT(E (F ((1 <= p4)))) AND ((p1 <= 0) OR (p2 <= 0))) AND ((p4 <= 0) OR (p7 <= 0))))) : (A (((((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0)) U (1 <= p4))) AND E (F ((A (F (((1 <= p1) AND (1 <= p2)))) OR (1 <= p7))))) : (E (((p3 <= 0) U (1 <= p3))) AND NOT(A (G (A (G (((1 <= p1) AND (1 <= p2)))))))) : (A ((A (G ((1 <= p8))) U A (G (((1 <= p1) AND (1 <= p2)))))) OR ((1 <= p2) AND (1 <= p5))) : (A (X (A (F (((1 <= p4) AND (1 <= p6)))))) OR E (X ((1 <= p7)))) : E (F ((((A ((((1 <= p5) AND (1 <= p6)) U (1 <= p4))) AND (p4 <= 0)) AND (p7 <= 0)) AND (1 <= p8)))) : A (G (E (F (A (G (((1 <= p2) AND (1 <= p5)))))))) : (NOT(A (G (((1 <= p5) AND (1 <= p6))))) AND NOT(A (G (((1 <= p1) AND (1 <= p2)))))) : NOT(A (F (A (F ((((1 <= p5) AND (1 <= p6)) OR (1 <= p4))))))) : A ((A (F ((1 <= p4))) U ((E (G (((1 <= p5) AND (1 <= p6)))) OR (1 <= p7)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p1) AND (1 <= p2))))) : A (G (E (X (E (X ((1 <= p4))))))) : E (F (((p1 <= 0) OR (p2 <= 0)))) : ((NOT(E ((((1 <= p1) AND (1 <= p2)) U ((1 <= p8))))) OR NOT(E (G (((p2 <= 0) OR (p5 <= 0)))))) OR ((NOT(A (G (((1 <= p1) AND (1 <= p2))))) AND (p4 <= 0)) AND ((p7 <= 0) OR (p3 <= 0)))) : (A (F ((p4 <= 0))) AND NOT(A (F ((1 <= p7))))) : (E (X ((A (X (((1 <= p4) AND (1 <= p6)))) AND A (F ((1 <= p8)))))) AND E (F ((1 <= p4)))) : E ((E (F (((1 <= p7) AND (1 <= p4)))) U (E (F ((1 <= p3))) OR ((1 <= p7) AND (1 <= p8) AND ((p5 <= 0) OR (p6 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (((1 <= p4) AND (1 <= p6)))))) OR E (X ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((1 <= p7))
lola: processed formula length: 13
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p4) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 0) OR (p6 <= 0))
lola: processed formula length: 25
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 256 markings, 255 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (E (X ((1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(EX((1 <= p4))))
lola: processed formula length: 21
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2615634 markings, 6499335 edges, 523127 markings/sec, 0 secs
lola: 5094318 markings, 12673455 edges, 495737 markings/sec, 5 secs
lola: 7523396 markings, 18728127 edges, 485816 markings/sec, 10 secs
lola: 9954175 markings, 24788252 edges, 486156 markings/sec, 15 secs
lola: 12367549 markings, 30806950 edges, 482675 markings/sec, 20 secs
lola: 14687155 markings, 36592088 edges, 463921 markings/sec, 25 secs
lola: 17033064 markings, 42443604 edges, 469182 markings/sec, 30 secs
lola: 19160007 markings, 47750848 edges, 425389 markings/sec, 35 secs
lola: 21388165 markings, 53309138 edges, 445632 markings/sec, 40 secs
lola: 23473965 markings, 58514215 edges, 417160 markings/sec, 45 secs
lola: 25524060 markings, 63629060 edges, 410019 markings/sec, 50 secs
lola: 27872770 markings, 69489409 edges, 469742 markings/sec, 55 secs
lola: 30247609 markings, 75415974 edges, 474968 markings/sec, 60 secs
lola: 32626212 markings, 81352740 edges, 475721 markings/sec, 65 secs
lola: 34954876 markings, 87163886 edges, 465733 markings/sec, 70 secs
lola: 37287282 markings, 92985562 edges, 466481 markings/sec, 75 secs
lola: 39564746 markings, 98669117 edges, 455493 markings/sec, 80 secs
lola: 41860903 markings, 104400819 edges, 459231 markings/sec, 85 secs
lola: 44172354 markings, 110170393 edges, 462290 markings/sec, 90 secs
lola: 46541233 markings, 116062435 edges, 473776 markings/sec, 95 secs
lola: 48718486 markings, 122295436 edges, 435451 markings/sec, 100 secs
lola: 50774481 markings, 128233508 edges, 411199 markings/sec, 105 secs
lola: 52666932 markings, 133696228 edges, 378490 markings/sec, 110 secs
lola: 54662390 markings, 139434567 edges, 399092 markings/sec, 115 secs
lola: 56625437 markings, 145139534 edges, 392609 markings/sec, 120 secs
lola: 58600473 markings, 150895895 edges, 395007 markings/sec, 125 secs
lola: 60570980 markings, 156630090 edges, 394101 markings/sec, 130 secs
lola: 62498107 markings, 162283846 edges, 385425 markings/sec, 135 secs
lola: 64446747 markings, 167941810 edges, 389728 markings/sec, 140 secs
lola: 66368265 markings, 173547278 edges, 384304 markings/sec, 145 secs
lola: 68081817 markings, 178582023 edges, 342710 markings/sec, 150 secs
lola: 69443555 markings, 182551411 edges, 272348 markings/sec, 155 secs
lola: 70727012 markings, 186319715 edges, 256691 markings/sec, 160 secs
lola: 72224514 markings, 190714302 edges, 299500 markings/sec, 165 secs
lola: 73738021 markings, 195146246 edges, 302701 markings/sec, 170 secs
lola: 75467579 markings, 200181790 edges, 345912 markings/sec, 175 secs
lola: 77112859 markings, 205003724 edges, 329056 markings/sec, 180 secs
lola: 78634685 markings, 209464728 edges, 304365 markings/sec, 185 secs
lola: 80264597 markings, 214250851 edges, 325982 markings/sec, 190 secs
lola: 81598367 markings, 218171507 edges, 266754 markings/sec, 195 secs
lola: 83176113 markings, 222815034 edges, 315549 markings/sec, 200 secs
lola: 84207554 markings, 225802822 edges, 206288 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((A (X (((1 <= p4) AND (1 <= p6)))) AND A (F ((1 <= p8)))))) AND E (F ((1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p4)))
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((A (X (((1 <= p4) AND (1 <= p6)))) AND A (F ((1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((AX(((1 <= p4) AND (1 <= p6))) AND AF((1 <= p8))))
lola: processed formula length: 53
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-2-0.sara.
lola: ...considering subproblem: E (F (((p1 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 0) OR (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 257 markings, 256 edges
lola: ========================================
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (G (((1 <= p2) AND (1 <= p5))))))))
lola: ========================================
lola: SUBTASK
lola: checking globally possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:589
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:746
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p5 <= 0))
lola: processed formula length: 25
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p2 <= 0) OR (p5 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: try reading problem file CTLFireability-4-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3560568 markings, 6987564 edges, 712114 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6996331 markings, 13847653 edges, 687153 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 10205886 markings, 20256484 edges, 641911 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 13653503 markings, 27249200 edges, 689523 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 16601461 markings, 34489073 edges, 589592 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 19403200 markings, 41395812 edges, 560348 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 22172426 markings, 48222205 edges, 553845 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 24824114 markings, 54753543 edges, 530338 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 27525494 markings, 61420407 edges, 540276 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 30552004 markings, 68380636 edges, 605302 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 33827753 markings, 75423521 edges, 655150 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 37169929 markings, 82192367 edges, 668435 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 40479613 markings, 89192752 edges, 661937 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 43588366 markings, 96294449 edges, 621751 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 46501105 markings, 102953685 edges, 582548 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 49479738 markings, 109757215 edges, 595727 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 52287805 markings, 116364357 edges, 561613 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 54692194 markings, 122501424 edges, 480878 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 57524391 markings, 129267004 edges, 566439 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 59979143 markings, 135545916 edges, 490950 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 62595276 markings, 141920678 edges, 523227 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 65218846 markings, 148199506 edges, 524714 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 67819329 markings, 154445708 edges, 520097 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 70434753 markings, 160544863 edges, 523085 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 73049745 markings, 166686819 edges, 522998 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 76283861 markings, 173326789 edges, 646823 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 78365098 markings, 178796488 edges, 416247 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 81855258 markings, 185770836 edges, 698032 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 84325896 markings, 191753798 edges, 494128 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 86449340 markings, 197331776 edges, 424689 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 88627496 markings, 202956812 edges, 435631 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 90706074 markings, 208455098 edges, 415716 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 92723100 markings, 213698861 edges, 403405 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 94842444 markings, 219208622 edges, 423869 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 96944147 markings, 224640720 edges, 420341 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 99086482 markings, 230225114 edges, 428467 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 101218943 markings, 235786855 edges, 426492 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 103410885 markings, 241448709 edges, 438388 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 105451540 markings, 246858200 edges, 408131 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 107516710 markings, 252134225 edges, 413034 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 109478526 markings, 257154258 edges, 392363 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 111499195 markings, 262312144 edges, 404134 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 113633831 markings, 267782178 edges, 426927 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 115816374 markings, 273324712 edges, 436509 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 118060110 markings, 278944359 edges, 448747 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 120326768 markings, 284638229 edges, 453332 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 122421217 markings, 290080771 edges, 418890 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 124669267 markings, 295753068 edges, 449610 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 126854920 markings, 301349493 edges, 437131 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 129026798 markings, 306967560 edges, 434376 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 131165350 markings, 312463871 edges, 427710 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 133296267 markings, 317972251 edges, 426183 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 135436532 markings, 323512121 edges, 428053 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 137581651 markings, 329048404 edges, 429024 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 139680923 markings, 334549400 edges, 419854 markings/sec, 270 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown yes unknown unknown no unknown
lola: memory consumption: 13824700 KB
lola: time consumption: 497 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0))))
lola: processed formula length: 49
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p5) AND (1 <= p6)) OR (1 <= p4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 257 markings, 256 edges
lola: ========================================
lola: subprocess 6 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p4 <= 0))) AND (((p1 <= 0) OR (p2 <= 0)) AND ((p4 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p4 <= 0)) AND (((p1 <= 0) OR (p2 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 81
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2406955 markings, 8496857 edges, 481391 markings/sec, 0 secs
lola: 4740896 markings, 16707721 edges, 466788 markings/sec, 5 secs
lola: 7113499 markings, 25047809 edges, 474521 markings/sec, 10 secs
lola: 9437510 markings, 33213130 edges, 464802 markings/sec, 15 secs
lola: 11723743 markings, 41243658 edges, 457247 markings/sec, 20 secs
lola: 13961227 markings, 49101542 edges, 447497 markings/sec, 25 secs
lola: 16162143 markings, 56828867 edges, 440183 markings/sec, 30 secs
lola: 18339592 markings, 64473411 edges, 435490 markings/sec, 35 secs
lola: 20570327 markings, 72304035 edges, 446147 markings/sec, 40 secs
lola: 22795764 markings, 80114273 edges, 445087 markings/sec, 45 secs
lola: 24987329 markings, 87805972 edges, 438313 markings/sec, 50 secs
lola: 27180568 markings, 95502688 edges, 438648 markings/sec, 55 secs
lola: 29347743 markings, 103107126 edges, 433435 markings/sec, 60 secs
lola: 31487171 markings, 110614522 edges, 427886 markings/sec, 65 secs
lola: 33639889 markings, 118167402 edges, 430544 markings/sec, 70 secs
lola: 35805479 markings, 125765494 edges, 433118 markings/sec, 75 secs
lola: 37904336 markings, 133128700 edges, 419771 markings/sec, 80 secs
lola: 40069603 markings, 140724620 edges, 433053 markings/sec, 85 secs
lola: 42176603 markings, 148116710 edges, 421400 markings/sec, 90 secs
lola: 44264335 markings, 155439959 edges, 417546 markings/sec, 95 secs
lola: 46363663 markings, 163231745 edges, 419866 markings/sec, 100 secs
lola: 48364828 markings, 171267919 edges, 400233 markings/sec, 105 secs
lola: 50285758 markings, 178977011 edges, 384186 markings/sec, 110 secs
lola: 52056123 markings, 186057264 edges, 354073 markings/sec, 115 secs
lola: 53826012 markings, 193146406 edges, 353978 markings/sec, 120 secs
lola: 55698282 markings, 200629225 edges, 374454 markings/sec, 125 secs
lola: 57541080 markings, 208018451 edges, 368560 markings/sec, 130 secs
lola: 59265486 markings, 214951870 edges, 344881 markings/sec, 135 secs
lola: 60990091 markings, 221884986 edges, 344921 markings/sec, 140 secs
lola: 62731949 markings, 228879105 edges, 348372 markings/sec, 145 secs
lola: 64426849 markings, 235671083 edges, 338980 markings/sec, 150 secs
lola: 66077384 markings, 242297882 edges, 330107 markings/sec, 155 secs
lola: 67688457 markings, 248771439 edges, 322215 markings/sec, 160 secs
lola: 69434338 markings, 255781784 edges, 349176 markings/sec, 165 secs
lola: 71169052 markings, 262763711 edges, 346943 markings/sec, 170 secs
lola: 72876144 markings, 269613474 edges, 341418 markings/sec, 175 secs
lola: 74532744 markings, 276255509 edges, 331320 markings/sec, 180 secs
lola: 76158896 markings, 282793734 edges, 325230 markings/sec, 185 secs
lola: 77829456 markings, 289515121 edges, 334112 markings/sec, 190 secs
lola: 79495087 markings, 296209212 edges, 333126 markings/sec, 195 secs
lola: 81096204 markings, 302633018 edges, 320223 markings/sec, 200 secs
lola: 82695274 markings, 309061221 edges, 319814 markings/sec, 205 secs
lola: 84289586 markings, 315443432 edges, 318862 markings/sec, 210 secs
lola: 85842003 markings, 321653941 edges, 310483 markings/sec, 215 secs
lola: 87408360 markings, 327930180 edges, 313271 markings/sec, 220 secs
lola: 88963490 markings, 334140690 edges, 311026 markings/sec, 225 secs
lola: 90495918 markings, 340294244 edges, 306486 markings/sec, 230 secs
lola: 92104614 markings, 346727837 edges, 321739 markings/sec, 235 secs
lola: 93684053 markings, 353072084 edges, 315888 markings/sec, 240 secs
lola: 95204461 markings, 359203418 edges, 304082 markings/sec, 245 secs
lola: 96734777 markings, 365354245 edges, 306063 markings/sec, 250 secs
lola: 98320426 markings, 371697834 edges, 317130 markings/sec, 255 secs
lola: 99909897 markings, 378053113 edges, 317894 markings/sec, 260 secs
lola: 101526600 markings, 384543612 edges, 323341 markings/sec, 265 secs
lola: 103090771 markings, 390805757 edges, 312834 markings/sec, 270 secs
lola: 104652602 markings, 397071778 edges, 312366 markings/sec, 275 secs
lola: 106111362 markings, 402938845 edges, 291752 markings/sec, 280 secs
lola: 107613916 markings, 408959908 edges, 300511 markings/sec, 285 secs
lola: 109110414 markings, 414962716 edges, 299300 markings/sec, 290 secs
lola: 110722690 markings, 421468023 edges, 322455 markings/sec, 295 secs
lola: 112077944 markings, 426889556 edges, 271051 markings/sec, 300 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown unknown unknown no unknown unknown yes unknown unknown no unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A ((((1 <= p5) AND (1 <= p6)) U (1 <= p4))) AND ((p4 <= 0) AND ((p7 <= 0) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((A(((1 <= p5) AND (1 <= p6)) U (1 <= p4)) AND ((p4 <= 0) AND ((p7 <= 0) AND (1 <= p8)))))
lola: processed formula length: 92
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2226008 markings, 7824211 edges, 445202 markings/sec, 0 secs
lola: 4321014 markings, 15175882 edges, 419001 markings/sec, 5 secs
lola: 6588061 markings, 23128051 edges, 453409 markings/sec, 10 secs
lola: 8566794 markings, 30067425 edges, 395747 markings/sec, 15 secs
lola: 10464915 markings, 36722858 edges, 379624 markings/sec, 20 secs
lola: 12519667 markings, 43926909 edges, 410950 markings/sec, 25 secs
lola: 14540086 markings, 51010029 edges, 404084 markings/sec, 30 secs
lola: 16646747 markings, 58394834 edges, 421332 markings/sec, 35 secs
lola: 18709621 markings, 65625547 edges, 412575 markings/sec, 40 secs
lola: 20862574 markings, 73172041 edges, 430591 markings/sec, 45 secs
lola: 23057244 markings, 80863924 edges, 438934 markings/sec, 50 secs
lola: 25219714 markings, 88442732 edges, 432494 markings/sec, 55 secs
lola: 27383886 markings, 96027250 edges, 432834 markings/sec, 60 secs
lola: 29495455 markings, 103427236 edges, 422314 markings/sec, 65 secs
lola: 31587456 markings, 110758364 edges, 418400 markings/sec, 70 secs
lola: 33696527 markings, 118149136 edges, 421814 markings/sec, 75 secs
lola: 35781655 markings, 125455947 edges, 417026 markings/sec, 80 secs
lola: 37801658 markings, 132534321 edges, 404001 markings/sec, 85 secs
lola: 39916088 markings, 139943217 edges, 422886 markings/sec, 90 secs
lola: 41994270 markings, 147225246 edges, 415636 markings/sec, 95 secs
lola: 44047559 markings, 154419727 edges, 410658 markings/sec, 100 secs
lola: 46118796 markings, 161822724 edges, 414247 markings/sec, 105 secs
lola: 48176455 markings, 169968708 edges, 411532 markings/sec, 110 secs
lola: 50159577 markings, 177840764 edges, 396624 markings/sec, 115 secs
lola: 52118118 markings, 185600924 edges, 391708 markings/sec, 120 secs
lola: 54032487 markings, 193189962 edges, 382874 markings/sec, 125 secs
lola: 55903728 markings, 200614730 edges, 374248 markings/sec, 130 secs
lola: 57762458 markings, 208000842 edges, 371746 markings/sec, 135 secs
lola: 59580707 markings, 215235705 edges, 363650 markings/sec, 140 secs
lola: 61368022 markings, 222366556 edges, 357463 markings/sec, 145 secs
lola: 63171012 markings, 229544641 edges, 360598 markings/sec, 150 secs
lola: 64931521 markings, 236546927 edges, 352102 markings/sec, 155 secs
lola: 66712280 markings, 243641723 edges, 356152 markings/sec, 160 secs
lola: 68458320 markings, 250629577 edges, 349208 markings/sec, 165 secs
lola: 70201204 markings, 257575891 edges, 348577 markings/sec, 170 secs
lola: 71907596 markings, 264388376 edges, 341278 markings/sec, 175 secs
lola: 73657830 markings, 271366483 edges, 350047 markings/sec, 180 secs
lola: 75417449 markings, 278354546 edges, 351924 markings/sec, 185 secs
lola: 77111504 markings, 285122136 edges, 338811 markings/sec, 190 secs
lola: 78819963 markings, 291939018 edges, 341692 markings/sec, 195 secs
lola: 80565767 markings, 298897019 edges, 349161 markings/sec, 200 secs
lola: 82298858 markings, 305835149 edges, 346618 markings/sec, 205 secs
lola: 84057637 markings, 312837561 edges, 351756 markings/sec, 210 secs
lola: 85830822 markings, 319863470 edges, 354637 markings/sec, 215 secs
lola: 87453561 markings, 326326974 edges, 324548 markings/sec, 220 secs
lola: 89099144 markings, 332844922 edges, 329117 markings/sec, 225 secs
lola: 90549391 markings, 338647307 edges, 290049 markings/sec, 230 secs
lola: 92034058 markings, 344549840 edges, 296933 markings/sec, 235 secs
lola: 93579103 markings, 350698231 edges, 309009 markings/sec, 240 secs
lola: 95025088 markings, 356500444 edges, 289197 markings/sec, 245 secs
lola: 96486871 markings, 362348619 edges, 292357 markings/sec, 250 secs
lola: 97979252 markings, 368283762 edges, 298476 markings/sec, 255 secs
lola: 99460914 markings, 374167928 edges, 296332 markings/sec, 260 secs
lola: 100982253 markings, 380227143 edges, 304268 markings/sec, 265 secs
lola: 102493196 markings, 386257953 edges, 302189 markings/sec, 270 secs
lola: 103986645 markings, 392209013 edges, 298690 markings/sec, 275 secs
lola: 105473758 markings, 398150524 edges, 297423 markings/sec, 280 secs
lola: 106960864 markings, 404077357 edges, 297421 markings/sec, 285 secs
lola: 108429724 markings, 409923191 edges, 293772 markings/sec, 290 secs
lola: 109921451 markings, 415879721 edges, 298345 markings/sec, 295 secs
lola: 111337573 markings, 421549065 edges, 283224 markings/sec, 300 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown unknown unknown no unknown unknown yes unknown unknown no unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((1 <= p4))) U (E (G (((1 <= p5) AND (1 <= p6)))) OR ((1 <= p7) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AF((1 <= p4)) U (EG(((1 <= p5) AND (1 <= p6))) OR ((1 <= p7) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p1) AND (1 <= p2)))))
lola: processed formula length: 122
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 513 markings, 1794 edges
lola: subprocess 9 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (F (((1 <= p7) AND (1 <= p4)))) U (E (F ((1 <= p3))) OR ((1 <= p7) AND (1 <= p8) AND ((p5 <= 0) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((1 <= p7) AND (1 <= p4))) U (EF((1 <= p3)) OR ((1 <= p7) AND (1 <= p8) AND ((p5 <= 0) OR (p6 <= 0)))))
lola: processed formula length: 109
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p4 <= 0))) AND E (G ((p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p7 <= 0)))
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: formula 0: (1 <= p7)
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p3))) AND E (F (((p1 <= 0) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p3)))
lola: processed formula length: 17
lola: sara: try reading problem file CTLFireability-11-0.sara.
43 rewrites
lola: closed formula file CTLFireability.xml
sara: place or transition ordering is non-deterministic
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 12 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 0) OR (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 257 markings, 256 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p5 <= 0) OR (p6 <= 0)))) AND E (F (((p1 <= 0) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 0) OR (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 257 markings, 256 edges
lola: ========================================
lola: subprocess 13 will run for 819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p5 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p5 <= 0) OR (p6 <= 0))))
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p5 <= 0) OR (p6 <= 0))
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: ========================================
lola: subprocess 13 will run for 819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p1) AND (1 <= p2)))) OR ((A (G ((1 <= p8))) AND A (F (A (G (((1 <= p1) AND (1 <= p2))))))) OR ((1 <= p2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p8)))
lola: processed formula length: 17
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
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 14 will run for 1228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 15 will run for 2457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p1) AND (1 <= p2))))
lola: processed formula length: 33
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 0) OR (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 257 markings, 256 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0)) U (1 <= p4))) AND (E (F (((1 <= p1) AND (1 <= p2)))) OR E (F ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p7)))
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 2457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0)) U (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0)) U (1 <= p4)))
lola: processed formula length: 59
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p5 <= 0) OR (p6 <= 0)) AND (p4 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: 0
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 257 markings, 256 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p1 <= 0) OR (p2 <= 0)) R ((p8 <= 0)))) OR (A (F (((1 <= p2) AND (1 <= p5)))) OR (E (F (((p1 <= 0) OR (p2 <= 0)))) AND ((p4 <= 0) AND ((p7 <= 0) OR (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: unknown yes yes no yes unknown unknown yes no yes unknown yes unknown yes no yes
lola:
preliminary result: unknown yes yes no yes unknown unknown yes no yes unknown yes unknown yes no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes yes no yes unknown unknown yes no yes unknown yes unknown yes no yes
lola: memory consumption: 3208 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: memory consumption: 3208 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16298964 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16298460 kB
--------------------
content from 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="SmallOperatingSystem-PT-MT1024DC0256"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is SmallOperatingSystem-PT-MT1024DC0256, 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 r194-csrt-159033389500092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT1024DC0256.tgz
mv SmallOperatingSystem-PT-MT1024DC0256 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;