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 236K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.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.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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 22K 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 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 57K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900248
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526814734986

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0010 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 132/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1632
lola: finding significant places
lola: 51 places, 81 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 91 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0010-CTLCardinality.task
lola: always true
lola: always true
lola: NOT(E (X (E (G ((3 <= p13)))))) : ((p1 <= p9) OR E ((((p36 <= p46) AND (2 <= p38)) U ((3 <= p6) AND (3 <= p34))))) : (NOT(NOT(A (X ((p24 <= p12))))) AND ((3 <= p1) OR NOT(A (G ((2 <= p28)))))) : (A (F ((((3 <= p44) AND (2 <= p9)) OR (p31 <= 0)))) OR (A (G ((1 <= p9))) AND E (X (((p16 <= p27) AND (p29 <= p22)))))) : A (G (NOT(E (G ((p45 <= p32)))))) : (E (((p28 <= p17) U ((3 <= p39) OR (2 <= p49)))) OR (E (F (((p41 <= p24) AND (2 <= p20)))) OR NOT(E (F (TRUE))))) : A (G ((((p33 <= 1) AND (3 <= p43)) OR E (X ((p14 <= p27)))))) : (A (F (((p34 <= 0) AND (p13 <= 1)))) OR (((1 <= p37) OR (1 <= p16)) AND (3 <= p41) AND ((p49 <= p33) OR (p14 <= p6) OR (p26 <= p25)) AND (2 <= p30) AND (p9 <= p21) AND ((p20 <= p11) OR (p41 <= p44)) AND ((p37 <= p30) OR (p46 <= p22)))) : NOT(((((3 <= p39) OR (3 <= p43)) AND (p15 <= p31) AND (((1 <= p33) AND (p11 <= p7)) OR ((p39 <= p28) AND (p36 <= p8)))) AND E (G (((1 <= p47) OR (p9 <= p34)))))) : A (F ((((p36 <= p15)) OR (p13 <= p21) OR ((p5 <= p25) AND (3 <= p35)) OR ((p37 <= p4) AND (2 <= p40))))) : A ((A (X ((1 <= p28))) U E (G ((p44 <= p33))))) : E (G (NOT(A (F ((p1 <= p17)))))) : A (((p21 <= p23) U E (X ((3 <= p26))))) : ((p50 <= p23) AND (A (F ((p25 + 1 <= p34))) OR A (G (((p41 <= p8) OR (3 <= p26)))))) : A (G (A (F ((p28 <= p17))))) : A (G ((p12 <= p28)))
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: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:300
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
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 ((p13 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= p13)
lola: processed formula length: 10
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 149 markings, 149 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p24 <= p12))) AND ((3 <= p1) OR E (F ((p28 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p24 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p24 <= p12))
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p1)
lola: processed formula length: 9
lola: 31 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p28 <= 1)))
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 ((p28 <= 1)))
lola: processed formula length: 18
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: (p28 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to JoinFreeModules-PT-0010-CTLCardinality-3-0.sara
lola: lola: state equation: calling and running sara
The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((3 <= p44) AND (2 <= p9)) OR (p31 <= 0)))) OR (A (G ((1 <= p9))) AND E (X (((p16 <= p27) AND (p29 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p9)))
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 ((1 <= p9)))
lola: processed formula length: 17
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file JoinFreeModules-PT-0010-CTLCardinality-3-0.sara.
lola: ...considering subproblem: A (F ((((3 <= p44) AND (2 <= p9)) OR (p31 <= 0))))
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: (((p44 <= 2) OR (p9 <= 1)) AND (1 <= p31))
lola: processed formula length: 43
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: sara: place or transition ordering is non-deterministic
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: 150 markings, 150 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-3 FALSE 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 (G ((((p33 <= 1) AND (3 <= p43)) OR E (X ((p14 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (((2 <= p33) OR (p43 <= 2)) AND NOT(EX((p14 <= p27))))))
lola: processed formula length: 70
lola: 35 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2213343 markings, 2622073 edges, 442669 markings/sec, 0 secs
lola: 4232018 markings, 5013584 edges, 403735 markings/sec, 5 secs
lola: 6198838 markings, 7343647 edges, 393364 markings/sec, 10 secs
lola: 8132399 markings, 9634324 edges, 386712 markings/sec, 15 secs
lola: 9986059 markings, 11830366 edges, 370732 markings/sec, 20 secs
lola: 11846539 markings, 14034464 edges, 372096 markings/sec, 25 secs
lola: 13672255 markings, 16197348 edges, 365143 markings/sec, 30 secs
lola: 15503730 markings, 18367107 edges, 366295 markings/sec, 35 secs
lola: 17348125 markings, 20552156 edges, 368879 markings/sec, 40 secs
lola: 19178091 markings, 22720095 edges, 365993 markings/sec, 45 secs
lola: 20986898 markings, 24862990 edges, 361761 markings/sec, 50 secs
lola: 22762418 markings, 26966433 edges, 355104 markings/sec, 55 secs
lola: 24486270 markings, 29008669 edges, 344770 markings/sec, 60 secs
lola: 26224041 markings, 31067377 edges, 347554 markings/sec, 65 secs
lola: 27965083 markings, 33129992 edges, 348208 markings/sec, 70 secs
lola: 29737830 markings, 35230144 edges, 354549 markings/sec, 75 secs
lola: 31520956 markings, 37342597 edges, 356625 markings/sec, 80 secs
lola: 33231032 markings, 39368526 edges, 342015 markings/sec, 85 secs
lola: 34912792 markings, 41360888 edges, 336352 markings/sec, 90 secs
lola: 36594802 markings, 43353565 edges, 336402 markings/sec, 95 secs
lola: 38375532 markings, 45463187 edges, 356146 markings/sec, 100 secs
lola: 40100551 markings, 47506816 edges, 345004 markings/sec, 105 secs
lola: 41867840 markings, 49600480 edges, 353458 markings/sec, 110 secs
lola: 43557575 markings, 51602301 edges, 337947 markings/sec, 115 secs
lola: 45223041 markings, 53575370 edges, 333093 markings/sec, 120 secs
lola: 46895713 markings, 55556974 edges, 334534 markings/sec, 125 secs
lola: 48654163 markings, 57640200 edges, 351690 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((1 <= p28))) U E (G ((p44 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
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(AX((1 <= p28)) U NOT(A(TRUE U (p33 + 1 <= p44))))
lola: processed formula length: 51
lola: 35 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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-0010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p21 <= p23) U E (X ((3 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A((p21 <= p23) U EX((3 <= p26)))
lola: processed formula length: 32
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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 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: 5 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p12 <= p28)))
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 ((p12 <= p28)))
lola: processed formula length: 20
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: (p28 + 1 <= p12)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas

FORMULA JoinFreeModules-PT-0010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p32 + 1 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p45 <= p32)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 150 markings, 150 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p28 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p17 + 1 <= p28)
lola: processed formula length: 16
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 150 markings, 150 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p17 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p17 + 1 <= p1)))
lola: processed formula length: 23
lola: 31 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: 7 markings, 7 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p36 <= p15)) OR (p13 <= p21) OR ((p5 <= p25) AND (3 <= p35)) OR ((p37 <= p4) AND (2 <= p40)))))
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: (((p15 + 1 <= p36)) AND (p21 + 1 <= p13) AND ((p25 + 1 <= p5) OR (p35 <= 2)) AND ((p4 + 1 <= p37) OR (p40 <= 1)))
lola: processed formula length: 115
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: 5 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= p9) OR E ((((p36 <= p46) AND (2 <= p38)) U ((3 <= p6) AND (3 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes yes no unknown no no
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: no unknown yes no no unknown unknown unknown unknown no yes yes no unknown no no
lola: memory consumption: 23552 KB
lola: time consumption: 825 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p28 <= p17) U ((3 <= p39) OR (2 <= p49)))) OR E (F (((p41 <= p24) AND (2 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p41 <= p24) AND (2 <= p20))))
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 (((p41 <= p24) AND (2 <= p20))))
lola: processed formula length: 37
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: ((p41 <= p24) AND (2 <= p20))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0010-CTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola:
FORMULA JoinFreeModules-PT-0010-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 914 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p50 <= p23) AND (A (F ((p25 + 1 <= p34))) OR A (G (((p41 <= p8) OR (3 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 914 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p50 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p50 <= p23)
lola: processed formula length: 12
lola: 31 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: processed formula with 1 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 14 will run for 1372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p25 + 1 <= p34)))
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: (p34 <= p25)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: sara: RUNNING
try reading problem file JoinFreeModules-PT-0010-CTLCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: ========================================
lola: subprocess 15 will run for 2744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p41 <= p8) OR (3 <= p26))))
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 (((p41 <= p8) OR (3 <= p26))))
lola: processed formula length: 36
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: ((p8 + 1 <= p41) AND (p26 <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0010-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p39 <= 2) AND (p43 <= 2)) OR (p31 + 1 <= p15) OR (((p33 <= 0) OR (p7 + 1 <= p11)) AND ((p28 + 1 <= p39) OR (p8 + 1 <= p36)))) OR A (F (((p47 <= 0) AND (p34 + 1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p47 <= 0) AND (p34 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: ((1 <= p47) OR (p9 <= p34))
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: 150 markings, 150 edges
lola: ========================================
lola: subprocess 15 will run for 2744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p39 <= 2) AND (p43 <= 2)) OR (p31 + 1 <= p15) OR (((p33 <= 0) OR (p7 + 1 <= p11)) AND ((p28 + 1 <= p39) OR (p8 + 1 <= p36))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: sara: processed formula: (((p39 <= 2) AND (p43 <= 2)) OR (p31 + 1 <= p15) OR (((p33 <= 0) OR (p7 + 1 <= p11)) AND ((p28 + 1 <= p39) OR (p8 + 1 <= p36))))
lola: place or transition ordering is non-deterministic processed formula length: 132

lola: 31 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p34 <= 0) AND (p13 <= 1)))) OR (((1 <= p37) OR (1 <= p16)) AND (3 <= p41) AND ((p49 <= p33) OR (p14 <= p6) OR (p26 <= p25)) AND (2 <= p30) AND (p9 <= p21) AND ((p20 <= p11) OR (p41 <= p44)) AND ((p37 <= p30) OR (p46 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p34 <= 0) AND (p13 <= 1))))
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: ((1 <= p34) OR (2 <= p13))
lola: processed formula length: 27
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: 150 markings, 150 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p33 <= 1) AND (3 <= p43)) OR E (X ((p14 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (((2 <= p33) OR (p43 <= 2)) AND NOT(EX((p14 <= p27))))))
lola: processed formula length: 70
lola: 35 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: 2168984 markings, 2569516 edges, 433797 markings/sec, 0 secs
lola: 4305638 markings, 5100796 edges, 427331 markings/sec, 5 secs
lola: 6364622 markings, 7540061 edges, 411797 markings/sec, 10 secs
lola: 8416621 markings, 9971042 edges, 410400 markings/sec, 15 secs
lola: 10391709 markings, 12310938 edges, 395018 markings/sec, 20 secs
lola: 12343193 markings, 14622843 edges, 390297 markings/sec, 25 secs
lola: 14311872 markings, 16955123 edges, 393736 markings/sec, 30 secs
lola: 16241696 markings, 19241364 edges, 385965 markings/sec, 35 secs
lola: 18211257 markings, 21574694 edges, 393912 markings/sec, 40 secs
lola: 20143941 markings, 23864330 edges, 386537 markings/sec, 45 secs
lola: 22047024 markings, 26118910 edges, 380617 markings/sec, 50 secs
lola: 23909391 markings, 28325254 edges, 372473 markings/sec, 55 secs
lola: 25746643 markings, 30501820 edges, 367450 markings/sec, 60 secs
lola: 27593681 markings, 32689993 edges, 369408 markings/sec, 65 secs
lola: 29479147 markings, 34923703 edges, 377093 markings/sec, 70 secs
lola: 31370936 markings, 37164885 edges, 378358 markings/sec, 75 secs
lola: 33188919 markings, 39318620 edges, 363597 markings/sec, 80 secs
lola: 34970077 markings, 41428769 edges, 356232 markings/sec, 85 secs
lola: 36762079 markings, 43551727 edges, 358400 markings/sec, 90 secs
lola: 38663526 markings, 45804370 edges, 380289 markings/sec, 95 secs
lola: 40524388 markings, 48008923 edges, 372172 markings/sec, 100 secs
lola: 42358801 markings, 50182120 edges, 366883 markings/sec, 105 secs
lola: 44159991 markings, 52315995 edges, 360238 markings/sec, 110 secs
lola: 45918729 markings, 54399552 edges, 351748 markings/sec, 115 secs
lola: 47727361 markings, 56542233 edges, 361726 markings/sec, 120 secs
lola: 49479214 markings, 58617653 edges, 350371 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0010-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((p1 <= p9) OR E ((((p36 <= p46) AND (2 <= p38)) U ((3 <= p6) AND (3 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p1 <= p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p9)
lola: processed formula length: 10
lola: 31 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p36 <= p46) AND (2 <= p38)) U ((3 <= p6) AND (3 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((p36 <= p46) AND (2 <= p38)) U ((3 <= p6) AND (3 <= p34))))
lola: processed formula length: 64
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= p6) AND (3 <= p34))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0010-CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0010-CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2586071 markings, 3063400 edges, 517214 markings/sec, 0 secs
lola: sara is running 5 secs || 5024019 markings, 5951373 edges, 487590 markings/sec, 5 secs
lola: sara is running 10 secs || 7377420 markings, 8739171 edges, 470680 markings/sec, 10 secs
lola: sara is running 15 secs || 9678334 markings, 11464799 edges, 460183 markings/sec, 15 secs
lola: sara is running 20 secs || 11920107 markings, 14120376 edges, 448355 markings/sec, 20 secs
lola: sara is running 25 secs || 14108325 markings, 16712487 edges, 437644 markings/sec, 25 secs
lola: sara is running 30 secs || 16319910 markings, 19332311 edges, 442317 markings/sec, 30 secs
lola: sara is running 35 secs || 18434333 markings, 21837029 edges, 422885 markings/sec, 35 secs
lola: sara is running 40 secs || 20642595 markings, 24452896 edges, 441652 markings/sec, 40 secs
lola: sara is running 45 secs || 22742097 markings, 26939936 edges, 419900 markings/sec, 45 secs
lola: sara is running 50 secs || 24911966 markings, 29510343 edges, 433974 markings/sec, 50 secs
lola: sara is running 55 secs || 27052309 markings, 32045758 edges, 428069 markings/sec, 55 secs
lola: sara is running 60 secs || 29159246 markings, 34541603 edges, 421387 markings/sec, 60 secs
lola: sara is running 65 secs || 31263188 markings, 37033906 edges, 420788 markings/sec, 65 secs
lola: sara is running 70 secs || 33331194 markings, 39483632 edges, 413601 markings/sec, 70 secs
lola: sara is running 75 secs || 35302005 markings, 41818244 edges, 394162 markings/sec, 75 secs
lola: sara is running 80 secs || 37351159 markings, 44245619 edges, 409831 markings/sec, 80 secs
lola: sara is running 85 secs || 39444911 markings, 46725835 edges, 418750 markings/sec, 85 secs
lola: sara is running 90 secs || 41466679 markings, 49120807 edges, 404354 markings/sec, 90 secs
lola: sara is running 95 secs || 43517169 markings, 51549784 edges, 410098 markings/sec, 95 secs
lola: sara is running 100 secs || 45540713 markings, 53946850 edges, 404709 markings/sec, 100 secs
lola: sara is running 105 secs || 47536823 markings, 56311427 edges, 399222 markings/sec, 105 secs
lola: sara is running 110 secs || 49591320 markings, 58745123 edges, 410899 markings/sec, 110 secs
lola: sara is running 115 secs || 51562902 markings, 61080653 edges, 394316 markings/sec, 115 secs
lola: sara is running 120 secs || 53619477 markings, 63516834 edges, 411315 markings/sec, 120 secs
lola: sara is running 125 secs || 55654425 markings, 65927408 edges, 406990 markings/sec, 125 secs
lola: sara is running 130 secs || 57655366 markings, 68297700 edges, 400188 markings/sec, 130 secs
lola: sara is running 135 secs || 59678724 markings, 70694535 edges, 404672 markings/sec, 135 secs
lola: sara is running 140 secs || 61666574 markings, 73049309 edges, 397570 markings/sec, 140 secs
lola: sara is running 145 secs || 63640939 markings, 75388113 edges, 394873 markings/sec, 145 secs
lola: sara is running 150 secs || 65605925 markings, 77715817 edges, 392997 markings/sec, 150 secs
lola: sara is running 155 secs || 67591357 markings, 80067713 edges, 397086 markings/sec, 155 secs
lola: sara is running 160 secs || 69616821 markings, 82467055 edges, 405093 markings/sec, 160 secs
lola: sara is running 165 secs || 71578716 markings, 84791082 edges, 392379 markings/sec, 165 secs
lola: sara is running 170 secs || 73581527 markings, 87163593 edges, 400562 markings/sec, 170 secs
lola: sara is running 175 secs || 75519609 markings, 89459406 edges, 387616 markings/sec, 175 secs
lola: sara is running 180 secs || 77478900 markings, 91780389 edges, 391858 markings/sec, 180 secs
lola: sara is running 185 secs || 79470416 markings, 94139497 edges, 398303 markings/sec, 185 secs
lola: sara is running 190 secs || 81410236 markings, 96437381 edges, 387964 markings/sec, 190 secs
lola: sara is running 195 secs || 83412736 markings, 98809498 edges, 400500 markings/sec, 195 secs
lola: sara is running 200 secs || 85391854 markings, 101153954 edges, 395824 markings/sec, 200 secs
lola: sara is running 205 secs || 87320659 markings, 103438775 edges, 385761 markings/sec, 205 secs
lola: sara is running 210 secs || 89475589 markings, 105991484 edges, 430986 markings/sec, 210 secs
lola: sara is running 215 secs || 91566199 markings, 108468003 edges, 418122 markings/sec, 215 secs
lola: sara is running 220 secs || 93621774 markings, 110902979 edges, 411115 markings/sec, 220 secs
lola: sara is running 225 secs || 95798035 markings, 113480966 edges, 435252 markings/sec, 225 secs
lola: sara is running 230 secs || 98012631 markings, 116104370 edges, 442919 markings/sec, 230 secs
lola: sara is running 235 secs || 99926446 markings, 118371451 edges, 382763 markings/sec, 235 secs
lola: sara is running 240 secs || 99973905 markings, 118427649 edges, 9492 markings/sec, 240 secs
lola: sara is running 245 secs || 99988750 markings, 118445239 edges, 2969 markings/sec, 245 secs
lola: sara is running 250 secs || 99995373 markings, 118453077 edges, 1325 markings/sec, 250 secs
lola: sara is running 255 secs || 99995504 markings, 118453233 edges, 26 markings/sec, 255 secs
lola: sara is running 260 secs || 100004543 markings, 118463953 edges, 1808 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.

lola: ========================================
FORMULA JoinFreeModules-PT-0010-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F (((p34 <= 0) AND (p13 <= 1)))) OR (((1 <= p37) OR (1 <= p16)) AND (3 <= p41) AND ((p49 <= p33) OR (p14 <= p6) OR (p26 <= p25)) AND (2 <= p30) AND (p9 <= p21) AND ((p20 <= p11) OR (p41 <= p44)) AND ((p37 <= p30) OR (p46 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (((p34 <= 0) AND (p13 <= 1))))
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: ((1 <= p34) OR (2 <= p13))
lola: processed formula length: 27
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.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: 150 markings, 150 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p37) OR (1 <= p16)) AND (3 <= p41) AND ((p49 <= p33) OR (p14 <= p6) OR (p26 <= p25)) AND (2 <= p30) AND (p9 <= p21) AND ((p20 <= p11) OR (p41 <= p44)) AND ((p37 <= p30) OR (p46 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p37) OR (1 <= p16)) AND (3 <= p41) AND ((p49 <= p33) OR (p14 <= p6) OR (p26 <= p25)) AND (2 <= p30) AND (p9 <= p21) AND ((p20 <= p11) OR (p41 <= p44)) AND ((p37 <= p30) OR (p46 <= p22)))
lola: processed formula length: 199
lola: 31 rewrites
lola: closed formula file JoinFreeModules-PT-0010-CTLCardinality.task
lola: processed formula with 12 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no unknown yes no no yes unknown no no no yes yes no no no no
lola:
preliminary result: no unknown yes no no yes unknown no no no yes yes no no no no
lola: memory consumption: 24892 KB
lola: time consumption: 1226 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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-0010"
export BK_EXAMINATION="CTLCardinality"
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-0010.tgz
mv JoinFreeModules-PT-0010 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-0010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-152658630900248"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;