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 876K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K 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 19K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 484K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469600493
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527038362933

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-PT-10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ PermAdmissibility-PT-10 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-10-CTLCardinality.task
lola: ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c20) OR A (X (A (F ((1 <= c110)))))) : E (G ((c11 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) : ((E (F ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c18))) OR (A (X ((2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))) OR (c9 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))) AND E (F (((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in4_6 + in4_7) AND (in3_4 + in3_5 <= 0))))) : E (G ((E (F ((c18 <= in4_6 + in4_7))) AND ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= 1) OR (in4_6 + in4_7 <= 0))))) : E (F (((2 <= in4_6 + in4_7) AND (c110 <= in1_0 + in1_1) AND (in2_2 + in2_3 <= c6) AND (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))) : A (G ((c110 <= 2))) : A (G ((((1 <= c17) OR ((c20 <= c5) AND (2 <= in3_4 + in3_5))) AND A (G ((c19 <= c13)))))) : NOT(A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))) : E (G (NOT(A (F ((2 <= out4_0)))))) : NOT(A (G (((out1_5 <= c5) OR (2 <= out1_4) OR (aux11_1 <= out8_3))))) : (E (G (((aux9_3 <= out5_2) OR (out8_1 <= out1_7) OR (aux9_2 + 1 <= out6_4)))) AND ((E (F ((3 <= c15))) OR E (X ((c11 <= aux11_4)))) AND ((out4_0 + 1 <= out1_2) OR (out8_4 + 1 <= aux6_4) OR (aux16_3 <= 2)))) : E (F ((2 <= c8))) : NOT(((aux8_2 <= aux14_0) AND NOT(E (G ((out4_3 <= out1_3)))))) : A (G ((out2_2 <= aux9_0))) : ((out8_5 <= out4_0) AND E (F (((out1_3 + 1 <= aux12_3) AND (c18 <= 1))))) : (A (F ((1 <= aux11_4))) OR E (F (A (G ((2 <= c18))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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: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: 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: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:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c20) OR A (X (A (F ((1 <= c110))))))
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: (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c20)
lola: processed formula length: 90
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= c110)))))
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:694
lola: processed formula: (c110 <= 0)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: 496012 markings, 2720620 edges, 99202 markings/sec, 0 secs
lola: 986437 markings, 5409904 edges, 98085 markings/sec, 5 secs
lola: 1494727 markings, 8201065 edges, 101658 markings/sec, 10 secs
lola: 2016084 markings, 11059443 edges, 104271 markings/sec, 15 secs
lola: 2538621 markings, 13930640 edges, 104507 markings/sec, 20 secs
lola: 3028811 markings, 16620843 edges, 98038 markings/sec, 25 secs
lola: 3520871 markings, 19329129 edges, 98412 markings/sec, 30 secs
lola: 4016538 markings, 22050300 edges, 99133 markings/sec, 35 secs
lola: 4545102 markings, 24949044 edges, 105713 markings/sec, 40 secs
lola: 5109368 markings, 28049450 edges, 112853 markings/sec, 45 secs
lola: 5626610 markings, 30892227 edges, 103448 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 6086824 markings, 33421167 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c18))) OR (A (X ((2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))) OR (c9 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))) AND E (F (((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in4_6 + in4_7) AND (in3_4 + in3_5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (c9 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c9 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)
lola: processed formula length: 81
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in4_6 + in4_7) AND (in3_4 + in3_5 <= 0))))
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 (((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in4_6 + in4_7) AND (in3_4 + in3_5 <= 0))))
lola: processed formula length: 91
lola: 21 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: ((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in4_6 + in4_7) AND (in3_4 + in3_5 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-2-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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c18)))
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 ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c18)))
lola: processed formula length: 86
lola: 21 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c18)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((aux9_3 <= out5_2) OR (out8_1 <= out1_7) OR (aux9_2 + 1 <= out6_4)))) AND ((E (F ((3 <= c15))) OR E (X ((c11 <= aux11_4)))) AND ((out4_0 + 1 <= out1_2) OR (out8_4 + 1 <= aux6_4) OR (aux16_3 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file PermAdmissibility-PT-10-CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 25060 KB
lola: lola: memory consumption: 25060 KB
time consumption: 311 seconds
lola: time consumption: 311 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((c110 <= 2)))
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 ((c110 <= 2)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: (3 <= c110)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= c8)))
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 ((2 <= c8)))
lola: processed formula length: 17
lola: 21 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: (2 <= c8)
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: 7 markings, 6 edges
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-4-0.sara
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((out2_2 <= aux9_0)))
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 ((out2_2 <= aux9_0)))
lola: processed formula length: 26
lola: 22 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: (aux9_0 + 1 <= out2_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-PT-10-CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((c5 + 1 <= out1_5) AND (out1_4 <= 1) AND (out8_3 + 1 <= aux11_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 (((c5 + 1 <= out1_5) AND (out1_4 <= 1) AND (out8_3 + 1 <= aux11_1))))
lola: processed formula length: 74
lola: 21 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: ((c5 + 1 <= out1_5) AND (out1_4 <= 1) AND (out8_3 + 1 <= aux11_1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: lola: ========================================
state equation: calling and running sara

FORMULA PermAdmissibility-PT-10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= in4_6 + in4_7) AND (c110 <= in1_0 + in1_1) AND (in2_2 + in2_3 <= c6) AND (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))
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 (((2 <= in4_6 + in4_7) AND (c110 <= in1_0 + in1_1) AND (in2_2 + in2_3 <= c6) AND (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))
lola: processed formula length: 165
lola: 21 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: ((2 <= in4_6 + in4_7) AND (c110 <= in1_0 + in1_1) AND (in2_2 + in2_3 <= c6) AND (1 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
sara: try reading problem file PermAdmissibility-PT-10-CTLCardinality-6-0.sara.
lola: state equation: write sara problem file to PermAdmissibility-PT-10-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-PT-10-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((out4_0 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((out4_0 <= 1)))
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: 161 markings, 160 edges
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= 0)))
lola: processed formula length: 84
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: 93036 markings, 767458 edges, 18607 markings/sec, 0 secs
lola: 180241 markings, 1543072 edges, 17441 markings/sec, 5 secs
lola: 258758 markings, 2298555 edges, 15703 markings/sec, 10 secs
lola: 359909 markings, 2707140 edges, 20230 markings/sec, 15 secs
lola: 463978 markings, 3017347 edges, 20814 markings/sec, 20 secs
lola: 566845 markings, 3412663 edges, 20573 markings/sec, 25 secs
lola: 679269 markings, 3748078 edges, 22485 markings/sec, 30 secs
lola: 768281 markings, 4088310 edges, 17802 markings/sec, 35 secs
lola: 866509 markings, 4436681 edges, 19646 markings/sec, 40 secs
lola: 959661 markings, 4773653 edges, 18630 markings/sec, 45 secs
lola: 1053447 markings, 5111602 edges, 18757 markings/sec, 50 secs
lola: 1146541 markings, 5434557 edges, 18619 markings/sec, 55 secs
lola: 1252474 markings, 5785221 edges, 21187 markings/sec, 60 secs
lola: 1357651 markings, 6153959 edges, 21035 markings/sec, 65 secs
lola: 1452172 markings, 6520247 edges, 18904 markings/sec, 70 secs
lola: 1539295 markings, 6932168 edges, 17425 markings/sec, 75 secs
lola: 1625653 markings, 7369322 edges, 17272 markings/sec, 80 secs
lola: 1699877 markings, 8154751 edges, 14845 markings/sec, 85 secs
lola: 1781014 markings, 8933912 edges, 16227 markings/sec, 90 secs
lola: 1864622 markings, 9669063 edges, 16722 markings/sec, 95 secs
lola: 1938775 markings, 10431160 edges, 14831 markings/sec, 100 secs
lola: 2025871 markings, 10919423 edges, 17419 markings/sec, 105 secs
lola: 2123654 markings, 11206986 edges, 19557 markings/sec, 110 secs
lola: 2227928 markings, 11571840 edges, 20855 markings/sec, 115 secs
lola: 2325360 markings, 11926011 edges, 19486 markings/sec, 120 secs
lola: 2413707 markings, 12234636 edges, 17669 markings/sec, 125 secs
lola: 2497617 markings, 12602084 edges, 16782 markings/sec, 130 secs
lola: 2593758 markings, 13012306 edges, 19228 markings/sec, 135 secs
lola: 2700661 markings, 13465676 edges, 21381 markings/sec, 140 secs
lola: 2791290 markings, 13902848 edges, 18126 markings/sec, 145 secs
lola: 2883175 markings, 14327236 edges, 18377 markings/sec, 150 secs
lola: 2978628 markings, 14683745 edges, 19091 markings/sec, 155 secs
lola: 3071898 markings, 15103394 edges, 18654 markings/sec, 160 secs
lola: 3157537 markings, 15515040 edges, 17128 markings/sec, 165 secs
lola: 3252810 markings, 15886068 edges, 19055 markings/sec, 170 secs
lola: 3344004 markings, 16257398 edges, 18239 markings/sec, 175 secs
lola: 3431634 markings, 16643369 edges, 17526 markings/sec, 180 secs
lola: 3525653 markings, 17069891 edges, 18804 markings/sec, 185 secs
lola: 3626237 markings, 17545131 edges, 20117 markings/sec, 190 secs
lola: 3712916 markings, 18027176 edges, 17336 markings/sec, 195 secs
lola: 3794187 markings, 18671498 edges, 16254 markings/sec, 200 secs
lola: 3868959 markings, 19458256 edges, 14954 markings/sec, 205 secs
lola: 3964833 markings, 19945802 edges, 19175 markings/sec, 210 secs
lola: 4073479 markings, 20309998 edges, 21729 markings/sec, 215 secs
lola: 4176343 markings, 20694515 edges, 20573 markings/sec, 220 secs
lola: 4280504 markings, 21061757 edges, 20832 markings/sec, 225 secs
lola: 4379677 markings, 21489875 edges, 19835 markings/sec, 230 secs
lola: 4479625 markings, 21880098 edges, 19990 markings/sec, 235 secs
lola: 4574973 markings, 22258164 edges, 19070 markings/sec, 240 secs
lola: 4665274 markings, 22662794 edges, 18060 markings/sec, 245 secs
lola: 4761105 markings, 22978775 edges, 19166 markings/sec, 250 secs
lola: 4864414 markings, 23374956 edges, 20662 markings/sec, 255 secs
lola: 4956920 markings, 23807640 edges, 18501 markings/sec, 260 secs
lola: 5057510 markings, 24307421 edges, 20118 markings/sec, 265 secs
lola: 5159279 markings, 24728597 edges, 20354 markings/sec, 270 secs
lola: 5260134 markings, 25115440 edges, 20171 markings/sec, 275 secs
lola: 5350555 markings, 25525746 edges, 18084 markings/sec, 280 secs
lola: 5442117 markings, 25913577 edges, 18312 markings/sec, 285 secs
lola: 5538523 markings, 26352645 edges, 19281 markings/sec, 290 secs
lola: 5634329 markings, 26865651 edges, 19161 markings/sec, 295 secs

lola: 5728811 markings, 27367024 edges, 18896 markings/sec, 300 secs
lola: 5827943 markings, 27783829 edges, 19826 markings/sec, 305 secs
lola: 5922398 markings, 28160905 edges, 18891 markings/sec, 310 secs
lola: 6011417 markings, 28523723 edges, 17804 markings/sec, 315 secs
lola: 6106766 markings, 28971456 edges, 19070 markings/sec, 320 secs
lola: 6201105 markings, 29388247 edges, 18868 markings/sec, 325 secs
lola: 6291176 markings, 29833929 edges, 18014 markings/sec, 330 secs
lola: 6378941 markings, 30269166 edges, 17553 markings/sec, 335 secs
lola: 6464789 markings, 30699731 edges, 17170 markings/sec, 340 secs
lola: 6562180 markings, 31065188 edges, 19478 markings/sec, 345 secs
lola: 6653625 markings, 31437374 edges, 18289 markings/sec, 350 secs
lola: 6747662 markings, 31846237 edges, 18807 markings/sec, 355 secs
lola: 6839964 markings, 32249243 edges, 18460 markings/sec, 360 secs
lola: 6932032 markings, 32703298 edges, 18414 markings/sec, 365 secs
lola: 7021437 markings, 33090197 edges, 17881 markings/sec, 370 secs
lola: 7107166 markings, 33502920 edges, 17146 markings/sec, 375 secs
lola: 7195075 markings, 33893700 edges, 17582 markings/sec, 380 secs
lola: 7302010 markings, 34314884 edges, 21387 markings/sec, 385 secs
lola: 7389913 markings, 34764204 edges, 17581 markings/sec, 390 secs
lola: 7482629 markings, 35219885 edges, 18543 markings/sec, 395 secs
lola: 7568616 markings, 35656405 edges, 17197 markings/sec, 400 secs
lola: 7653462 markings, 36080500 edges, 16969 markings/sec, 405 secs
lola: 7744177 markings, 36536452 edges, 18143 markings/sec, 410 secs
lola: 7832432 markings, 37039531 edges, 17651 markings/sec, 415 secs
lola: 7915172 markings, 37510075 edges, 16548 markings/sec, 420 secs
lola: 8052245 markings, 38147083 edges, 27415 markings/sec, 425 secs
lola: 8186151 markings, 38894093 edges, 26781 markings/sec, 430 secs
lola: 8313466 markings, 39653423 edges, 25463 markings/sec, 435 secs
lola: 8416722 markings, 40075305 edges, 20651 markings/sec, 440 secs
lola: 8522937 markings, 40542512 edges, 21243 markings/sec, 445 secs
lola: 8642737 markings, 41179321 edges, 23960 markings/sec, 450 secs
lola: 8754564 markings, 41836327 edges, 22365 markings/sec, 455 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown no no unknown unknown yes yes unknown yes unknown no unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown no no unknown unknown yes yes unknown yes unknown no unknown unknown
lola: memory consumption: 437712 KB
lola: time consumption: 777 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((c11 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((c11 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))
lola: processed formula length: 86
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: 363383 markings, 1903827 edges, 72677 markings/sec, 0 secs
lola: 658122 markings, 3713081 edges, 58948 markings/sec, 5 secs
lola: 922911 markings, 5480573 edges, 52958 markings/sec, 10 secs
lola: 1207046 markings, 7262646 edges, 56827 markings/sec, 15 secs
lola: 1427515 markings, 8984797 edges, 44094 markings/sec, 20 secs
lola: 1638766 markings, 10684551 edges, 42250 markings/sec, 25 secs
lola: 1848880 markings, 12386120 edges, 42023 markings/sec, 30 secs
lola: 2066845 markings, 14142029 edges, 43593 markings/sec, 35 secs
lola: 2292153 markings, 15899608 edges, 45062 markings/sec, 40 secs
lola: 2559042 markings, 17693276 edges, 53378 markings/sec, 45 secs
lola: 2829854 markings, 19498792 edges, 54162 markings/sec, 50 secs
lola: 3094930 markings, 21240826 edges, 53015 markings/sec, 55 secs
lola: 3363416 markings, 22913516 edges, 53697 markings/sec, 60 secs
lola: 3594733 markings, 24561572 edges, 46263 markings/sec, 65 secs
lola: 3822172 markings, 26207177 edges, 45488 markings/sec, 70 secs
lola: 4073087 markings, 27944805 edges, 50183 markings/sec, 75 secs
lola: 4336949 markings, 29699528 edges, 52772 markings/sec, 80 secs
lola: 4539553 markings, 31415501 edges, 40521 markings/sec, 85 secs
lola: 4737996 markings, 33115918 edges, 39689 markings/sec, 90 secs
lola: 4936795 markings, 34800379 edges, 39760 markings/sec, 95 secs
lola: 5135489 markings, 36489686 edges, 39739 markings/sec, 100 secs
lola: 5330510 markings, 38174937 edges, 39004 markings/sec, 105 secs
lola: 5531163 markings, 39846021 edges, 40131 markings/sec, 110 secs
lola: 5733815 markings, 41525037 edges, 40530 markings/sec, 115 secs
lola: 5950937 markings, 43218252 edges, 43424 markings/sec, 120 secs
lola: 6186788 markings, 44931495 edges, 47170 markings/sec, 125 secs
lola: 6381506 markings, 46623874 edges, 38944 markings/sec, 130 secs
lola: 6572930 markings, 48319850 edges, 38285 markings/sec, 135 secs
lola: 6759392 markings, 50045605 edges, 37292 markings/sec, 140 secs
lola: 6948864 markings, 51719072 edges, 37894 markings/sec, 145 secs
lola: 7132901 markings, 53414230 edges, 36807 markings/sec, 150 secs
lola: 7322195 markings, 55073755 edges, 37859 markings/sec, 155 secs
lola: 7503312 markings, 56739426 edges, 36223 markings/sec, 160 secs
lola: 7692637 markings, 58406991 edges, 37865 markings/sec, 165 secs
lola: 7876914 markings, 60048232 edges, 36855 markings/sec, 170 secs
lola: 8065009 markings, 61706620 edges, 37619 markings/sec, 175 secs
lola: 8263059 markings, 63348517 edges, 39610 markings/sec, 180 secs
lola: 8478881 markings, 65027753 edges, 43164 markings/sec, 185 secs
lola: 8705520 markings, 66717512 edges, 45328 markings/sec, 190 secs
lola: 8906656 markings, 68409576 edges, 40227 markings/sec, 195 secs
lola: 9108965 markings, 70146656 edges, 40462 markings/sec, 200 secs
lola: 9311517 markings, 71867347 edges, 40510 markings/sec, 205 secs
lola: 9511822 markings, 73565865 edges, 40061 markings/sec, 210 secs
lola: 9705333 markings, 75249707 edges, 38702 markings/sec, 215 secs
lola: 9904938 markings, 76903543 edges, 39921 markings/sec, 220 secs
lola: 10108829 markings, 78569283 edges, 40778 markings/sec, 225 secs
lola: 10330590 markings, 80236329 edges, 44352 markings/sec, 230 secs
lola: 10581034 markings, 81927826 edges, 50089 markings/sec, 235 secs
lola: 10814165 markings, 83604154 edges, 46626 markings/sec, 240 secs
lola: 11056878 markings, 85323206 edges, 48543 markings/sec, 245 secs
lola: 11302491 markings, 87012662 edges, 49123 markings/sec, 250 secs
lola: 11572493 markings, 88783158 edges, 54000 markings/sec, 255 secs
lola: 11813950 markings, 90548537 edges, 48291 markings/sec, 260 secs
lola: 12050761 markings, 92311271 edges, 47362 markings/sec, 265 secs
lola: 12290926 markings, 94060060 edges, 48033 markings/sec, 270 secs
lola: 12556900 markings, 95820776 edges, 53195 markings/sec, 275 secs
lola: 12768448 markings, 97475633 edges, 42310 markings/sec, 280 secs
lola: 12953627 markings, 99081543 edges, 37036 markings/sec, 285 secs
lola: 13137869 markings, 100674956 edges, 36848 markings/sec, 290 secs
lola: 13323332 markings, 102281388 edges, 37093 markings/sec, 295 secs
lola: 13503884 markings, 103898948 edges, 36110 markings/sec, 300 secs
lola: 13685496 markings, 105472081 edges, 36322 markings/sec, 305 secs
lola: 13862401 markings, 107055768 edges, 35381 markings/sec, 310 secs
lola: 14048041 markings, 108626032 edges, 37128 markings/sec, 315 secs
lola: 14226038 markings, 110183344 edges, 35599 markings/sec, 320 secs
lola: 14414515 markings, 111745073 edges, 37695 markings/sec, 325 secs
lola: 14607169 markings, 113306357 edges, 38531 markings/sec, 330 secs
lola: 14831908 markings, 114891326 edges, 44948 markings/sec, 335 secs
lola: 15011479 markings, 116483066 edges, 35914 markings/sec, 340 secs
lola: 15187513 markings, 118037242 edges, 35207 markings/sec, 345 secs
lola: 15360614 markings, 119596035 edges, 34620 markings/sec, 350 secs
lola: 15530957 markings, 121188466 edges, 34069 markings/sec, 355 secs
lola: 15705629 markings, 122827025 edges, 34934 markings/sec, 360 secs
lola: 15882251 markings, 124419586 edges, 35324 markings/sec, 365 secs
lola: 16049715 markings, 126008311 edges, 33493 markings/sec, 370 secs
lola: 16223666 markings, 127562938 edges, 34790 markings/sec, 375 secs
lola: 16390151 markings, 129110407 edges, 33297 markings/sec, 380 secs
lola: 16561650 markings, 130722354 edges, 34300 markings/sec, 385 secs
lola: 16742078 markings, 132325213 edges, 36086 markings/sec, 390 secs
lola: 16923046 markings, 133979880 edges, 36194 markings/sec, 395 secs
lola: 17108790 markings, 135687753 edges, 37149 markings/sec, 400 secs
lola: 17306457 markings, 137374438 edges, 39533 markings/sec, 405 secs
lola: 17505636 markings, 139094046 edges, 39836 markings/sec, 410 secs
lola: 17743026 markings, 140847231 edges, 47478 markings/sec, 415 secs
lola: 17961262 markings, 142588462 edges, 43647 markings/sec, 420 secs
lola: 18142620 markings, 144224458 edges, 36272 markings/sec, 425 secs
lola: 18313552 markings, 145858466 edges, 34186 markings/sec, 430 secs
lola: 18492861 markings, 147475928 edges, 35862 markings/sec, 435 secs
lola: 18662478 markings, 149093876 edges, 33923 markings/sec, 440 secs
lola: 18831167 markings, 150733568 edges, 33738 markings/sec, 445 secs
lola: 19008890 markings, 152331752 edges, 35545 markings/sec, 450 secs
lola: 19175554 markings, 153942687 edges, 33333 markings/sec, 455 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown no no unknown unknown yes yes unknown yes unknown no unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown no no unknown unknown yes yes unknown yes unknown no unknown unknown
lola: memory consumption: 870308 KB
lola: time consumption: 1242 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((c18 <= in4_6 + in4_7))) AND ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= 1) OR (in4_6 + in4_7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (c18 <= in4_6 + in4_7))) OR ((2 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (1 <= in4_6 + in4_7)))))
lola: processed formula length: 161
lola: 24 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: 161 markings, 331 edges
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((aux14_0 + 1 <= aux8_2) OR E (G ((out4_3 <= out1_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (aux14_0 + 1 <= aux8_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux14_0 + 1 <= aux8_2)
lola: processed formula length: 23
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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 13 will run for 775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((out4_3 <= out1_3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((out4_3 <= out1_3)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file PermAdmissibility-PT-10-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: 161 markings, 160 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA PermAdmissibility-PT-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((out8_5 <= out4_0) AND E (F (((out1_3 + 1 <= aux12_3) AND (c18 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes yes no no unknown unknown yes yes unknown yes yes no unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 25060 KB
lola: time consumption: 2017 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes unknown yes yes no no unknown unknown yes yes unknown yes yes no unknown unknown
lola:
preliminary result: yes unknown yes yes no no unknown unknown yes yes unknown yes yes no unknown unknown
lola: memory consumption: 25060 KB
lola: time consumption: 3569 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="PermAdmissibility-PT-10"
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/PermAdmissibility-PT-10.tgz
mv PermAdmissibility-PT-10 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 PermAdmissibility-PT-10, 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 r112-csrt-152666469600493"
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 ;