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 196K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GlobalResAllocation-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546700103
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527891159625

info: Time: 3600 - MCC
===========================================================================================
prep: translating GlobalResAllocation-COL-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GlobalResAllocation-COL-03 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ GlobalResAllocation-COL-03 @ 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: 4824/65536 symbol table entries, 1224 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-03-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p14 + p13 + p12 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)
lola: after: (0 <= 0)
lola: always true
lola: A (X (X (X ((2 <= p14 + p13 + p12))))) : A ((F (F ((3 <= p6 + p7 + p8 + p9 + p10 + p11))) U G ((p0 + p1 + p2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)))) : A (F (F ((2 <= p6 + p7 + p8 + p9 + p10 + p11)))) : A ((G (X ((p14 + p13 + p12 <= p3 + p4 + p5))) U X (F ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))))) : A (F (X (((2 <= p0 + p1 + p2) U TRUE)))) : A ((3 <= p6 + p7 + p8 + p9 + p10 + p11)) : A (F (X (X ((p14 + p13 + p12 <= p0 + p1 + p2))))) : A (F (G (G (G ((2 <= p0 + p1 + p2)))))) : A (((p6 + p7 + p8 + p9 + p10 + p11 <= p3 + p4 + p5) U ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32) U (p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11)))) : A ((F (G ((2 <= p3 + p4 + p5))) U X ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)))) : A (G ((F ((1 <= p14 + p13 + p12)) U G ((2 <= p14 + p13 + p12))))) : A (G ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))) : A (G (F (X (F ((1 <= p14 + p13 + p12)))))) : A ((p3 + p4 + p5 <= p0 + p1 + p2)) : A ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) : A (G ((p14 + p13 + p12 <= p6 + p7 + p8 + p9 + p10 + p11)))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p6 + p7 + p8 + p9 + p10 + p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p6 + p7 + p8 + p9 + p10 + p11)
lola: processed formula length: 36
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
check_solution: Variable C203 = -1 is below its lower bound 0
check_solution: Variable C3657 = -1 is below its lower bound 0
check_solution: Variable C3904 = -1 is below its lower bound 0
check_solution: Variable C3922 = -1 is below its lower bound 0
check_solution: Variable C3945 = -1 is below its lower bound 0
check_solution: Variable C3981 = -1 is below its lower bound 0
check_solution: Variable C4027 = -1 is below its lower bound 0
check_solution: Variable C4036 = -1 is below its lower bound 0
check_solution: Variable C4045 = -1 is below its lower bound 0
check_solution: Variable C4055 = -1 is below its lower bound 0

Seriously low accuracy found ||*|| = 2 (rel. error 2)
check_solution: Constraint R5 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R6 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R7 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R8 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R9 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R10 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R11 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R12 = 2.12199579146e-313 is above its equality of -1
check_solution: Constraint R27 = 2.12199579146e-313 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R1 = 6.89876863564e-310 is above its upper bound -2
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1
check_solution: Constraint R12 = 0 is above its equality of -1
check_solution: Constraint R27 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 2 (rel. error 1)

FORMULA GlobalResAllocation-COL-03-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 + p4 + p5 <= p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 + p4 + p5 <= p0 + p1 + p2)
lola: processed formula length: 30
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.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: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)
lola: processed formula length: 112
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.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: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((2 <= p14 + p13 + p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X ((2 <= p14 + p13 + p12)))))
lola: processed formula length: 38
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40 markings, 121 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p14 + p13 + p12 <= p0 + p1 + p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p14 + p13 + p12 <= p0 + p1 + p2)))))
lola: processed formula length: 49
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2725 markings, 31806 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) OR (X (F ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))) AND F (G ((2 <= p3 + p4 + p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) OR (X (F ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))) AND F (G ((2 <= p3 + p4 + p5))))))
lola: processed formula length: 280
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 468 markings, 4165 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) OR (G ((p14 + p13 + p12 <= p3 + p4 + p5)) AND F ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)) OR (G ((p14 + p13 + p12 <= p3 + p4 + p5)) AND F ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))))))
lola: processed formula length: 290
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 276 markings, 2419 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 169 markings, 1548 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p14 + p13 + p12 <= p6 + p7 + p8 + p9 + p10 + p11)))
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 ((p14 + p13 + p12 <= p6 + p7 + p8 + p9 + p10 + p11)))
lola: processed formula length: 58
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.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: (p6 + p7 + p8 + p9 + p10 + p11 + 1 <= p14 + p13 + p12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-LTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-LTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)))
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 ((3 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32)))
lola: processed formula length: 120
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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 GlobalResAllocation-COL-03-LTLCardinality-9-0.sara
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p6 + p7 + p8 + p9 + p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p6 + p7 + p8 + p9 + p10 + p11 <= 1)
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p14 + p13 + p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p14 + p13 + p12))))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6167 markings, 76104 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-03-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= p0 + p1 + p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p0 + p1 + p2))))
lola: processed formula length: 31
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 3868
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2960 markings, 13771 edges
lola:
FORMULA GlobalResAllocation-COL-03-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= p6 + p7 + p8 + p9 + p10 + p11)) U G ((p0 + p1 + p2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= p6 + p7 + p8 + p9 + p10 + p11)) U G ((p0 + p1 + p2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32))))
lola: processed formula length: 176
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p6 + p7 + p8 + p9 + p10 + p11 <= p3 + p4 + p5) U ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32) U (p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p6 + p7 + p8 + p9 + p10 + p11 <= p3 + p4 + p5) U ((2 <= p25 + p24 + p23 + p22 + p15 + p16 + p17 + p18 + p19 + p21 + p20 + p26 + p27 + p28 + p29 + p30 + p31 + p32) U (p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11))))
lola: processed formula length: 220
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((2 <= p14 + p13 + p12)))) AND A (G ((F ((1 <= p14 + p13 + p12)) OR G ((2 <= p14 + p13 + p12))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= p14 + p13 + p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p14 + p13 + p12))))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file GlobalResAllocation-COL-03-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 969 markings, 1952 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola:
FORMULA GlobalResAllocation-COL-03-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes no yes no no no yes no no no
lola:
preliminary result: no no yes no yes yes yes no yes no no no yes no no no
========================================
lola: memory consumption: 83104 KB
lola: time consumption: 80 seconds

BK_STOP 1527891240702

--------------------
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="GlobalResAllocation-COL-03"
export BK_EXAMINATION="LTLCardinality"
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/GlobalResAllocation-COL-03.tgz
mv GlobalResAllocation-COL-03 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 GlobalResAllocation-COL-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r244-blw7-152732546700103"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;