fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469500479
Last Updated
June 26, 2018

About the Execution of LoLA for PermAdmissibility-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10110.710 3600000.00 1297984.00 549.00 FTTFF????F??FTTT normal

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 892K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K 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 10K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 26K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 481K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500479
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527037191945

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-PT-02 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ PermAdmissibility-PT-02 @ 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-02-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= c12)
lola: LP says that atomic proposition is always false: (3 <= c16)
lola: LP says that atomic proposition is always false: (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)
lola: LP says that atomic proposition is always false: (3 <= out3_2)
lola: LP says that atomic proposition is always false: (3 <= aux6_1)
lola: LP says that atomic proposition is always false: (3 <= aux13_7)
lola: E (X ((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A (F ((2 <= c20)))))) : E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))) : (E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1)))) AND E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))) : A (F (())) : (NOT((E (F ((in2_2 + in2_3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) AND A (X ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) OR (A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) OR E (G (((3 <= in2_2 + in2_3)))))) : E (G (E (F (((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5)))))) : E (G (NOT(A (G ((3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))) : NOT(A (F (A (G ((c9 <= in3_4 + in3_5)))))) : (((((aux16_6 + 1 <= c15)) OR (2 <= out7_5)) AND A (F (((aux15_2 <= aux11_3) AND (2 <= out7_5))))) OR E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7))))) : A ((A (X ((out8_5 <= c110))) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4)))) : E (F ((A (F ((1 <= c19))) AND (aux13_0 + 1 <= out4_5)))) : NOT((A (F (((2 <= out6_0) OR (2 <= aux9_0)))) OR E (G ((aux10_3 + 1 <= out5_1))))) : A (X (A (F (((2 <= in1_1) AND (out6_6 <= out1_5)))))) : E (G ((out1_4 <= aux6_4))) : ((((1 <= out2_7) AND (aux7_3 <= aux11_2)) AND (E (F ((2 <= out7_6))) AND FALSE)) OR E (G (E (G ((c8 <= in4_6)))))) : A (F ((A (X (FALSE)) OR E (G ((out1_3 <= out4_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 33 rewrites
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-3 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: (E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1)))) AND E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))))
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: E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1))))
lola: processed formula length: 187
lola: 33 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))
lola: processed formula length: 156
lola: 34 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PermAdmissibility-PT-02-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: E (X ((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A (F ((2 <= c20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A(TRUE U (2 <= c20))))
lola: processed formula length: 304
lola: 35 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 38 markings, 40 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-0 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 ((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in2_2 + in2_3))) OR (E (X ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1))) OR (A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) OR E (G (((3 <= in2_2 + in2_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in2_2 + in2_3)))
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:695
lola: processed formula: A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in2_2 + in2_3)))
lola: processed formula length: 64
lola: 35 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1))
lola: processed formula length: 44
lola: 34 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= in2_2 + in2_3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((3 <= in2_2 + in2_3))))
lola: processed formula length: 30
lola: 33 rewrites
lola: closed formula file PermAdmissibility-PT-02-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 is not possibly preserved.
lola: 91 markings, 140 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
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 (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
lola: processed formula length: 102
lola: 35 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: ((c14 <= 1) OR (out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= c6))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to PermAdmissibility-PT-02-CTLCardinality-6-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: state equation: calling and running sara
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((out8_5 <= c110))) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(AX((out8_5 <= c110)) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4)))
lola: processed formula length: 74
lola: 35 rewrites
lola: closed formula file PermAdmissibility-PT-02-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).
sara: try reading problem file PermAdmissibility-PT-02-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2365 markings, 2368 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((2 <= in1_1) AND (out6_6 <= out1_5))))))
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: ((in1_1 <= 1) OR (out1_5 + 1 <= out6_6))
lola: processed formula length: 41
lola: 35 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 32 markings, 31 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((out1_4 <= aux6_4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((out1_4 <= aux6_4)))
lola: processed formula length: 26
lola: 33 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 32 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((c8 <= in4_6)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((c8 <= in4_6)))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 32 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: processed formula length: 198
lola: 33 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 36 markings, 35 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((DEADLOCK OR E (G ((out1_3 <= out4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (DEADLOCK OR NOT(A(TRUE U (out4_2 + 1 <= out1_3)))))
lola: processed formula length: 61
lola: 36 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 33 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((1 <= c19))) AND (aux13_0 + 1 <= out4_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (A(TRUE U (1 <= c19)) AND (aux13_0 + 1 <= out4_5)))
lola: processed formula length: 60
lola: 35 rewrites
lola: closed formula file PermAdmissibility-PT-02-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).
sara: place or transition ordering is non-deterministic

lola: 1293182 markings, 1848260 edges, 258636 markings/sec, 0 secs
lola: 2603638 markings, 3769544 edges, 262091 markings/sec, 5 secs
lola: 3986957 markings, 5631126 edges, 276664 markings/sec, 10 secs
lola: 5236195 markings, 7516415 edges, 249848 markings/sec, 15 secs
lola: 6486147 markings, 9343770 edges, 249990 markings/sec, 20 secs
lola: 7769940 markings, 11227846 edges, 256759 markings/sec, 25 secs
lola: 9029813 markings, 13081582 edges, 251975 markings/sec, 30 secs
lola: 10291444 markings, 14928417 edges, 252326 markings/sec, 35 secs
lola: 11396270 markings, 16785722 edges, 220965 markings/sec, 40 secs
lola: 12383470 markings, 18770450 edges, 197440 markings/sec, 45 secs
lola: 13338951 markings, 20734175 edges, 191096 markings/sec, 50 secs
lola: 14344080 markings, 22641113 edges, 201026 markings/sec, 55 secs
lola: 15288647 markings, 24614859 edges, 188913 markings/sec, 60 secs
lola: 16298190 markings, 26548282 edges, 201909 markings/sec, 65 secs
lola: 17426640 markings, 28471877 edges, 225690 markings/sec, 70 secs
lola: 18648653 markings, 30227819 edges, 244403 markings/sec, 75 secs
lola: 19956988 markings, 32023319 edges, 261667 markings/sec, 80 secs
lola: 21175263 markings, 33780306 edges, 243655 markings/sec, 85 secs
lola: 22431060 markings, 35562940 edges, 251159 markings/sec, 90 secs
lola: 23660390 markings, 37333026 edges, 245866 markings/sec, 95 secs
lola: 24707336 markings, 39193336 edges, 209389 markings/sec, 100 secs
lola: 25690915 markings, 41062444 edges, 196716 markings/sec, 105 secs
lola: 26738642 markings, 42891736 edges, 209545 markings/sec, 110 secs
lola: 27766505 markings, 44717807 edges, 205573 markings/sec, 115 secs
lola: 28891765 markings, 46577613 edges, 225052 markings/sec, 120 secs
lola: 30100494 markings, 48335801 edges, 241746 markings/sec, 125 secs
lola: 31221794 markings, 50147978 edges, 224260 markings/sec, 130 secs
lola: 32357929 markings, 51959039 edges, 227227 markings/sec, 135 secs
lola: 33442670 markings, 53796871 edges, 216948 markings/sec, 140 secs
lola: 34622027 markings, 55541797 edges, 235871 markings/sec, 145 secs
lola: 35681326 markings, 57345187 edges, 211860 markings/sec, 150 secs
lola: 36736993 markings, 59073939 edges, 211133 markings/sec, 155 secs
lola: 37876204 markings, 60836832 edges, 227842 markings/sec, 160 secs
lola: 39107642 markings, 62512121 edges, 246288 markings/sec, 165 secs
lola: 40311353 markings, 64142681 edges, 240742 markings/sec, 170 secs
lola: 41474171 markings, 65733831 edges, 232564 markings/sec, 175 secs
lola: 42560630 markings, 67432411 edges, 217292 markings/sec, 180 secs
lola: 43610080 markings, 69184450 edges, 209890 markings/sec, 185 secs
lola: 44582624 markings, 70852509 edges, 194509 markings/sec, 190 secs
lola: 45581069 markings, 72357441 edges, 199689 markings/sec, 195 secs
lola: 46629266 markings, 73838854 edges, 209639 markings/sec, 200 secs
lola: 47549926 markings, 75452591 edges, 184132 markings/sec, 205 secs
lola: 48553689 markings, 77172914 edges, 200753 markings/sec, 210 secs
lola: 49759258 markings, 78808441 edges, 241114 markings/sec, 215 secs
lola: 50918252 markings, 80466643 edges, 231799 markings/sec, 220 secs
lola: 52108806 markings, 82126644 edges, 238111 markings/sec, 225 secs
lola: 53295112 markings, 83772193 edges, 237261 markings/sec, 230 secs
lola: 54471109 markings, 85381316 edges, 235199 markings/sec, 235 secs
lola: 55703690 markings, 86980050 edges, 246516 markings/sec, 240 secs
lola: 56775356 markings, 88559171 edges, 214333 markings/sec, 245 secs
lola: 57883476 markings, 90188433 edges, 221624 markings/sec, 250 secs
lola: 59065755 markings, 91814339 edges, 236456 markings/sec, 255 secs
lola: 60268203 markings, 93431750 edges, 240490 markings/sec, 260 secs
lola: 61392993 markings, 95057418 edges, 224958 markings/sec, 265 secs
lola: 62495233 markings, 96655557 edges, 220448 markings/sec, 270 secs
lola: 63681343 markings, 98209949 edges, 237222 markings/sec, 275 secs
lola: 64702923 markings, 99818374 edges, 204316 markings/sec, 280 secs
lola: 65702979 markings, 101454018 edges, 200011 markings/sec, 285 secs
lola: 66646716 markings, 103233570 edges, 188747 markings/sec, 290 secs
lola: 67574720 markings, 104945875 edges, 185601 markings/sec, 295 secs
lola: 68483095 markings, 106720596 edges, 181675 markings/sec, 300 secs
lola: 69450889 markings, 108398791 edges, 193559 markings/sec, 305 secs
lola: 70382146 markings, 110131932 edges, 186251 markings/sec, 310 secs
lola: 71352810 markings, 111808878 edges, 194133 markings/sec, 315 secs
lola: 72278677 markings, 113502819 edges, 185173 markings/sec, 320 secs
lola: 73184107 markings, 115234528 edges, 181086 markings/sec, 325 secs
lola: 74251443 markings, 116868604 edges, 213467 markings/sec, 330 secs
lola: 75359350 markings, 118458846 edges, 221581 markings/sec, 335 secs
lola: 76429156 markings, 119962938 edges, 213961 markings/sec, 340 secs
lola: 77367013 markings, 121663353 edges, 187571 markings/sec, 345 secs
lola: 78452644 markings, 123261055 edges, 217126 markings/sec, 350 secs
lola: 79555518 markings, 124871136 edges, 220575 markings/sec, 355 secs
lola: 80503503 markings, 126405518 edges, 189597 markings/sec, 360 secs
lola: 81476180 markings, 127971952 edges, 194535 markings/sec, 365 secs
lola: 82497784 markings, 129356001 edges, 204321 markings/sec, 370 secs
lola: 83547576 markings, 130750643 edges, 209958 markings/sec, 375 secs
lola: 84643475 markings, 132248893 edges, 219180 markings/sec, 380 secs
lola: 85687983 markings, 133706506 edges, 208902 markings/sec, 385 secs
lola: 86719733 markings, 135142913 edges, 206350 markings/sec, 390 secs
lola: 87624160 markings, 136622792 edges, 180885 markings/sec, 395 secs
lola: 88506230 markings, 138126080 edges, 176414 markings/sec, 400 secs
lola: 89402869 markings, 139604012 edges, 179328 markings/sec, 405 secs
lola: 90270144 markings, 141158850 edges, 173455 markings/sec, 410 secs
lola: 91363020 markings, 142828595 edges, 218575 markings/sec, 415 secs
lola: 92474968 markings, 144493476 edges, 222390 markings/sec, 420 secs
lola: 93559247 markings, 146168981 edges, 216856 markings/sec, 425 secs
lola: 94583167 markings, 147837160 edges, 204784 markings/sec, 430 secs
lola: 95407937 markings, 149560642 edges, 164954 markings/sec, 435 secs
lola: 96182564 markings, 151335833 edges, 154925 markings/sec, 440 secs
lola: 97083639 markings, 153023918 edges, 180215 markings/sec, 445 secs
lola: 98162439 markings, 154596969 edges, 215760 markings/sec, 450 secs
lola: 99217521 markings, 156178562 edges, 211016 markings/sec, 455 secs
lola: 100101562 markings, 157787612 edges, 176808 markings/sec, 460 secs
lola: 100919569 markings, 159478787 edges, 163601 markings/sec, 465 secs
lola: 102018798 markings, 161098826 edges, 219846 markings/sec, 470 secs
lola: 103143384 markings, 162712024 edges, 224917 markings/sec, 475 secs
lola: 104297893 markings, 164293807 edges, 230902 markings/sec, 480 secs
lola: 105412008 markings, 165893929 edges, 222823 markings/sec, 485 secs
lola: 106542128 markings, 167507729 edges, 226024 markings/sec, 490 secs
lola: 107597820 markings, 169027024 edges, 211138 markings/sec, 495 secs
lola: 108542664 markings, 170508026 edges, 188969 markings/sec, 500 secs
lola: 109399547 markings, 172051167 edges, 171377 markings/sec, 505 secs
lola: 110284368 markings, 173619157 edges, 176964 markings/sec, 510 secs
lola: 111169518 markings, 175269027 edges, 177030 markings/sec, 515 secs
lola: 112110189 markings, 176872758 edges, 188134 markings/sec, 520 secs
lola: 113038361 markings, 178475849 edges, 185634 markings/sec, 525 secs
lola: 114089925 markings, 180014761 edges, 210313 markings/sec, 530 secs
lola: 115141563 markings, 181566149 edges, 210328 markings/sec, 535 secs
lola: 116020325 markings, 183166967 edges, 175752 markings/sec, 540 secs
lola: 116860057 markings, 184802526 edges, 167946 markings/sec, 545 secs
lola: 117795019 markings, 186450573 edges, 186992 markings/sec, 550 secs
lola: 118841943 markings, 188028751 edges, 209385 markings/sec, 555 secs
lola: 119889440 markings, 189547298 edges, 209499 markings/sec, 560 secs
lola: 120995513 markings, 191074338 edges, 221215 markings/sec, 565 secs
lola: 121992138 markings, 192589292 edges, 199325 markings/sec, 570 secs
lola: 122991509 markings, 193994259 edges, 199874 markings/sec, 575 secs
lola: 123980730 markings, 195433763 edges, 197844 markings/sec, 580 secs
lola: 124845311 markings, 196890946 edges, 172916 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no no unknown unknown unknown unknown no unknown unknown no yes yes yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((in3_4 + in3_5 + 1 <= c9)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (in3_4 + in3_5 + 1 <= c9)
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 987974 markings, 2598438 edges, 197595 markings/sec, 0 secs
lola: 1896516 markings, 5259282 edges, 181708 markings/sec, 5 secs
lola: 2853290 markings, 7747487 edges, 191355 markings/sec, 10 secs
lola: 3807266 markings, 10128462 edges, 190795 markings/sec, 15 secs
lola: 4738996 markings, 12541491 edges, 186346 markings/sec, 20 secs
lola: 5668326 markings, 14898192 edges, 185866 markings/sec, 25 secs
lola: 6574198 markings, 17270598 edges, 181174 markings/sec, 30 secs
lola: 7469700 markings, 19635655 edges, 179100 markings/sec, 35 secs
lola: 8310009 markings, 22210739 edges, 168062 markings/sec, 40 secs
lola: 9128684 markings, 24778525 edges, 163735 markings/sec, 45 secs
lola: 9980597 markings, 27255755 edges, 170383 markings/sec, 50 secs
lola: 10773262 markings, 29885796 edges, 158533 markings/sec, 55 secs
lola: 11613610 markings, 32395352 edges, 168070 markings/sec, 60 secs
lola: 12529148 markings, 34714506 edges, 183108 markings/sec, 65 secs
lola: 13441087 markings, 36998292 edges, 182388 markings/sec, 70 secs
lola: 14342892 markings, 39280577 edges, 180361 markings/sec, 75 secs
lola: 15258194 markings, 41543490 edges, 183060 markings/sec, 80 secs
lola: 16161899 markings, 43798088 edges, 180741 markings/sec, 85 secs
lola: 17090447 markings, 45984768 edges, 185710 markings/sec, 90 secs
lola: 17973893 markings, 48378142 edges, 176689 markings/sec, 95 secs
lola: 18856440 markings, 50805300 edges, 176509 markings/sec, 100 secs
lola: 19775312 markings, 53025019 edges, 183774 markings/sec, 105 secs
lola: 20635294 markings, 55522009 edges, 171996 markings/sec, 110 secs
lola: 21454862 markings, 57951612 edges, 163914 markings/sec, 115 secs
lola: 22278603 markings, 60422933 edges, 164748 markings/sec, 120 secs
lola: 23082310 markings, 62838528 edges, 160741 markings/sec, 125 secs
lola: 23901291 markings, 65300996 edges, 163796 markings/sec, 130 secs
lola: 24693744 markings, 67713032 edges, 158491 markings/sec, 135 secs
lola: 25508596 markings, 70143912 edges, 162970 markings/sec, 140 secs
lola: 26331100 markings, 72596693 edges, 164501 markings/sec, 145 secs
lola: 27174470 markings, 75078167 edges, 168674 markings/sec, 150 secs
lola: 28001909 markings, 77542866 edges, 165488 markings/sec, 155 secs
lola: 28824347 markings, 80083310 edges, 164488 markings/sec, 160 secs
lola: 29630294 markings, 82483293 edges, 161189 markings/sec, 165 secs
lola: 30433486 markings, 84894051 edges, 160638 markings/sec, 170 secs
lola: 31334421 markings, 87379994 edges, 180187 markings/sec, 175 secs
lola: 32238759 markings, 89829690 edges, 180868 markings/sec, 180 secs
lola: 33134596 markings, 92279373 edges, 179167 markings/sec, 185 secs
lola: 34055042 markings, 94674802 edges, 184089 markings/sec, 190 secs
lola: 34960044 markings, 97085037 edges, 181000 markings/sec, 195 secs
lola: 35841780 markings, 99512725 edges, 176347 markings/sec, 200 secs
lola: 36736217 markings, 101845787 edges, 178887 markings/sec, 205 secs
lola: 37644950 markings, 104054189 edges, 181747 markings/sec, 210 secs
lola: 38543662 markings, 106379669 edges, 179742 markings/sec, 215 secs
lola: 39393094 markings, 108754924 edges, 169886 markings/sec, 220 secs
lola: 40291564 markings, 111014545 edges, 179694 markings/sec, 225 secs
lola: 41176118 markings, 113309366 edges, 176911 markings/sec, 230 secs
lola: 42058503 markings, 115527964 edges, 176477 markings/sec, 235 secs
lola: 42967812 markings, 117747543 edges, 181862 markings/sec, 240 secs
lola: 43849310 markings, 120175097 edges, 176300 markings/sec, 245 secs
lola: 44723099 markings, 122598459 edges, 174758 markings/sec, 250 secs
lola: 45589798 markings, 125043868 edges, 173340 markings/sec, 255 secs
lola: 46464143 markings, 127416891 edges, 174869 markings/sec, 260 secs
lola: 47377429 markings, 129745114 edges, 182657 markings/sec, 265 secs
lola: 48267419 markings, 132070760 edges, 177998 markings/sec, 270 secs
lola: 49129516 markings, 134506945 edges, 172419 markings/sec, 275 secs
lola: 49979506 markings, 136909880 edges, 169998 markings/sec, 280 secs
lola: 50771086 markings, 139090208 edges, 158316 markings/sec, 285 secs
lola: 51580795 markings, 141116447 edges, 161942 markings/sec, 290 secs
lola: 52366681 markings, 143180355 edges, 157177 markings/sec, 295 secs
lola: 53188533 markings, 145447791 edges, 164370 markings/sec, 300 secs
lola: 54003046 markings, 147769997 edges, 162903 markings/sec, 305 secs
lola: 54820246 markings, 150053634 edges, 163440 markings/sec, 310 secs
lola: 55699382 markings, 152300739 edges, 175827 markings/sec, 315 secs
lola: 56545659 markings, 154640031 edges, 169255 markings/sec, 320 secs
lola: 57413917 markings, 156944492 edges, 173652 markings/sec, 325 secs
lola: 58311393 markings, 159196060 edges, 179495 markings/sec, 330 secs
lola: 59153271 markings, 161535595 edges, 168376 markings/sec, 335 secs
lola: 60027481 markings, 163767475 edges, 174842 markings/sec, 340 secs
lola: 60880248 markings, 165992417 edges, 170553 markings/sec, 345 secs
lola: 61707769 markings, 168222759 edges, 165504 markings/sec, 350 secs
lola: 62556529 markings, 170429529 edges, 169752 markings/sec, 355 secs
lola: 63370559 markings, 172622183 edges, 162806 markings/sec, 360 secs
lola: 64272169 markings, 174871024 edges, 180322 markings/sec, 365 secs
lola: 65188676 markings, 177315452 edges, 183301 markings/sec, 370 secs
lola: 66014220 markings, 179933066 edges, 165109 markings/sec, 375 secs
lola: 66827994 markings, 182533337 edges, 162755 markings/sec, 380 secs
lola: 67721968 markings, 185019934 edges, 178795 markings/sec, 385 secs
lola: 68637287 markings, 187406145 edges, 183064 markings/sec, 390 secs
lola: 69546836 markings, 189803653 edges, 181910 markings/sec, 395 secs
lola: 70470537 markings, 192121449 edges, 184740 markings/sec, 400 secs
lola: 71359892 markings, 194558532 edges, 177871 markings/sec, 405 secs
lola: 72238049 markings, 196956814 edges, 175631 markings/sec, 410 secs
lola: 73167123 markings, 199282230 edges, 185815 markings/sec, 415 secs
lola: 74058994 markings, 201624636 edges, 178374 markings/sec, 420 secs
lola: 74954670 markings, 204028510 edges, 179135 markings/sec, 425 secs
lola: 75841976 markings, 206437100 edges, 177461 markings/sec, 430 secs
lola: 76715362 markings, 208894137 edges, 174677 markings/sec, 435 secs
lola: 77477331 markings, 211556357 edges, 152394 markings/sec, 440 secs
lola: 78263170 markings, 214131186 edges, 157168 markings/sec, 445 secs
lola: 79020431 markings, 216760879 edges, 151452 markings/sec, 450 secs
lola: 79842206 markings, 219235701 edges, 164355 markings/sec, 455 secs
lola: 80647416 markings, 221788932 edges, 161042 markings/sec, 460 secs
lola: 81380517 markings, 224455810 edges, 146620 markings/sec, 465 secs
lola: 82114675 markings, 227096569 edges, 146832 markings/sec, 470 secs
lola: 82922369 markings, 229594505 edges, 161539 markings/sec, 475 secs
lola: 83806564 markings, 231933061 edges, 176839 markings/sec, 480 secs
lola: 84693785 markings, 234241512 edges, 177444 markings/sec, 485 secs
lola: 85590316 markings, 236491720 edges, 179306 markings/sec, 490 secs
lola: 86476136 markings, 238807518 edges, 177164 markings/sec, 495 secs
lola: 87350696 markings, 241117339 edges, 174912 markings/sec, 500 secs
lola: 88230551 markings, 243382559 edges, 175971 markings/sec, 505 secs
lola: 89139568 markings, 245642465 edges, 181803 markings/sec, 510 secs
lola: 90050014 markings, 247862493 edges, 182089 markings/sec, 515 secs
lola: 90928579 markings, 250152372 edges, 175713 markings/sec, 520 secs
lola: 91811859 markings, 252291976 edges, 176656 markings/sec, 525 secs
lola: 92640313 markings, 254302833 edges, 165691 markings/sec, 530 secs
lola: 93414317 markings, 256571589 edges, 154801 markings/sec, 535 secs
lola: 94207194 markings, 258782117 edges, 158575 markings/sec, 540 secs
lola: 94986539 markings, 261040862 edges, 155869 markings/sec, 545 secs
lola: 95748475 markings, 263253300 edges, 152387 markings/sec, 550 secs
lola: 96619488 markings, 265245852 edges, 174203 markings/sec, 555 secs
lola: 97415121 markings, 267431436 edges, 159127 markings/sec, 560 secs
lola: 98155213 markings, 269746217 edges, 148018 markings/sec, 565 secs
lola: 98890780 markings, 271993857 edges, 147113 markings/sec, 570 secs
lola: 99628274 markings, 274294684 edges, 147499 markings/sec, 575 secs
lola: 100409764 markings, 276732546 edges, 156298 markings/sec, 580 secs
lola: 101205559 markings, 279190425 edges, 159159 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no no unknown unknown unknown unknown no unknown unknown no yes yes yes
lola: memory consumption: 4897864 KB
lola: time consumption: 1191 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((out6_0 <= 1) AND (aux9_0 <= 1)))) AND A (F ((out5_1 <= aux10_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no no unknown unknown unknown unknown no unknown unknown no yes yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 26852 KB
lola: time consumption: 1785 seconds
lola: time limit reached - aborting
lola:
preliminary result: no yes yes no no unknown unknown unknown unknown no unknown unknown no yes yes yes
lola:
preliminary result: no yes yes no no unknown unknown unknown unknown no unknown unknown no yes yes yes
lola: memory consumption: 26852 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-02"
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-02.tgz
mv PermAdmissibility-PT-02 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-02, 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-152666469500479"
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 ;