Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.6K May 30 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 28 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 27 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 27 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 67K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DoubleExponent-PT-004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169600214
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527782738489

info: Time: 3600 - MCC
===========================================================================================
prep: translating DoubleExponent-PT-004 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DoubleExponent-PT-004 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ DoubleExponent-PT-004 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 414/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6912
lola: finding significant places
lola: 216 places, 198 transitions, 192 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 268 transition conflict sets
lola: TASK
lola: reading formula from DoubleExponent-PT-004-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p62)
lola: LP says that atomic proposition is always false: (3 <= p33)
lola: LP says that atomic proposition is always false: (2 <= p135)
lola: LP says that atomic proposition is always false: (2 <= p141)
lola: LP says that atomic proposition is always false: (2 <= p160)
lola: LP says that atomic proposition is always false: (2 <= p18)
lola: LP says that atomic proposition is always false: (3 <= p200)
lola: LP says that atomic proposition is always false: (3 <= p191)
lola: LP says that atomic proposition is always false: (2 <= p158)
lola: LP says that atomic proposition is always false: (3 <= p31)
lola: LP says that atomic proposition is always false: (2 <= p63)
lola: LP says that atomic proposition is always false: (3 <= p83)
lola: LP says that atomic proposition is always false: (2 <= p151)
lola: LP says that atomic proposition is always false: (3 <= p99)
lola: E (F (FALSE)) : E (F (())) : E (F (((p152 + 1 <= p133) AND ((p61 + 1 <= p180) OR (p112 <= 0))))) : E (F (FALSE)) : A (G (())) : A (G (((p167 <= p160) OR (p2 <= p42) OR (p110 + 1 <= p62) OR (2 <= p162)))) : A (G ((p158 <= p25))) : E (F ((p89 + 1 <= p186))) : A (G (((p199 <= 0) OR (p60 <= p72) OR (((1 <= p198) OR (p97 <= p22)) AND (p94 <= 0))))) : A (G (((p214 <= p42) OR (((p154 <= p66) OR (p58 <= p113)))))) : E (F (FALSE)) : E (F ((((p58 + 1 <= p172) OR (p186 + 1 <= p185)) AND (p90 + 1 <= p164)))) : A (G (())) : E (F (FALSE)) : A (G (())) : E (F (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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 DoubleExponent-PT-004-ReachabilityCardinality-1 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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 DoubleExponent-PT-004-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-4 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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 DoubleExponent-PT-004-ReachabilityCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-12 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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 DoubleExponent-PT-004-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 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: 27 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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 DoubleExponent-PT-004-ReachabilityCardinality-15 FALSE 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: E (F ((p89 + 1 <= p186)))
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 ((p89 + 1 <= p186)))
lola: processed formula length: 25
lola: 28 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: (p89 + 1 <= p186)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 4)
lola: sara is running 0 secs || 1504487 markings, 1504486 edges, 300897 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2258401 markings, 2258400 edges

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p158 <= p25)))
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 ((p158 <= p25)))
lola: processed formula length: 21
lola: 29 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: (p25 + 1 <= p158)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5256 markings, 5255 edges
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p152 + 1 <= p133) AND ((p61 + 1 <= p180) OR (p112 <= 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 (((p152 + 1 <= p133) AND ((p61 + 1 <= p180) OR (p112 <= 0)))))
lola: processed formula length: 68
lola: 28 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: ((p152 + 1 <= p133) AND ((p61 + 1 <= p180) OR (p112 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1941 markings, 1940 edges
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p214 <= p42) OR (((p154 <= p66) OR (p58 <= p113))))))
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 (((p214 <= p42) OR (((p154 <= p66) OR (p58 <= p113))))))
lola: processed formula length: 63
lola: 29 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: ((p42 + 1 <= p214) AND (((p66 + 1 <= p154) AND (p113 + 1 <= p58))))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 9)
lola: sara is running 0 secs || 1315587 markings, 1315587 edges, 263117 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2237720 markings, 2237719 edges
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p58 + 1 <= p172) OR (p186 + 1 <= p185)) AND (p90 + 1 <= p164))))
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 ((((p58 + 1 <= p172) OR (p186 + 1 <= p185)) AND (p90 + 1 <= p164))))
lola: processed formula length: 74
lola: 28 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: (((p58 + 1 <= p172) OR (p186 + 1 <= p185)) AND (p90 + 1 <= p164))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3)
lola: sara is running 0 secs || 1465949 markings, 1465948 edges, 293190 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2261328 markings, 2261327 edges

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p199 <= 0) OR (p60 <= p72) OR (((1 <= p198) OR (p97 <= p22)) AND (p94 <= 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 (((p199 <= 0) OR (p60 <= p72) OR (((1 <= p198) OR (p97 <= p22)) AND (p94 <= 0)))))
lola: processed formula length: 90
lola: 29 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((1 <= p199) AND (p72 + 1 <= p60) AND (((p198 <= 0) AND (p22 + 1 <= p97)) OR (1 <= p94)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p167 <= p160) OR (p2 <= p42) OR (p110 + 1 <= p62) OR (2 <= p162))))
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 (((p167 <= p160) OR (p2 <= p42) OR (p110 + 1 <= p62) OR (2 <= p162))))
lola: processed formula length: 78
lola: 29 rewrites
lola: closed formula file DoubleExponent-PT-004-ReachabilityCardinality.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: ((p160 + 1 <= p167) AND (p42 + 1 <= p2) AND (p62 <= p110) AND (p162 <= 1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-004-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-004-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA DoubleExponent-PT-004-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no yes yes no no yes yes no yes no
lola:
preliminary result: no no yes no yes yes no yes yes no no yes yes no yes no
lola: memory consumption: 24696 KB
lola: time consumption: 25 seconds

BK_STOP 1527782763374

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