Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900277
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526843179539

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0200 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0200 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2602/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 32032
lola: finding significant places
lola: 1001 places, 1601 transitions, 800 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1801 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0200-CTLFireability.task
lola: A (((FIREABLE(t1266) OR FIREABLE(t1247) OR FIREABLE(t180) OR FIREABLE(t1415) OR FIREABLE(t438)) U E (G ((FIREABLE(t1475) AND FIREABLE(t1347)))))) : ((A (F (E (G (FIREABLE(t564))))) AND (NOT FIREABLE(t1570) OR NOT FIREABLE(t255))) AND (NOT((A (X (FIREABLE(t1353))) OR A (F (FIREABLE(t313))))) AND (NOT FIREABLE(t243) OR FIREABLE(t1442)))) : NOT(A (F (A (G (FIREABLE(t1373)))))) : NOT(E (X (NOT(A (X (FIREABLE(t1514))))))) : A (F (E (G ((NOT FIREABLE(t1449) OR NOT FIREABLE(t329)))))) : (A (X (NOT(A (X (FIREABLE(t698)))))) OR ((FIREABLE(t1174) OR (E (F (FIREABLE(t1217))) OR FIREABLE(t1393))) OR A (G ((FIREABLE(t1198) OR FIREABLE(t468) OR (FIREABLE(t22) AND FIREABLE(t149))))))) : A (F ((FIREABLE(t1235) AND FIREABLE(t209)))) : (E (G (((FIREABLE(t198) OR FIREABLE(t1248) OR NOT FIREABLE(t520)) AND (NOT FIREABLE(t1469) OR (FIREABLE(t1245) AND FIREABLE(t901)))))) AND A (F (E (G (FIREABLE(t200)))))) : (((FIREABLE(t862) AND FIREABLE(t1396) AND FIREABLE(t806)) AND NOT(A (F (NOT FIREABLE(t879))))) OR A (F (FIREABLE(t568)))) : ((E (F (E (F (FIREABLE(t1269))))) AND (NOT FIREABLE(t1246) OR (E (F (FIREABLE(t1026))) OR (FIREABLE(t1034) AND FIREABLE(t378) AND (FIREABLE(t1414) OR FIREABLE(t859)))))) OR ((A (G (FIREABLE(t1366))) AND (A (G (FIREABLE(t1509))) OR E (F (FIREABLE(t300))))) AND FIREABLE(t1303))) : (A (X ((FIREABLE(t1271) AND FIREABLE(t968) AND FIREABLE(t116) AND (NOT FIREABLE(t1122) OR (FIREABLE(t537) AND FIREABLE(t1045)))))) OR E ((A (F (FIREABLE(t1186))) U (NOT FIREABLE(t229) AND NOT FIREABLE(t1098))))) : E ((E (G (FIREABLE(t507))) U A (F ((FIREABLE(t865) AND FIREABLE(t1398)))))) : NOT(E (F (((NOT FIREABLE(t1140) OR NOT FIREABLE(t44)) AND A (F (FIREABLE(t385))))))) : A (G (FIREABLE(t858))) : E (F (FIREABLE(t273))) : ((((FIREABLE(t255) AND FIREABLE(t497) AND NOT FIREABLE(t1445)) OR (FIREABLE(t750) AND FIREABLE(t357) AND NOT FIREABLE(t928))) AND FIREABLE(t1387) AND NOT FIREABLE(t1088) AND NOT FIREABLE(t795)) OR A (((NOT FIREABLE(t577) OR NOT FIREABLE(t852)) U E (G (FIREABLE(t642))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 (F (E (G (FIREABLE(t564))))) AND ((NOT FIREABLE(t1570) OR NOT FIREABLE(t255)) AND (E (X (NOT FIREABLE(t1353))) AND (E (G (NOT FIREABLE(t313))) AND (NOT FIREABLE(t243) OR FIREABLE(t1442))))))
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: (NOT FIREABLE(t243) OR FIREABLE(t1442))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t243) OR FIREABLE(t1442))
lola: processed formula length: 40
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t1570) OR NOT FIREABLE(t255))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t1570) OR NOT FIREABLE(t255))
lola: processed formula length: 44
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t313)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(t313)))
lola: processed formula length: 26
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (FIREABLE(t564)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(t564))))
lola: processed formula length: 43
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(t1353)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(NOT FIREABLE(t1353))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (FIREABLE(t1514)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(AX(FIREABLE(t1514)))
lola: processed formula length: 23
lola: 41 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (X (NOT FIREABLE(t698))))) OR (FIREABLE(t1174) OR (E (F (FIREABLE(t1217))) OR (FIREABLE(t1393) OR A (G ((FIREABLE(t1198) OR FIREABLE(t468) OR (FIREABLE(t22) AND FIREABLE(t149)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1393)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1393)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1174)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1174)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1217)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t1217)))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t1217)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-CTLFireability-4-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: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((FIREABLE(t1271) AND FIREABLE(t968) AND FIREABLE(t116) AND (NOT FIREABLE(t1122) OR (FIREABLE(t537) AND FIREABLE(t1045)))))) OR E ((A (F (FIREABLE(t1186))) U (NOT FIREABLE(t229) AND NOT FIREABLE(t1098)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: (AX((FIREABLE(t1271) AND FIREABLE(t968) AND FIREABLE(t116) AND (NOT FIREABLE(t1122) OR (FIREABLE(t537) AND FIREABLE(t1045))))) OR E(A(TRUE U FIREABLE(t1186)) U (NOT FIREABLE(t229) AND NOT FIREABLE(t1098))))
lola: processed formula length: 207
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: 146367 markings, 365497 edges, 29273 markings/sec, 0 secs
lola: 304759 markings, 760980 edges, 31678 markings/sec, 5 secs
lola: 462787 markings, 1155608 edges, 31606 markings/sec, 10 secs
lola: 620915 markings, 1550471 edges, 31626 markings/sec, 15 secs
lola: 778744 markings, 1944600 edges, 31566 markings/sec, 20 secs
lola: 936496 markings, 2338502 edges, 31550 markings/sec, 25 secs
lola: 1094533 markings, 2733141 edges, 31607 markings/sec, 30 secs
lola: 1252262 markings, 3126972 edges, 31546 markings/sec, 35 secs
lola: 1409833 markings, 3520477 edges, 31514 markings/sec, 40 secs
lola: 1567283 markings, 3913663 edges, 31490 markings/sec, 45 secs
lola: 1725167 markings, 4307902 edges, 31577 markings/sec, 50 secs
lola: 1882857 markings, 4701676 edges, 31538 markings/sec, 55 secs
lola: 2040528 markings, 5095381 edges, 31534 markings/sec, 60 secs
lola: 2198513 markings, 5489883 edges, 31597 markings/sec, 65 secs
lola: 2356206 markings, 5883655 edges, 31539 markings/sec, 70 secs
lola: 2513808 markings, 6277239 edges, 31520 markings/sec, 75 secs
lola: 2671432 markings, 6670832 edges, 31525 markings/sec, 80 secs
lola: 2829094 markings, 7064532 edges, 31532 markings/sec, 85 secs
lola: 2986506 markings, 7457591 edges, 31482 markings/sec, 90 secs
lola: 3143484 markings, 7849583 edges, 31396 markings/sec, 95 secs
lola: 3300451 markings, 8241562 edges, 31393 markings/sec, 100 secs
lola: 3457382 markings, 8633547 edges, 31386 markings/sec, 105 secs
lola: 3614115 markings, 9024945 edges, 31347 markings/sec, 110 secs
lola: 3770887 markings, 9416449 edges, 31354 markings/sec, 115 secs
lola: 3928129 markings, 9809081 edges, 31448 markings/sec, 120 secs
lola: 4085268 markings, 10201455 edges, 31428 markings/sec, 125 secs
lola: 4241874 markings, 10592495 edges, 31321 markings/sec, 130 secs
lola: 4398485 markings, 10983630 edges, 31322 markings/sec, 135 secs
lola: 4554792 markings, 11373927 edges, 31261 markings/sec, 140 secs
lola: 4712732 markings, 11768312 edges, 31588 markings/sec, 145 secs
lola: 4870095 markings, 12161267 edges, 31473 markings/sec, 150 secs
lola: 5026406 markings, 12551589 edges, 31262 markings/sec, 155 secs
lola: 5182862 markings, 12942252 edges, 31291 markings/sec, 160 secs
lola: 5339385 markings, 13333211 edges, 31305 markings/sec, 165 secs
lola: 5495441 markings, 13722968 edges, 31211 markings/sec, 170 secs
lola: 5651539 markings, 14112787 edges, 31220 markings/sec, 175 secs
lola: 5808466 markings, 14504664 edges, 31385 markings/sec, 180 secs
lola: 5965097 markings, 14895726 edges, 31326 markings/sec, 185 secs
lola: 6121031 markings, 15285117 edges, 31187 markings/sec, 190 secs
lola: 6277039 markings, 15674709 edges, 31202 markings/sec, 195 secs
lola: 6432571 markings, 16063074 edges, 31106 markings/sec, 200 secs
lola: 6589745 markings, 16455570 edges, 31435 markings/sec, 205 secs
lola: 6746895 markings, 16847980 edges, 31430 markings/sec, 210 secs
lola: 6903896 markings, 17240002 edges, 31400 markings/sec, 215 secs
lola: 7060776 markings, 17631765 edges, 31376 markings/sec, 220 secs
lola: 7217460 markings, 18023027 edges, 31337 markings/sec, 225 secs
lola: 7374280 markings, 18414632 edges, 31364 markings/sec, 230 secs
lola: 7531142 markings, 18806329 edges, 31372 markings/sec, 235 secs
lola: 7687856 markings, 19197662 edges, 31343 markings/sec, 240 secs
lola: 7844398 markings, 19588537 edges, 31308 markings/sec, 245 secs
lola: 8000576 markings, 19978551 edges, 31236 markings/sec, 250 secs
lola: 8156198 markings, 20367154 edges, 31124 markings/sec, 255 secs
lola: 8312311 markings, 20756981 edges, 31223 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t858)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t858)))
lola: processed formula length: 22
lola: 41 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t858)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 201 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-CTLFireability-4-0.sara
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t273)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t273)))
lola: processed formula length: 22
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t273)
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: 9 markings, 8 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t1235) AND FIREABLE(t209))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t1235) OR NOT FIREABLE(t209))
lola: processed formula length: 44
lola: 41 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((NOT FIREABLE(t1449) OR NOT FIREABLE(t329))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U (FIREABLE(t1449) AND FIREABLE(t329)))))
lola: processed formula length: 61
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1140) AND FIREABLE(t44)) OR E (G (NOT FIREABLE(t385))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U ((NOT FIREABLE(t1140) OR NOT FIREABLE(t44)) AND A(TRUE U FIREABLE(t385)))))
lola: processed formula length: 89
lola: 45 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: 226310 markings, 338809 edges, 45262 markings/sec, 0 secs
lola: 464436 markings, 695283 edges, 47625 markings/sec, 5 secs
lola: 702092 markings, 1051110 edges, 47531 markings/sec, 10 secs
lola: 939816 markings, 1406949 edges, 47545 markings/sec, 15 secs
lola: 1177697 markings, 1763090 edges, 47576 markings/sec, 20 secs
lola: 1414661 markings, 2117901 edges, 47393 markings/sec, 25 secs
lola: 1652181 markings, 2473483 edges, 47504 markings/sec, 30 secs
lola: 1889873 markings, 2829309 edges, 47538 markings/sec, 35 secs
lola: 2127635 markings, 3185281 edges, 47552 markings/sec, 40 secs
lola: 2365341 markings, 3541125 edges, 47541 markings/sec, 45 secs
lola: 2602874 markings, 3896745 edges, 47507 markings/sec, 50 secs
lola: 2840504 markings, 4252509 edges, 47526 markings/sec, 55 secs
lola: 3077596 markings, 4607451 edges, 47418 markings/sec, 60 secs
lola: 3314104 markings, 4961536 edges, 47302 markings/sec, 65 secs
lola: 3550470 markings, 5315550 edges, 47273 markings/sec, 70 secs
lola: 3786911 markings, 5669553 edges, 47288 markings/sec, 75 secs
lola: 4023980 markings, 6024442 edges, 47414 markings/sec, 80 secs
lola: 4259987 markings, 6377732 edges, 47201 markings/sec, 85 secs
lola: 4495965 markings, 6731051 edges, 47196 markings/sec, 90 secs
lola: 4733333 markings, 7086418 edges, 47474 markings/sec, 95 secs
lola: 4970246 markings, 7441115 edges, 47383 markings/sec, 100 secs
lola: 5206254 markings, 7794435 edges, 47202 markings/sec, 105 secs
lola: 5441865 markings, 8147333 edges, 47122 markings/sec, 110 secs
lola: 5677396 markings, 8499940 edges, 47106 markings/sec, 115 secs
lola: 5913576 markings, 8853508 edges, 47236 markings/sec, 120 secs
lola: 6148827 markings, 9205689 edges, 47050 markings/sec, 125 secs
lola: 6383660 markings, 9557284 edges, 46967 markings/sec, 130 secs
lola: 6619981 markings, 9911073 edges, 47264 markings/sec, 135 secs
lola: 6853287 markings, 10260338 edges, 46661 markings/sec, 140 secs
lola: 7085389 markings, 10607850 edges, 46420 markings/sec, 145 secs
lola: 7317611 markings, 10955522 edges, 46444 markings/sec, 150 secs
lola: 7547969 markings, 11300349 edges, 46072 markings/sec, 155 secs
lola: 7780077 markings, 11647828 edges, 46422 markings/sec, 160 secs
lola: 8009506 markings, 11991341 edges, 45886 markings/sec, 165 secs
lola: 8240399 markings, 12337019 edges, 46179 markings/sec, 170 secs
lola: 8322374 markings, 12459758 edges, 16395 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t1266) OR FIREABLE(t1247) OR FIREABLE(t180) OR FIREABLE(t1415) OR FIREABLE(t438)) U E (G ((FIREABLE(t1475) AND FIREABLE(t1347))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A((FIREABLE(t1266) OR FIREABLE(t1247) OR FIREABLE(t180) OR FIREABLE(t1415) OR FIREABLE(t438)) U NOT(A(TRUE U (NOT FIREABLE(t1475) OR NOT FIREABLE(t1347)))))
lola: processed formula length: 161
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 10 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(t255) AND FIREABLE(t497) AND NOT FIREABLE(t1445)) OR (FIREABLE(t750) AND FIREABLE(t357) AND NOT FIREABLE(t928))) AND FIREABLE(t1387) AND NOT FIREABLE(t1088) AND NOT FIREABLE(t795)) OR A (((NOT FIREABLE(t577) OR NOT FIREABLE(t852)) U E (G (FIREABLE(t642))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: ((((FIREABLE(t255) AND FIREABLE(t497) AND NOT FIREABLE(t1445)) OR (FIREABLE(t750) AND FIREABLE(t357) AND NOT FIREABLE(t928))) AND FIREABLE(t1387) AND NOT FIREABLE(t1088) AND NOT FIREABLE(t795)) OR A((NOT FIREABLE(t577) OR NOT FIREABLE(t852)) U NOT(A(TRUE U NOT FIREABLE(t642)))))
lola: processed formula length: 281
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (FIREABLE(t507))) U A (F ((FIREABLE(t865) AND FIREABLE(t1398))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(A(TRUE U NOT FIREABLE(t507))) U A(TRUE U (FIREABLE(t865) AND FIREABLE(t1398))))
lola: processed formula length: 85
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 7 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (NOT FIREABLE(t1373)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: NOT FIREABLE(t1373)
lola: processed formula length: 19
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 5 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(t862) AND FIREABLE(t1396) AND FIREABLE(t806)) AND E (G (FIREABLE(t879)))) OR A (F (FIREABLE(t568))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t862) AND FIREABLE(t1396) AND FIREABLE(t806))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t862) AND FIREABLE(t1396) AND FIREABLE(t806))
lola: processed formula length: 55
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t568)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t568)
lola: processed formula length: 18
lola: 41 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((FIREABLE(t198) OR FIREABLE(t1248) OR NOT FIREABLE(t520)) AND (NOT FIREABLE(t1469) OR (FIREABLE(t1245) AND FIREABLE(t901)))))) AND A (F (E (G (FIREABLE(t200))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(t198) OR FIREABLE(t1248) OR NOT FIREABLE(t520)) AND (NOT FIREABLE(t1469) OR (FIREABLE(t1245) AND FIREABLE(t901))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((FIREABLE(t198) OR FIREABLE(t1248) OR NOT FIREABLE(t520)) AND (NOT FIREABLE(t1469) OR (FIREABLE(t1245) AND FIREABLE(t901))))))
lola: processed formula length: 136
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 15 will run for 3120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (FIREABLE(t200)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(t200))))
lola: processed formula length: 43
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (FIREABLE(t1269))) AND (NOT FIREABLE(t1246) OR (E (F (FIREABLE(t1026))) OR (FIREABLE(t1034) AND FIREABLE(t378) AND (FIREABLE(t1414) OR FIREABLE(t859)))))) OR (A (G (FIREABLE(t1366))) AND ((A (G (FIREABLE(t1509))) OR E (F (FIREABLE(t300)))) AND FIREABLE(t1303))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t300)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t300)))
lola: processed formula length: 22
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1303)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1303)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t1246)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t1246)
lola: processed formula length: 19
lola: 39 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1269)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t1269)))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t1269)
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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0200-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (X ((FIREABLE(t1271) AND FIREABLE(t968) AND FIREABLE(t116) AND (NOT FIREABLE(t1122) OR (FIREABLE(t537) AND FIREABLE(t1045)))))) OR E ((A (F (FIREABLE(t1186))) U (NOT FIREABLE(t229) AND NOT FIREABLE(t1098)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: (AX((FIREABLE(t1271) AND FIREABLE(t968) AND FIREABLE(t116) AND (NOT FIREABLE(t1122) OR (FIREABLE(t537) AND FIREABLE(t1045))))) OR E(A(TRUE U FIREABLE(t1186)) U (NOT FIREABLE(t229) AND NOT FIREABLE(t1098))))
lola: processed formula length: 207
lola: 42 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: 156101 markings, 389808 edges, 31220 markings/sec, 0 secs
lola: 312221 markings, 779623 edges, 31224 markings/sec, 5 secs
lola: 467084 markings, 1166353 edges, 30973 markings/sec, 10 secs
lola: 622884 markings, 1555357 edges, 31160 markings/sec, 15 secs
lola: 778436 markings, 1943829 edges, 31110 markings/sec, 20 secs
lola: 933915 markings, 2332054 edges, 31096 markings/sec, 25 secs
lola: 1089612 markings, 2720818 edges, 31139 markings/sec, 30 secs
lola: 1245013 markings, 3108891 edges, 31080 markings/sec, 35 secs
lola: 1400285 markings, 3496652 edges, 31054 markings/sec, 40 secs
lola: 1555415 markings, 3884028 edges, 31026 markings/sec, 45 secs
lola: 1710938 markings, 4272367 edges, 31105 markings/sec, 50 secs
lola: 1866365 markings, 4660514 edges, 31085 markings/sec, 55 secs
lola: 2021720 markings, 5048424 edges, 31071 markings/sec, 60 secs
lola: 2177316 markings, 5436961 edges, 31119 markings/sec, 65 secs
lola: 2332799 markings, 5825222 edges, 31097 markings/sec, 70 secs
lola: 2488055 markings, 6212934 edges, 31051 markings/sec, 75 secs
lola: 2643337 markings, 6600679 edges, 31056 markings/sec, 80 secs
lola: 2796930 markings, 6984189 edges, 30719 markings/sec, 85 secs
lola: 2951906 markings, 7371195 edges, 30995 markings/sec, 90 secs
lola: 3106776 markings, 7757931 edges, 30974 markings/sec, 95 secs
lola: 3261271 markings, 8143709 edges, 30899 markings/sec, 100 secs
lola: 3415670 markings, 8529290 edges, 30880 markings/sec, 105 secs
lola: 3569944 markings, 8914632 edges, 30855 markings/sec, 110 secs
lola: 3723998 markings, 9299377 edges, 30811 markings/sec, 115 secs
lola: 3879005 markings, 9686414 edges, 31001 markings/sec, 120 secs
lola: 4033835 markings, 10073007 edges, 30966 markings/sec, 125 secs
lola: 4188089 markings, 10458217 edges, 30851 markings/sec, 130 secs
lola: 4342327 markings, 10843369 edges, 30848 markings/sec, 135 secs
lola: 4496423 markings, 11228148 edges, 30819 markings/sec, 140 secs
lola: 4651405 markings, 11615191 edges, 30996 markings/sec, 145 secs
lola: 4806711 markings, 12002985 edges, 31061 markings/sec, 150 secs
lola: 4961312 markings, 12389053 edges, 30920 markings/sec, 155 secs
lola: 5115598 markings, 12774279 edges, 30857 markings/sec, 160 secs
lola: 5269159 markings, 13157804 edges, 30712 markings/sec, 165 secs
lola: 5423692 markings, 13543791 edges, 30907 markings/sec, 170 secs
lola: 5577544 markings, 13927978 edges, 30770 markings/sec, 175 secs
lola: 5732692 markings, 14315420 edges, 31030 markings/sec, 180 secs
lola: 5887669 markings, 14702380 edges, 30995 markings/sec, 185 secs
lola: 6042023 markings, 15087844 edges, 30871 markings/sec, 190 secs
lola: 6196204 markings, 15472860 edges, 30836 markings/sec, 195 secs
lola: 6350347 markings, 15857773 edges, 30829 markings/sec, 200 secs
lola: 6503752 markings, 16240815 edges, 30681 markings/sec, 205 secs
lola: 6658333 markings, 16626860 edges, 30916 markings/sec, 210 secs
lola: 6814002 markings, 17015542 edges, 31134 markings/sec, 215 secs
lola: 6969261 markings, 17403245 edges, 31052 markings/sec, 220 secs
lola: 7124270 markings, 17790324 edges, 31002 markings/sec, 225 secs
lola: 7279475 markings, 18177877 edges, 31041 markings/sec, 230 secs
lola: 7434470 markings, 18564911 edges, 30999 markings/sec, 235 secs
lola: 7589741 markings, 18952645 edges, 31054 markings/sec, 240 secs
lola: 7745464 markings, 19341475 edges, 31145 markings/sec, 245 secs
lola: 7902323 markings, 19733165 edges, 31372 markings/sec, 250 secs
lola: 8058770 markings, 20123893 edges, 31289 markings/sec, 255 secs
lola: 8214948 markings, 20513853 edges, 31236 markings/sec, 260 secs
lola: 8317704 markings, 20770432 edges, 20551 markings/sec, 265 secs
lola: 8321868 markings, 20780855 edges, 833 markings/sec, 270 secs
lola: 8324744 markings, 20788016 edges, 575 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0200-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1140) AND FIREABLE(t44)) OR E (G (NOT FIREABLE(t385))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U ((NOT FIREABLE(t1140) OR NOT FIREABLE(t44)) AND A(TRUE U FIREABLE(t385)))))
lola: processed formula length: 89
lola: 45 rewrites
lola: closed formula file JoinFreeModules-PT-0200-CTLFireability.task
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: 232015 markings, 347371 edges, 46403 markings/sec, 0 secs
lola: 458830 markings, 686905 edges, 45363 markings/sec, 5 secs
lola: 696678 markings, 1043005 edges, 47570 markings/sec, 10 secs
lola: 934522 markings, 1399037 edges, 47569 markings/sec, 15 secs
lola: 1172439 markings, 1755221 edges, 47583 markings/sec, 20 secs
lola: 1409574 markings, 2110252 edges, 47427 markings/sec, 25 secs
lola: 1646776 markings, 2465382 edges, 47440 markings/sec, 30 secs
lola: 1884339 markings, 2821035 edges, 47513 markings/sec, 35 secs
lola: 2121946 markings, 3176757 edges, 47521 markings/sec, 40 secs
lola: 2359405 markings, 3532217 edges, 47492 markings/sec, 45 secs
lola: 2596855 markings, 3887755 edges, 47490 markings/sec, 50 secs
lola: 2834201 markings, 4243101 edges, 47469 markings/sec, 55 secs
lola: 3070985 markings, 4597560 edges, 47357 markings/sec, 60 secs
lola: 3307048 markings, 4950980 edges, 47213 markings/sec, 65 secs
lola: 3543191 markings, 5304672 edges, 47229 markings/sec, 70 secs
lola: 3779602 markings, 5658611 edges, 47282 markings/sec, 75 secs
lola: 4016623 markings, 6013419 edges, 47404 markings/sec, 80 secs
lola: 4252810 markings, 6366985 edges, 47237 markings/sec, 85 secs
lola: 4488863 markings, 6720416 edges, 47211 markings/sec, 90 secs
lola: 4726193 markings, 7075725 edges, 47466 markings/sec, 95 secs
lola: 4963173 markings, 7430509 edges, 47396 markings/sec, 100 secs
lola: 5199379 markings, 7784143 edges, 47241 markings/sec, 105 secs
lola: 5435579 markings, 8137910 edges, 47240 markings/sec, 110 secs
lola: 5671736 markings, 8491468 edges, 47231 markings/sec, 115 secs
lola: 5908289 markings, 8845581 edges, 47311 markings/sec, 120 secs
lola: 6143829 markings, 9198198 edges, 47108 markings/sec, 125 secs
lola: 6378834 markings, 9550028 edges, 47001 markings/sec, 130 secs
lola: 6615073 markings, 9903726 edges, 47248 markings/sec, 135 secs
lola: 6851903 markings, 10258284 edges, 47366 markings/sec, 140 secs
lola: 7087978 markings, 10611731 edges, 47215 markings/sec, 145 secs
lola: 7324039 markings, 10965114 edges, 47212 markings/sec, 150 secs
lola: 7560297 markings, 11318796 edges, 47252 markings/sec, 155 secs
lola: 7796181 markings, 11671941 edges, 47177 markings/sec, 160 secs
lola: 8031242 markings, 12023865 edges, 47012 markings/sec, 165 secs
lola: 8266149 markings, 12375564 edges, 46981 markings/sec, 170 secs
lola: 8319980 markings, 12456161 edges, 10766 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0200-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no no no yes unknown no unknown no yes yes
lola:
preliminary result: no yes yes yes yes yes no no no yes unknown no unknown no yes yes
lola: memory consumption: 17180 KB
lola: time consumption: 913 seconds

BK_STOP 1526844092060

--------------------
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="JoinFreeModules-PT-0200"
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/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is JoinFreeModules-PT-0200, 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 r100-smll-152658630900277"
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 ;