About the Execution of LoLA for DiscoveryGPU-PT-11b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2240.410 | 434076.00 | 442711.00 | 72.10 | FTFTFFFFTFFFFFFF | 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 256K
-rw-r--r-- 1 mcc users 4.0K May 30 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 30 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 28 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.4K May 28 06:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 27 03:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 27 03:38 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 82K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-11b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169500102
=====================================================================
--------------------
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 DiscoveryGPU-PT-11b-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527778715545
info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-11b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DiscoveryGPU-PT-11b formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DiscoveryGPU-PT-11b @ 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: 668/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 324
lola: finding significant places
lola: 324 places, 344 transitions, 311 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 403 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-11b-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p283)
lola: LP says that atomic proposition is always false: (2 <= p308)
lola: LP says that atomic proposition is always false: (2 <= p196)
lola: LP says that atomic proposition is always false: (2 <= p134)
lola: LP says that atomic proposition is always false: (2 <= p1)
lola: LP says that atomic proposition is always false: (3 <= p44)
lola: LP says that atomic proposition is always false: (3 <= p122)
lola: LP says that atomic proposition is always false: (3 <= p55)
lola: LP says that atomic proposition is always false: (3 <= p155)
lola: LP says that atomic proposition is always false: (3 <= p283)
lola: LP says that atomic proposition is always false: (3 <= p61)
lola: LP says that atomic proposition is always false: (2 <= p244)
lola: LP says that atomic proposition is always false: (2 <= p89)
lola: LP says that atomic proposition is always false: (3 <= p142)
lola: LP says that atomic proposition is always false: (3 <= p44)
lola: LP says that atomic proposition is always false: (3 <= p205)
lola: LP says that atomic proposition is always false: (3 <= p195)
lola: LP says that atomic proposition is always false: (2 <= p184)
lola: LP says that atomic proposition is always false: (3 <= p152)
lola: LP says that atomic proposition is always false: (3 <= p55)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p192)
lola: LP says that atomic proposition is always false: (3 <= p164)
lola: LP says that atomic proposition is always false: (2 <= p314)
lola: LP says that atomic proposition is always false: (3 <= p14)
lola: LP says that atomic proposition is always false: (2 <= p109)
lola: LP says that atomic proposition is always false: (3 <= p298)
lola: (A (F (((p30 + 1 <= p153) OR (p170 + 1 <= p62)))) OR FALSE) : E (((p19 <= p304) U A (G ((p295 <= p249))))) : E (F ((A (F (FALSE)) AND ((p267 + 1 <= p191) OR (p40 + 1 <= p53))))) : E (G ((p121 <= p312))) : A (G ((((p101 <= p61))))) : A ((() U A (F (FALSE)))) : (E (F (())) AND ((E (X ((p220 <= p253))) OR FALSE) OR (A (G (FALSE)) AND (p83 <= p297)))) : NOT((E (G (((p158 <= p268) OR (p55 <= p309)))) OR A (((p108 <= p176) U (1 <= p3))))) : ((() AND E (G (()))) OR E (F (((1 <= p205))))) : A (G (((p252 <= p92) OR (p24 <= p110)))) : (((E (G (FALSE)) OR FALSE) OR E (F (FALSE))) AND A ((FALSE U (p139 <= 0)))) : (A (((p287 <= p262) U ((1 <= p127)))) OR A (F ((1 <= p20)))) : (NOT(((p212 <= p312) AND E (X (FALSE)))) AND E (G (A (G ((p321 <= p39)))))) : A (G (E (X (((p50 <= p288) OR (p9 <= p219)))))) : ((((p27 <= p180)) AND A (X (()))) OR (NOT(E (G ((p145 <= p125)))) OR A (G (((1 <= p245) AND (1 <= p154)))))) : A (G (E (X (((1 <= p171) OR (p314 <= p71))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:118
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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: 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: 62 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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 DiscoveryGPU-PT-11b-CTLCardinality-2 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: 62 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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 DiscoveryGPU-PT-11b-CTLCardinality-5 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: 62 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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 DiscoveryGPU-PT-11b-CTLCardinality-6 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 62 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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 DiscoveryGPU-PT-11b-CTLCardinality-10 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 (G (E (X (((p50 <= p288) OR (p9 <= p219))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(((p50 <= p288) OR (p9 <= p219))))))
lola: processed formula length: 56
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: 1924 markings, 2925 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-13 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 (G (E (X (((1 <= p171) OR (p314 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(((1 <= p171) OR (p314 <= p71))))))
lola: processed formula length: 55
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: 1905 markings, 2904 edges
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p205))))
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 (((1 <= p205))))
lola: processed formula length: 21
lola: 63 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p205))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-8 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: A (G ((((p101 <= p61)))))
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 ((((p101 <= p61)))))
lola: processed formula length: 25
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: (((p61 + 1 <= p101)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11b-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50 markings, 49 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-4 FALSE 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: A (G ((p321 <= p39)))
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 ((p321 <= p39)))
lola: processed formula length: 21
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: (p39 + 1 <= p321)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-12 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: A (G (((p252 <= p92) OR (p24 <= p110))))
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 (((p252 <= p92) OR (p24 <= p110))))
lola: processed formula length: 41
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: ((p92 + 1 <= p252) AND (p110 + 1 <= p24))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11b-CTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-9 FALSE 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 (G ((p121 <= p312)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p121 <= p312)))
lola: processed formula length: 22
lola: 62 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: 40 markings, 40 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p30 + 1 <= p153) OR (p170 + 1 <= p62))))
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: ((p153 <= p30) AND (p62 <= p170))
lola: processed formula length: 33
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 40 markings, 40 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p19 <= p304) U A (G ((p295 <= p249)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((p19 <= p304) U NOT(E(TRUE U (p249 + 1 <= p295))))
lola: processed formula length: 52
lola: 65 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: 399162 markings, 1596211 edges, 79832 markings/sec, 0 secs
lola: 795430 markings, 3337263 edges, 79254 markings/sec, 5 secs
lola: 1197463 markings, 5147171 edges, 80407 markings/sec, 10 secs
lola: 1576973 markings, 6896016 edges, 75902 markings/sec, 15 secs
lola: 1949430 markings, 8626439 edges, 74491 markings/sec, 20 secs
lola: 2359470 markings, 10441696 edges, 82008 markings/sec, 25 secs
lola: 2704110 markings, 12232759 edges, 68928 markings/sec, 30 secs
lola: 3098074 markings, 14036307 edges, 78793 markings/sec, 35 secs
lola: 3448183 markings, 15847036 edges, 70022 markings/sec, 40 secs
lola: 3784337 markings, 17542230 edges, 67231 markings/sec, 45 secs
lola: 4132213 markings, 19251673 edges, 69575 markings/sec, 50 secs
lola: 4490962 markings, 21031131 edges, 71750 markings/sec, 55 secs
lola: 4802571 markings, 22798249 edges, 62322 markings/sec, 60 secs
lola: 5138812 markings, 24525823 edges, 67248 markings/sec, 65 secs
lola: 5465712 markings, 26191337 edges, 65380 markings/sec, 70 secs
lola: 5780783 markings, 27865028 edges, 63014 markings/sec, 75 secs
lola: 6059368 markings, 29475174 edges, 55717 markings/sec, 80 secs
lola: 6406661 markings, 31166246 edges, 69459 markings/sec, 85 secs
lola: 6744575 markings, 32806422 edges, 67583 markings/sec, 90 secs
lola: 7086556 markings, 34614429 edges, 68396 markings/sec, 95 secs
lola: 7404872 markings, 36384842 edges, 63663 markings/sec, 100 secs
lola: 7707447 markings, 38065430 edges, 60515 markings/sec, 105 secs
lola: 7980483 markings, 39697711 edges, 54607 markings/sec, 110 secs
lola: 8281205 markings, 41380868 edges, 60144 markings/sec, 115 secs
lola: 8569072 markings, 43072349 edges, 57573 markings/sec, 120 secs
lola: 8875340 markings, 44693147 edges, 61254 markings/sec, 125 secs
lola: 9275246 markings, 46472025 edges, 79981 markings/sec, 130 secs
lola: 9625183 markings, 48253940 edges, 69987 markings/sec, 135 secs
lola: 9994903 markings, 49972686 edges, 73944 markings/sec, 140 secs
lola: 10382626 markings, 51691643 edges, 77545 markings/sec, 145 secs
lola: 10680121 markings, 53404495 edges, 59499 markings/sec, 150 secs
lola: 11019644 markings, 55100436 edges, 67905 markings/sec, 155 secs
lola: 11355623 markings, 56722996 edges, 67196 markings/sec, 160 secs
lola: 11651947 markings, 58254634 edges, 59265 markings/sec, 165 secs
lola: 11966039 markings, 59916501 edges, 62818 markings/sec, 170 secs
lola: 12280881 markings, 61569783 edges, 62968 markings/sec, 175 secs
lola: 12557359 markings, 63071649 edges, 55296 markings/sec, 180 secs
lola: 12876838 markings, 64780056 edges, 63896 markings/sec, 185 secs
lola: 13212881 markings, 66594932 edges, 67209 markings/sec, 190 secs
lola: 13526998 markings, 68365689 edges, 62823 markings/sec, 195 secs
lola: 13827740 markings, 70053521 edges, 60148 markings/sec, 200 secs
lola: 14096796 markings, 71683784 edges, 53811 markings/sec, 205 secs
lola: 14395213 markings, 73377186 edges, 59683 markings/sec, 210 secs
lola: 14683092 markings, 75075541 edges, 57576 markings/sec, 215 secs
lola: 14967506 markings, 76708910 edges, 56883 markings/sec, 220 secs
lola: 15247946 markings, 78387668 edges, 56088 markings/sec, 225 secs
lola: 15530873 markings, 80140068 edges, 56585 markings/sec, 230 secs
lola: 15787323 markings, 81747903 edges, 51290 markings/sec, 235 secs
lola: 16052482 markings, 83435115 edges, 53032 markings/sec, 240 secs
lola: 16278532 markings, 84935280 edges, 45210 markings/sec, 245 secs
lola: 16516414 markings, 86459288 edges, 47576 markings/sec, 250 secs
lola: 16740728 markings, 87934036 edges, 44863 markings/sec, 255 secs
lola: 16998822 markings, 89474293 edges, 51619 markings/sec, 260 secs
lola: 17398188 markings, 91242586 edges, 79873 markings/sec, 265 secs
lola: 17748397 markings, 92915469 edges, 70042 markings/sec, 270 secs
lola: 18124370 markings, 94642627 edges, 75195 markings/sec, 275 secs
lola: 18444613 markings, 96230177 edges, 64049 markings/sec, 280 secs
lola: 18757425 markings, 97795436 edges, 62562 markings/sec, 285 secs
lola: 19043384 markings, 99223089 edges, 57192 markings/sec, 290 secs
lola: 19336756 markings, 100762492 edges, 58674 markings/sec, 295 secs
lola: 19622423 markings, 102310206 edges, 57133 markings/sec, 300 secs
lola: 19897500 markings, 103853459 edges, 55015 markings/sec, 305 secs
lola: 20156934 markings, 105299418 edges, 51887 markings/sec, 310 secs
lola: 20388245 markings, 106766274 edges, 46262 markings/sec, 315 secs
lola: 20648908 markings, 108184792 edges, 52133 markings/sec, 320 secs
lola: 20891745 markings, 109610396 edges, 48567 markings/sec, 325 secs
lola: 21156425 markings, 111119118 edges, 52936 markings/sec, 330 secs
lola: 21534514 markings, 112791018 edges, 75618 markings/sec, 335 secs
lola: 21876122 markings, 114376915 edges, 68322 markings/sec, 340 secs
lola: 22218096 markings, 115952110 edges, 68395 markings/sec, 345 secs
lola: 22524109 markings, 117319361 edges, 61203 markings/sec, 350 secs
lola: 22789259 markings, 118642339 edges, 53030 markings/sec, 355 secs
lola: 23085319 markings, 120020976 edges, 59212 markings/sec, 360 secs
lola: 23420286 markings, 121615680 edges, 66993 markings/sec, 365 secs
lola: 23761006 markings, 123146876 edges, 68144 markings/sec, 370 secs
lola: 24053419 markings, 124634562 edges, 58483 markings/sec, 375 secs
lola: 24412414 markings, 126303460 edges, 71799 markings/sec, 380 secs
lola: 24724188 markings, 127780097 edges, 62355 markings/sec, 385 secs
lola: 25021366 markings, 129229981 edges, 59436 markings/sec, 390 secs
lola: 25366398 markings, 130724473 edges, 69006 markings/sec, 395 secs
lola: 25642051 markings, 132186188 edges, 55131 markings/sec, 400 secs
lola: 25926584 markings, 133647461 edges, 56907 markings/sec, 405 secs
lola: 26226124 markings, 135092907 edges, 59908 markings/sec, 410 secs
lola: 26549388 markings, 136568766 edges, 64653 markings/sec, 415 secs
lola: 26849335 markings, 138024701 edges, 59989 markings/sec, 420 secs
lola: 27139661 markings, 139491573 edges, 58065 markings/sec, 425 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27336563 markings, 140470559 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p287 <= p262) U ((1 <= p127)))) OR A (F ((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p20)))
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: (p20 <= 0)
lola: processed formula length: 10
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 40 markings, 40 edges
lola: ========================================
lola: subprocess 14 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p287 <= p262) U ((1 <= p127))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((p287 <= p262) U ((1 <= p127))))
lola: processed formula length: 36
lola: 66 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 40 markings, 40 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p27 <= p180)) AND DEADLOCK) OR (A (F ((p125 + 1 <= p145))) OR A (G (((1 <= p245) AND (1 <= p154))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p245) AND (1 <= p154))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p245) AND (1 <= p154))))
lola: processed formula length: 37
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: SUBRESULT
lola: formula 0: ((p245 <= 0) OR (p154 <= 0))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p27 <= p180)) AND DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: (((p27 <= p180)) AND DEADLOCK)
lola: processed formula length: 30
lola: 63 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p268 + 1 <= p158) AND (p309 + 1 <= p55)))) AND E (((p176 + 1 <= p108) R (p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p176 + 1 <= p108) R (p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((p176 + 1 <= p108) R (p3 <= 0)))
lola: processed formula length: 36
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 17 markings, 17 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((p27 <= p180)) AND DEADLOCK) OR (A (F ((p125 + 1 <= p145))) OR A (G (((1 <= p245) AND (1 <= p154))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p245) AND (1 <= p154))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p245) AND (1 <= p154))))
lola: processed formula length: 37
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-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: ((p245 <= 0) OR (p154 <= 0))
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 DiscoveryGPU-PT-11b-CTLCardinality-16-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p27 <= p180)) AND DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: (((p27 <= p180)) AND DEADLOCK)
lola: processed formula length: 30
lola: 63 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((p125 + 1 <= p145)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p145 <= p125)
lola: processed formula length: 14
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 35 markings, 35 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (((p268 + 1 <= p158) AND (p309 + 1 <= p55)))) AND E (((p176 + 1 <= p108) R (p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((p176 + 1 <= p108) R (p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((p176 + 1 <= p108) R (p3 <= 0)))
lola: processed formula length: 36
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 17 markings, 17 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p268 + 1 <= p158) AND (p309 + 1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: ((p158 <= p268) OR (p55 <= p309))
lola: processed formula length: 34
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-11b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 40 markings, 40 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no yes no no no no no no no
lola:
preliminary result: no yes no yes no no no no yes no no no no no no no
lola: ========================================
lola: memory consumption: 27676 KB
lola: time consumption: 434 seconds
BK_STOP 1527779149621
--------------------
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="DiscoveryGPU-PT-11b"
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/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b 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 DiscoveryGPU-PT-11b, 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 r280-csrt-152749169500102"
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 '
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 ;