About the Execution of LoLA for PolyORBLF-PT-S02J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
201.170 | 312628.00 | 318716.00 | 538.70 | FTFFTTFFTFTTTTFT | 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 1.6M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBLF-PT-S02J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673526900164
=====================================================================
--------------------
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 PolyORBLF-PT-S02J06T08-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526999883493
info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-PT-S02J06T08 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-PT-S02J06T08 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ PolyORBLF-PT-S02J06T08 @ 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: 2124/65536 symbol table entries, 10 collisions
lola: preprocessing...
lola: Size of bit vector: 22080
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J06T08-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8)
lola: LP says that atomic proposition is always false: (3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8)
lola: LP says that atomic proposition is always false: (3 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8)
lola: LP says that atomic proposition is always false: (3 <= MarkerWrite)
lola: LP says that atomic proposition is always false: (3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)
lola: LP says that atomic proposition is always false: (cJobCnt <= P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8)
lola: LP says that atomic proposition is always true: (3 <= cJobCnt)
lola: LP says that atomic proposition is always false: (3 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8)
lola: LP says that atomic proposition is always false: (2 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8)
lola: LP says that atomic proposition is always false: (3 <= Check_Sources_B_5)
lola: LP says that atomic proposition is always false: (3 <= CreatedJobs_6_1)
lola: LP says that atomic proposition is always false: (3 <= ScheduleTaskE_Work_3_5)
lola: LP says that atomic proposition is always false: (2 <= QueueJobB_8_1)
lola: LP says that atomic proposition is always false: (3 <= Abort_Check_Sources_E_5)
lola: LP says that atomic proposition is always false: (3 <= NotifyEventSourceAddedB_4)
lola: LP says that atomic proposition is always false: (3 <= ScheduleTaskE_Work_8_5)
lola: LP says that atomic proposition is always false: (3 <= FetchJobB_6)
lola: LP says that atomic proposition is always false: (3 <= P_1093)
lola: LP says that atomic proposition is always false: (2 <= NotifyEventSourceAddedE_4)
lola: A ((A (F (FALSE)) U ())) : (((((2 <= P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8)) AND (SigAbort + 1 <= ORB_Lock) AND ((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8))) OR E (F ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + 1 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8)))) OR E (X (A (G ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 <= IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))) : E ((A (X ((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2))) U A (F (FALSE)))) : A (G ((P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_7_1 + P_2579_7_2 + P_2579_8_1 + P_2579_8_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 <= ORB_Lock))) : A ((A (X ((2 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8))) U E (F ((1 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8))))) : A (X (E (F (((cPollingAbort <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)))))) : NOT(((cSources <= PlaceSources_1 + PlaceSources_2) OR A ((TRUE U (BlockedTasks <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8))))) : (FALSE OR A (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) U ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6))))) : (((E (G ((FetchJobE_2_6 <= ScheduleTaskE_Work_1_3))) AND E (X ((FetchJobB_2 <= BlockedTasks)))) AND (E (X ((AbourtToModifySrc_2 <= Insert_Source_B_5_1))) OR ())) AND (A ((FALSE U FALSE)) OR ((TryAllocateOneTaskB_3 <= 0) OR (ProcessingEvt_2 <= 2) OR ((P_1155_8 <= 0) AND (DisablePollingB_6_2 + 1 <= NotifyEventJobQueuedB_5_2))))) : (A (G ((((ScheduleTaskE_Work_6_5 <= ScheduleTaskE_Work_4_6) OR (3 <= AwakeTasks_3))))) AND E (F (FALSE))) : E (F (A (F ((NotifyEventSourceAddedE_4 + 1 <= ProcessingEvt_2))))) : (FALSE OR E (G (((QueueJobB_8_0 <= NotifyEventJobQueuedB_2_1) OR (1 <= NotifyEventJobQueuedB_7_2))))) : NOT(A (((FetchJobE_6_1 <= P_1158_7) U ()))) : E (X (E (F ((2 <= P_2318_2))))) : NOT(NOT(A (F ((1 <= Insert_Source_B_1_2))))) : (A (X (E (G ((DisablePollingB_1_1 <= NotifyEventJobQueuedB_4_3))))) AND A ((((NotifyEventJobQueuedB_1_6 <= EnablePollingB_4) OR (1 <= Abort_Check_Sources_B_2)) U (cIsMonitoring <= ScheduleTaskE_Work_3_0))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:117
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 203 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: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: ========================================
check_solution: Constraint R1 = 4.66523797576e-310 is above its upper bound -2
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 8.05881311503 is above its equality of 0
check_solution: Constraint R5 = 2 is above its equality of 0
check_solution: Constraint R6 = 2 is above its equality of 0
check_solution: Constraint R7 = 2 is above its equality of 0
check_solution: Constraint R8 = 2 is above its equality of 0
check_solution: Constraint R9 = 2 is above its equality of 0
check_solution: Constraint R10 = 2 is above its equality of 0
Seriously low accuracy found ||*|| = 3526.82 (rel. error 314.437)
check_solution: Constraint R1 = 4.66523816273e-310 is below its lower bound 1
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 1 is above its equality of 0
check_solution: Constraint R5 = 1 is above its equality of 0
check_solution: Constraint R6 = 1 is above its equality of 0
check_solution: Constraint R7 = 1 is above its equality of 0
check_solution: Constraint R8 = 1 is above its equality of 0
check_solution: Constraint R9 = 1 is above its equality of 0
check_solution: Constraint R10 = 1 is above its equality of 0
Seriously low accuracy found ||*|| = 63.8063 (rel. error 0.866094)
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 217 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: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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 PolyORBLF-PT-S02J06T08-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 232 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: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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 PolyORBLF-PT-S02J06T08-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 250 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: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-CTLCardinality.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 PolyORBLF-PT-S02J06T08-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((FetchJobE_2_6 <= ScheduleTaskE_Work_1_3))) AND (E (X ((FetchJobB_2 <= BlockedTasks))) AND ((TryAllocateOneTaskB_3 <= 0) OR (ProcessingEvt_2 <= 2) OR ((P_1155_8 <= 0) AND (DisablePollingB_6_2 + 1 <= NotifyEventJobQueuedB_5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((TryAllocateOneTaskB_3 <= 0) OR (ProcessingEvt_2 <= 2) OR ((P_1155_8 <= 0) AND (DisablePollingB_6_2 + 1 <= NotifyEventJobQueuedB_5_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((TryAllocateOneTaskB_3 <= 0) OR (ProcessingEvt_2 <= 2) OR ((P_1155_8 <= 0) AND (DisablePollingB_6_2 + 1 <= NotifyEventJobQueuedB_5_2)))
lola: processed formula length: 138
lola: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FetchJobE_2_6 <= ScheduleTaskE_Work_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FetchJobE_2_6 <= ScheduleTaskE_Work_1_3)))
lola: processed formula length: 49
lola: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: 421 markings, 423 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FetchJobB_2 <= BlockedTasks)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((FetchJobB_2 <= BlockedTasks))
lola: processed formula length: 33
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((2 <= P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8)) AND (SigAbort + 1 <= ORB_Lock) AND ((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8))) OR (E (F ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + 1 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8)))
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 ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + 1 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8)))
lola: processed formula length: 292
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: (P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + 1 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((cPollingAbort <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U ((cPollingAbort <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8))))
lola: processed formula length: 224
lola: 51 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 34 markings, 33 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= P_2318_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (2 <= P_2318_2)
lola: processed formula length: 15
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 821 markings, 861 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((DisablePollingB_1_1 <= NotifyEventJobQueuedB_4_3))))) AND A ((((NotifyEventJobQueuedB_1_6 <= EnablePollingB_4) OR (1 <= Abort_Check_Sources_B_2)) U (cIsMonitoring <= ScheduleTaskE_Work_3_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((NotifyEventJobQueuedB_1_6 <= EnablePollingB_4) OR (1 <= Abort_Check_Sources_B_2)) U (cIsMonitoring <= ScheduleTaskE_Work_3_0)))
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 ((((NotifyEventJobQueuedB_1_6 <= EnablePollingB_4) OR (1 <= Abort_Check_Sources_B_2)) U (cIsMonitoring <= ScheduleTaskE_Work_3_0)))
lola: processed formula length: 134
lola: 53 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((DisablePollingB_1_1 <= NotifyEventJobQueuedB_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (NotifyEventJobQueuedB_4_3 + 1 <= DisablePollingB_1_1))))
lola: processed formula length: 73
lola: 52 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1383 markings, 1385 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NotifyEventSourceAddedE_4 + 1 <= ProcessingEvt_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 ((NotifyEventSourceAddedE_4 + 1 <= ProcessingEvt_2)))
lola: processed formula length: 58
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: (NotifyEventSourceAddedE_4 + 1 <= ProcessingEvt_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 357 markings, 356 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)))
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 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)))
lola: processed formula length: 204
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-CTLCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_7_1 + P_2579_7_2 + P_2579_8_1 + P_2579_8_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 <= ORB_Lock)))
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 ((P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_7_1 + P_2579_7_2 + P_2579_8_1 + P_2579_8_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 <= ORB_Lock)))
lola: processed formula length: 227
lola: 51 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: (ORB_Lock + 1 <= P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_7_1 + P_2579_7_2 + P_2579_8_1 + P_2579_8_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32254 markings, 38987 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Insert_Source_B_1_2)))
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: (Insert_Source_B_1_2 <= 0)
lola: processed formula length: 26
lola: 51 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: 417 markings, 417 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((QueueJobB_8_0 <= NotifyEventJobQueuedB_2_1) OR (1 <= NotifyEventJobQueuedB_7_2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((QueueJobB_8_0 <= NotifyEventJobQueuedB_2_1) OR (1 <= NotifyEventJobQueuedB_7_2))))
lola: processed formula length: 91
lola: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: 417 markings, 417 edges
lola:
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((PlaceSources_1 + PlaceSources_2 + 1 <= cSources) AND E (G ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + 1 <= BlockedTasks))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (PlaceSources_1 + PlaceSources_2 + 1 <= cSources)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (PlaceSources_1 + PlaceSources_2 + 1 <= cSources)
lola: processed formula length: 49
lola: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + 1 <= BlockedTasks)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + 1 <= BlockedTasks)))
lola: processed formula length: 115
lola: 49 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 517 markings, 855 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) U ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6))))
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 (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) U ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6))))
lola: processed formula length: 332
lola: 53 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T08-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: 50 markings, 49 edges
lola: ========================================
FORMULA PolyORBLF-PT-S02J06T08-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no no yes no yes yes yes yes no yes
lola:
preliminary result: no yes no no yes yes no no yes no yes yes yes yes no yes
lola: memory consumption: 29192 KB
lola: time consumption: 313 seconds
BK_STOP 1527000196121
--------------------
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="PolyORBLF-PT-S02J06T08"
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/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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 PolyORBLF-PT-S02J06T08, 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 r124-smll-152673526900164"
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 ;