About the Execution of LoLA for CSRepetitions-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
154.120 | 790.00 | 1640.00 | 37.00 | FFFTFFTTTTFTFFFT | 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 400K
-rw-r--r-- 1 mcc users 10K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 71K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500446
=====================================================================
--------------------
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 CSRepetitions-PT-03-ReachabilityCardinality-00
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-01
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-02
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-03
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-04
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-05
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-06
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-07
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-08
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-09
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-10
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-11
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-12
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-13
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-14
FORMULA_NAME CSRepetitions-PT-03-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526605276579
info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-03 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ CSRepetitions-PT-03 @ 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: 139/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 127 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-03-ReachabilityCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_2_3)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_6_3)
lola: LP says that atomic proposition is always false: (3 <= Client_Sending_1)
lola: LP says that atomic proposition is always false: (3 <= Client_Waiting_8)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_5_1)
lola: LP says that atomic proposition is always false: (3 <= Client_Waiting_4)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_8_2)
lola: LP says that atomic proposition is always false: (2 <= Client_Sending_4)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_2_2)
lola: LP says that atomic proposition is always false: (3 <= Client_Sending_4)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_4_2)
lola: A (G ((((3 <= Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) OR (1 <= RequestBufferSlots)))) : A (G (((Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3) OR ((2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9) AND (Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 <= 2))))) : A (G (((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9) OR (2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9) OR (Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= 2) OR (3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9)))) : A (G (())) : A (G (((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9) OR (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3)))) : A (G (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 1) OR (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9)))) : A (G (())) : E (F (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9) AND (Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 + 1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3) AND (2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)))) : A (G (())) : E (F ((((Server_Anwering_6_1 + 1 <= Server_Anwering_3_3) AND (Client_Waiting_9 + 1 <= RequestBuffer_3))))) : E (F (())) : A (G (())) : A (G (((Server_Anwering_2_1 <= 0) OR (Server_Anwering_8_2 <= Server_Waiting_1)))) : E (F (())) : E (F (((Server_Anwering_5_3 + 1 <= Server_Anwering_6_3) AND (RequestBufferSlots + 1 <= Server_Anwering_7_3) AND ((Server_Anwering_4_2 + 1 <= Server_Waiting_1) OR ((1 <= Client_Sending_4) AND (Server_Waiting_1 <= Client_Sending_2)))))) : A (G (()))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-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
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-3 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: 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 CSRepetitions-PT-03-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-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 CSRepetitions-PT-03-ReachabilityCardinality-8 TRUE 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: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-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 CSRepetitions-PT-03-ReachabilityCardinality-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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-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 CSRepetitions-PT-03-ReachabilityCardinality-11 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-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 CSRepetitions-PT-03-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CSRepetitions-PT-03-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 CSRepetitions-PT-03-ReachabilityCardinality-15 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 (((Server_Anwering_2_1 <= 0) OR (Server_Anwering_8_2 <= Server_Waiting_1))))
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 (((Server_Anwering_2_1 <= 0) OR (Server_Anwering_8_2 <= Server_Waiting_1))))
lola: processed formula length: 82
lola: 23 rewrites
lola: closed formula file CSRepetitions-PT-03-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: ((1 <= Server_Anwering_2_1) AND (Server_Waiting_1 + 1 <= Server_Anwering_8_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-03-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 38 edges
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Server_Anwering_6_1 + 1 <= Server_Anwering_3_3) AND (Client_Waiting_9 + 1 <= RequestBuffer_3)))))
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 ((((Server_Anwering_6_1 + 1 <= Server_Anwering_3_3) AND (Client_Waiting_9 + 1 <= RequestBuffer_3)))))
lola: processed formula length: 106
lola: 22 rewrites
lola: closed formula file CSRepetitions-PT-03-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: (((Server_Anwering_6_1 + 1 <= Server_Anwering_3_3) AND (Client_Waiting_9 + 1 <= RequestBuffer_3)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 16 edges
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) OR (1 <= RequestBufferSlots))))
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 <= Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) OR (1 <= RequestBufferSlots))))
lola: processed formula length: 103
lola: 23 rewrites
lola: closed formula file CSRepetitions-PT-03-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)
sara: try reading problem file CSRepetitions-PT-03-ReachabilityCardinality-7-0.sara.
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 2)) AND (RequestBufferSlots <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to CSRepetitions-PT-03-ReachabilityCardinality-9-0.sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Server_Anwering_5_3 + 1 <= Server_Anwering_6_3) AND (RequestBufferSlots + 1 <= Server_Anwering_7_3) AND ((Server_Anwering_4_2 + 1 <= Server_Waiting_1) OR ((1 <= Client_Sending_4) AND (Server_Waiting_1 <= Client_Sending_2))))))
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 (((Server_Anwering_5_3 + 1 <= Server_Anwering_6_3) AND (RequestBufferSlots + 1 <= Server_Anwering_7_3) AND ((Server_Anwering_4_2 + 1 <= Server_Waiting_1) OR ((1 <= Client_Sending_4) AND (Server_Waiting_1 <= Client_Sending_2))))))
lola: processed formula length: 235
lola: 22 rewrites
lola: closed formula file CSRepetitions-PT-03-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: ((Server_Anwering_5_3 + 1 <= Server_Anwering_6_3) AND (RequestBufferSlots + 1 <= Server_Anwering_7_3) AND ((Server_Anwering_4_2 + 1 <= Server_Waiting_1) OR ((1 <= Client_Sending_4) AND (Server_Waiting_1 <= Client_Sending_2))))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-03-ReachabilityCardinality-9-0.sara.
lola: state equation: write sara problem file to CSRepetitions-PT-03-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-03-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-14 FALSE 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 (G (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 1) OR (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + C... (shortened)
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 (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 1) OR (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + C... (shortened)
lola: processed formula length: 514
lola: 23 rewrites
lola: closed formula file CSRepetitions-PT-03-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: formula 0: ((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9) AND (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-5 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: A (G (((Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Serv... (shortened)
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 (((Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Serv... (shortened)
lola: processed formula length: 1446
lola: 23 rewrites
lola: closed formula file CSRepetitions-PT-03-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: ((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + 1 <= Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) AND ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 <= 1) OR (3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-03-ReachabilityCardinality-12-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_... (shortened)
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 (((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_... (shortened)
lola: processed formula length: 1536
lola: 23 rewrites
lola: closed formula file CSRepetitions-PT-03-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: formula 0: ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + 1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3) AND (Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-03-ReachabilityCardinality-13-0.sara
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9) AND (Server_Waiting_3 + Server_Waiting_2 + Server_Waiti... (shortened)
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 (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9) AND (Server_Waiting_3 + Server_Waiting_2 + Server_Waiti... (shortened)
lola: processed formula length: 1178
lola: 22 rewrites
lola: closed formula file CSRepetitions-PT-03-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: state equation: calling and running sara
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file CSRepetitions-PT-03-ReachabilityCardinality-13-0.sara.
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_... (shortened)
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 (((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_... (shortened)
lola: processed formula length: 1306
lola: 23 rewrites
lola: closed formula file CSRepetitions-PT-03-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: formula 0: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + 1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3) AND (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 <= 1) AND (3 <= Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1) AND (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 <= 2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
FORMULA CSRepetitions-PT-03-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes yes yes yes no yes no no no yes
lola:
preliminary result: no no no yes no no yes yes yes yes no yes no no no yes
sara: place or transition ordering is non-deterministic
lola: memory consumption: 24244 KB
lola: time consumption: 1 seconds
BK_STOP 1526605277369
--------------------
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="CSRepetitions-PT-03"
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/CSRepetitions-PT-03.tgz
mv CSRepetitions-PT-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 CSRepetitions-PT-03, 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 r028-ebro-152646306500446"
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 '
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 ;