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 19M
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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 38K 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 256K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 668K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 18M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBNT-PT-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673527200374
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527265675681

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBNT-PT-S10J30 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBNT-PT-S10J30 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ PolyORBNT-PT-S10J30 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 12714/65536 symbol table entries, 4655 collisions
lola: preprocessing...
lola: Size of bit vector: 21248
lola: finding significant places
lola: 664 places, 12050 transitions, 572 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S10J30-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= mi1)
lola: LP says that atomic proposition is always false: (3 <= Check_Sources_B_1)
lola: LP says that atomic proposition is always false: (2 <= mo2)
lola: LP says that atomic proposition is always false: (AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_16 + AvailableJobId_19 + AvailableJobId_21 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_4 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_20 + AvailableJobId_18 + AvailableJobId_17 <= Try_Check_Sources_B_1)
lola: LP says that atomic proposition is always false: (2 <= Schedule_Task_B_1)
lola: LP says that atomic proposition is always false: (3 <= NotifyEventEndOfCheckSourcesB_1)
lola: LP says that atomic proposition is always false: (2 <= CanInjectEvent)
lola: LP says that atomic proposition is always false: (3 <= Check_Sources_E_1)
lola: LP says that atomic proposition is always true: (1 <= cJobCnt)
lola: LP says that atomic proposition is always false: (2 <= Check_Sources_B_1)
lola: LP says that atomic proposition is always false: (3 <= place_521_1)
lola: LP says that atomic proposition is always false: (2 <= NotifyEventJobQueuedB_1_29)
lola: LP says that atomic proposition is always false: (2 <= CreatedJobs_2_2)
lola: LP says that atomic proposition is always false: (2 <= Schedule_Task_E_1_PerformWork_26)
lola: LP says that atomic proposition is always false: (3 <= CreatedJobs_8_2)
lola: LP says that atomic proposition is always false: (2 <= QueueJobB_1_30)
lola: LP says that atomic proposition is always false: (2 <= AvailableJobId_8)
lola: E (G ((Perform_Work_E_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30))) : (E ((TRUE U ())) OR NOT((A (X ((Check_Sources_E_1 <= mi1))) OR ((Schedule_Task_B_1 + 1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30) AND (place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30))))) : NOT(A ((((JobCnt <= NotifyEventJobQueuedE_1)) U ((1 <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_0_7 + CreatedJobs_0_8 + CreatedJobs_0_9 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_6 + CreatedJobs_17_7 + CreatedJobs_17_8 + CreatedJobs_17_9 + CreatedJobs_3_10 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_1_7 + CreatedJobs_1_8 + CreatedJobs_1_9 + CreatedJobs_13_10 + CreatedJobs_25_10 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_18_6 + CreatedJobs_18_7 + CreatedJobs_18_8 + CreatedJobs_18_9 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_2_7 + CreatedJobs_2_8 + CreatedJobs_2_9 + CreatedJobs_8_10 + CreatedJobs_18_10 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_19_6 + CreatedJobs_19_7 + CreatedJobs_19_8 + CreatedJobs_19_9 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_3_7 + CreatedJobs_3_8 + CreatedJobs_3_9 + CreatedJobs_2_10 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_4_7 + CreatedJobs_4_8 + CreatedJobs_4_9 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_30_6 + CreatedJobs_30_7 + CreatedJobs_30_8 + CreatedJobs_30_9 + CreatedJobs_12_10 + CreatedJobs_24_10 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_5_7 + CreatedJobs_5_8 + CreatedJobs_5_9 + CreatedJobs_7_10 + CreatedJobs_17_10 + CreatedJobs_29_10 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6 + CreatedJobs_6_7 + CreatedJobs_6_8 + CreatedJobs_6_9 + CreatedJobs_30_10 + CreatedJobs_1_10 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_6 + CreatedJobs_7_7 + CreatedJobs_7_8 + CreatedJobs_7_9 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_20_6 + CreatedJobs_20_7 + CreatedJobs_20_8 + CreatedJobs_20_9 + CreatedJobs_11_10 + CreatedJobs_23_10 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_8_6 + CreatedJobs_8_7 + CreatedJobs_8_8 + CreatedJobs_8_9 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_21_6 + CreatedJobs_21_7 + CreatedJobs_21_8 + CreatedJobs_21_9 + CreatedJobs_6_10 + CreatedJobs_28_10 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_9_6 + CreatedJobs_9_7 + CreatedJobs_9_8 + CreatedJobs_9_9 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_22_5 + CreatedJobs_22_6 + CreatedJobs_22_7 + CreatedJobs_22_8 + CreatedJobs_22_9 + CreatedJobs_0_10 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_23_5 + CreatedJobs_23_6 + CreatedJobs_23_7 + CreatedJobs_23_8 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_10_5 + CreatedJobs_10_6 + CreatedJobs_10_7 + CreatedJobs_10_8 + CreatedJobs_10_9 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_24_5 + CreatedJobs_24_6 + CreatedJobs_24_7 + CreatedJobs_24_8 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_11_5 + CreatedJobs_11_6 + CreatedJobs_11_7 + CreatedJobs_11_8 + CreatedJobs_5_10 + CreatedJobs_28_8 + CreatedJobs_28_7 + CreatedJobs_28_6 + CreatedJobs_28_5 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_15_10 + CreatedJobs_27_10 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_25_5 + CreatedJobs_25_6 + CreatedJobs_25_7 + CreatedJobs_25_8 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_12_5 + CreatedJobs_12_6 + CreatedJobs_12_7 + CreatedJobs_12_8 + CreatedJobs_28_1 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_26_5 + CreatedJobs_26_6 + CreatedJobs_26_7 + CreatedJobs_26_8 + CreatedJobs_26_9 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_6 + CreatedJobs_13_7 + CreatedJobs_13_8 + CreatedJobs_14_8 + CreatedJobs_14_7 + CreatedJobs_14_6 + CreatedJobs_14_5 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_8 + CreatedJobs_27_7 + CreatedJobs_27_6 + CreatedJobs_27_5 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_1 + CreatedJobs_27_2 + CreatedJobs_27_9 + CreatedJobs_21_10 + CreatedJobs_13_9 + CreatedJobs_14_9 + CreatedJobs_4_10 + CreatedJobs_14_10 + CreatedJobs_26_10 + CreatedJobs_12_9 + CreatedJobs_25_9 + CreatedJobs_28_9 + CreatedJobs_11_9 + CreatedJobs_24_9 + CreatedJobs_22_10 + CreatedJobs_10_10 + CreatedJobs_23_9 + CreatedJobs_16_10 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 + CreatedJobs_15_6 + CreatedJobs_15_7 + CreatedJobs_15_8 + CreatedJobs_15_9 + CreatedJobs_9_10 + CreatedJobs_19_10) AND (mi3 <= place_456))))) : (E ((((place_782_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10) OR (QueueJobE_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30)) U FALSE)) AND (NOT(E (G ((place_460 <= place_782_1)))) OR (2 <= NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9))) : E ((E (F (FALSE)) U A (X ((1 <= mi3))))) : A (X (((Try_Check_Sources_E_1 + 1 <= place_518_1) OR A (F (FALSE))))) : A ((() U ((place_518_1 <= place_523_1) AND (Try_Check_Sources_B_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) AND ((2 <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_0_7 + CreatedJobs_0_8 + CreatedJobs_0_9 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_6 + CreatedJobs_17_7 + CreatedJobs_17_8 + CreatedJobs_17_9 + CreatedJobs_3_10 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_1_7 + CreatedJobs_1_8 + CreatedJobs_1_9 + CreatedJobs_13_10 + CreatedJobs_25_10 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_18_6 + CreatedJobs_18_7 + CreatedJobs_18_8 + CreatedJobs_18_9 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_2_7 + CreatedJobs_2_8 + CreatedJobs_2_9 + CreatedJobs_8_10 + CreatedJobs_18_10 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_19_6 + CreatedJobs_19_7 + CreatedJobs_19_8 + CreatedJobs_19_9 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_3_7 + CreatedJobs_3_8 + CreatedJobs_3_9 + CreatedJobs_2_10 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_4_7 + CreatedJobs_4_8 + CreatedJobs_4_9 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_30_6 + CreatedJobs_30_7 + CreatedJobs_30_8 + CreatedJobs_30_9 + CreatedJobs_12_10 + CreatedJobs_24_10 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_5_7 + CreatedJobs_5_8 + CreatedJobs_5_9 + CreatedJobs_7_10 + CreatedJobs_17_10 + CreatedJobs_29_10 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6 + CreatedJobs_6_7 + CreatedJobs_6_8 + CreatedJobs_6_9 + CreatedJobs_30_10 + CreatedJobs_1_10 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_6 + CreatedJobs_7_7 + CreatedJobs_7_8 + CreatedJobs_7_9 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_20_6 + CreatedJobs_20_7 + CreatedJobs_20_8 + CreatedJobs_20_9 + CreatedJobs_11_10 + CreatedJobs_23_10 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_8_6 + CreatedJobs_8_7 + CreatedJobs_8_8 + CreatedJobs_8_9 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_21_6 + CreatedJobs_21_7 + CreatedJobs_21_8 + CreatedJobs_21_9 + CreatedJobs_6_10 + CreatedJobs_28_10 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_9_6 + CreatedJobs_9_7 + CreatedJobs_9_8 + CreatedJobs_9_9 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_22_5 + CreatedJobs_22_6 + CreatedJobs_22_7 + CreatedJobs_22_8 + CreatedJobs_22_9 + CreatedJobs_0_10 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_23_5 + CreatedJobs_23_6 + CreatedJobs_23_7 + CreatedJobs_23_8 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_10_5 + CreatedJobs_10_6 + CreatedJobs_10_7 + CreatedJobs_10_8 + CreatedJobs_10_9 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_24_5 + CreatedJobs_24_6 + CreatedJobs_24_7 + CreatedJobs_24_8 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_11_5 + CreatedJobs_11_6 + CreatedJobs_11_7 + CreatedJobs_11_8 + CreatedJobs_5_10 + CreatedJobs_28_8 + CreatedJobs_28_7 + CreatedJobs_28_6 + CreatedJobs_28_5 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_15_10 + CreatedJobs_27_10 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_25_5 + CreatedJobs_25_6 + CreatedJobs_25_7 + CreatedJobs_25_8 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_12_5 + CreatedJobs_12_6 + CreatedJobs_12_7 + CreatedJobs_12_8 + CreatedJobs_28_1 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_26_5 + CreatedJobs_26_6 + CreatedJobs_26_7 + CreatedJobs_26_8 + CreatedJobs_26_9 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_6 + CreatedJobs_13_7 + CreatedJobs_13_8 + CreatedJobs_14_8 + CreatedJobs_14_7 + CreatedJobs_14_6 + CreatedJobs_14_5 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_8 + CreatedJobs_27_7 + CreatedJobs_27_6 + CreatedJobs_27_5 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_1 + CreatedJobs_27_2 + CreatedJobs_27_9 + CreatedJobs_21_10 + CreatedJobs_13_9 + CreatedJobs_14_9 + CreatedJobs_4_10 + CreatedJobs_14_10 + CreatedJobs_26_10 + CreatedJobs_12_9 + CreatedJobs_25_9 + CreatedJobs_28_9 + CreatedJobs_11_9 + CreatedJobs_24_9 + CreatedJobs_22_10 + CreatedJobs_10_10 + CreatedJobs_23_9 + CreatedJobs_16_10 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 + CreatedJobs_15_6 + CreatedJobs_15_7 + CreatedJobs_15_8 + CreatedJobs_15_9 + CreatedJobs_9_10 + CreatedJobs_19_10))))) : (E (F (E (X (FALSE)))) OR (cSources <= place_462)) : A (G ((((Schedule_Task_E_1_PerformWork_10 <= AvailableJobId_13) AND (CreatedJobs_14_5 <= CreatedJobs_13_10)) OR (1 <= FetchJobE_1_3)))) : E ((A (F (FALSE)) U E (F (FALSE)))) : E (G (E (((CreatedJobs_24_6 <= Schedule_Task_E_1_PerformWork_25) U (place_782_1 <= Schedule_Task_E_1_PerformWork_16))))) : E ((((CreatedJobs_15_4 + 1 <= CreatedJobs_30_7) AND (CreatedJobs_1_3 <= 0)) U A (F (FALSE)))) : E ((((CreatedJobs_9_9 + 1 <= f3_12) OR (CreatedJobs_2_10 <= Perform_Work_B_1_8)) U E (G ((f2_12 <= FetchJobE_1_15))))) : E (F (NOT(A (X ((CreatedJobs_20_5 <= FetchJobE_1_12)))))) : A (F (A (F (((1 <= place_462)))))) : A (G (((CreatedJobs_23_4 <= f2_14) OR ((CreatedJobs_5_8 + 1 <= CreatedJobs_16_4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
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:183
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:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 206 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: 55 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cSources <= place_462)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cSources <= place_462)
lola: processed formula length: 23
lola: 55 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 236 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: 55 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 55 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((mi1 + 1 <= Check_Sources_E_1))) AND ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work... (shortened)
lola: processed formula length: 1381
lola: 55 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-CTLCardinality.task
lola: processed formula with 2 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 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((mi1 + 1 <= Check_Sources_E_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((mi1 + 1 <= Check_Sources_E_1))
lola: processed formula length: 34
lola: 56 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= mi3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((1 <= mi3))
lola: processed formula length: 14
lola: 56 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Try_Check_Sources_E_1 + 1 <= place_518_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((Try_Check_Sources_E_1 + 1 <= place_518_1))
lola: processed formula length: 46
lola: 56 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((FetchJobE_1_12 + 1 <= CreatedJobs_20_5)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (FetchJobE_1_12 + 1 <= CreatedJobs_20_5)
lola: processed formula length: 40
lola: 56 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 41 markings, 40 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((CreatedJobs_23_4 <= f2_14) OR ((CreatedJobs_5_8 + 1 <= CreatedJobs_16_4)))))
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 (((CreatedJobs_23_4 <= f2_14) OR ((CreatedJobs_5_8 + 1 <= CreatedJobs_16_4)))))
lola: processed formula length: 85
lola: 57 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: ((f2_14 + 1 <= CreatedJobs_23_4) AND ((CreatedJobs_16_4 <= CreatedJobs_5_8)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J30-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J30-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Schedule_Task_E_1_PerformWork_10 <= AvailableJobId_13) AND (CreatedJobs_14_5 <= CreatedJobs_13_10)) OR (1 <= FetchJobE_1_3))))
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 ((((Schedule_Task_E_1_PerformWork_10 <= AvailableJobId_13) AND (CreatedJobs_14_5 <= CreatedJobs_13_10)) OR (1 <= FetchJobE_1_3))))
lola: processed formula length: 136
lola: 57 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: (((AvailableJobId_13 + 1 <= Schedule_Task_E_1_PerformWork_10) OR (CreatedJobs_13_10 + 1 <= CreatedJobs_14_5)) AND (FetchJobE_1_3 <= 0))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J30-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J30-CTLCardinality-9-0.sara.
lola: sara is running 0 secs || 8750 markings, 10069 edges, 1750 markings/sec, 0 secs
lola: sara is running 5 secs || 19395 markings, 23892 edges, 2129 markings/sec, 5 secs
lola: sara is running 10 secs || 30795 markings, 37958 edges, 2280 markings/sec, 10 secs
lola: sara is running 15 secs || 42004 markings, 52147 edges, 2242 markings/sec, 15 secs
lola: sara is running 20 secs || 51376 markings, 66375 edges, 1874 markings/sec, 20 secs
lola: sara is running 25 secs || 58468 markings, 77889 edges, 1418 markings/sec, 25 secs
lola: sara is running 30 secs || 65439 markings, 90229 edges, 1394 markings/sec, 30 secs
lola: sara is running 35 secs || 74664 markings, 102180 edges, 1845 markings/sec, 35 secs
lola: sara is running 40 secs || 85209 markings, 115919 edges, 2109 markings/sec, 40 secs
lola: sara is running 45 secs || 96841 markings, 130196 edges, 2326 markings/sec, 45 secs
lola: sara is running 50 secs || 108036 markings, 144405 edges, 2239 markings/sec, 50 secs
lola: sara is running 55 secs || 117515 markings, 158743 edges, 1896 markings/sec, 55 secs
lola: sara is running 60 secs || 124642 markings, 170308 edges, 1425 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 131650 markings, 182682 edges, 1402 markings/sec, 65 secs
lola: sara is running 70 secs || 140888 markings, 194678 edges, 1848 markings/sec, 70 secs
lola: sara is running 75 secs || 151562 markings, 208593 edges, 2135 markings/sec, 75 secs
lola: sara is running 80 secs || 163212 markings, 222895 edges, 2330 markings/sec, 80 secs
lola: sara is running 85 secs || 174586 markings, 237299 edges, 2275 markings/sec, 85 secs
lola: sara is running 90 secs || 184083 markings, 251730 edges, 1899 markings/sec, 90 secs
lola: sara is running 95 secs || 191091 markings, 263200 edges, 1402 markings/sec, 95 secs
lola: sara is running 100 secs || 198125 markings, 275680 edges, 1407 markings/sec, 100 secs
lola: sara is running 105 secs || 207469 markings, 287705 edges, 1869 markings/sec, 105 secs
lola: sara is running 110 secs || 218601 markings, 302164 edges, 2226 markings/sec, 110 secs
lola: sara is running 115 secs || 229964 markings, 316223 edges, 2273 markings/sec, 115 secs
lola: sara is running 120 secs || 241278 markings, 330984 edges, 2263 markings/sec, 120 secs
lola: sara is running 125 secs || 249335 markings, 344119 edges, 1611 markings/sec, 125 secs
lola: sara is running 130 secs || 256367 markings, 355868 edges, 1406 markings/sec, 130 secs
lola: sara is running 135 secs || 264442 markings, 368709 edges, 1615 markings/sec, 135 secs
lola: sara is running 140 secs || 273914 markings, 381007 edges, 1894 markings/sec, 140 secs
lola: sara is running 145 secs || 285262 markings, 394905 edges, 2270 markings/sec, 145 secs
lola: sara is running 150 secs || 296102 markings, 408498 edges, 2168 markings/sec, 150 secs
lola: sara is running 155 secs || 306353 markings, 423146 edges, 2050 markings/sec, 155 secs
lola: sara is running 160 secs || 313222 markings, 434338 edges, 1374 markings/sec, 160 secs
lola: sara is running 165 secs || 319942 markings, 445806 edges, 1344 markings/sec, 165 secs
lola: sara is running 170 secs || 328244 markings, 457790 edges, 1660 markings/sec, 170 secs
lola: sara is running 175 secs || 338160 markings, 470715 edges, 1983 markings/sec, 175 secs
lola: sara is running 180 secs || 349242 markings, 484325 edges, 2216 markings/sec, 180 secs
lola: sara is running 185 secs || 360083 markings, 498051 edges, 2168 markings/sec, 185 secs
lola: sara is running 190 secs || 369557 markings, 512219 edges, 1895 markings/sec, 190 secs
lola: sara is running 195 secs || 376285 markings, 523200 edges, 1346 markings/sec, 195 secs
lola: sara is running 200 secs || 383008 markings, 535048 edges, 1345 markings/sec, 200 secs
lola: sara is running 205 secs || 391841 markings, 546758 edges, 1767 markings/sec, 205 secs
lola: sara is running 210 secs || 402417 markings, 560552 edges, 2115 markings/sec, 210 secs
lola: sara is running 215 secs || 413223 markings, 573996 edges, 2161 markings/sec, 215 secs
lola: sara is running 220 secs || 424032 markings, 588245 edges, 2162 markings/sec, 220 secs
lola: sara is running 225 secs || 431450 markings, 600553 edges, 1484 markings/sec, 225 secs
lola: sara is running 230 secs || 438199 markings, 611942 edges, 1350 markings/sec, 230 secs
lola: sara is running 235 secs || 446139 markings, 624062 edges, 1588 markings/sec, 235 secs
lola: sara is running 240 secs || 456171 markings, 637134 edges, 2006 markings/sec, 240 secs
lola: sara is running 245 secs || 467066 markings, 650553 edges, 2179 markings/sec, 245 secs
lola: sara is running 250 secs || 478237 markings, 664840 edges, 2234 markings/sec, 250 secs
lola: sara is running 255 secs || 487177 markings, 678828 edges, 1788 markings/sec, 255 secs
lola: sara is running 260 secs || 494167 markings, 690499 edges, 1398 markings/sec, 260 secs
lola: sara is running 265 secs || 502073 markings, 703358 edges, 1581 markings/sec, 265 secs
lola: sara is running 270 secs || 512300 markings, 716618 edges, 2045 markings/sec, 270 secs
lola: sara is running 275 secs || 523675 markings, 730600 edges, 2275 markings/sec, 275 secs
lola: sara is running 280 secs || 534946 markings, 744951 edges, 2254 markings/sec, 280 secs
lola: sara is running 285 secs || 544101 markings, 759147 edges, 1831 markings/sec, 285 secs
lola: sara is running 290 secs || 551149 markings, 770798 edges, 1410 markings/sec, 290 secs
lola: sara is running 295 secs || 559347 markings, 784270 edges, 1640 markings/sec, 295 secs
lola: sara is running 300 secs || 570911 markings, 799198 edges, 2313 markings/sec, 300 secs
lola: sara is running 305 secs || 585036 markings, 816797 edges, 2825 markings/sec, 305 secs
lola: sara is running 310 secs || 597258 markings, 834635 edges, 2444 markings/sec, 310 secs
lola: sara is running 315 secs || 605329 markings, 848067 edges, 1614 markings/sec, 315 secs
lola: sara is running 320 secs || 615046 markings, 862764 edges, 1943 markings/sec, 320 secs
lola: sara is running 325 secs || 628051 markings, 879568 edges, 2601 markings/sec, 325 secs
lola: sara is running 330 secs || 642473 markings, 897822 edges, 2884 markings/sec, 330 secs
lola: sara is running 335 secs || 652830 markings, 914058 edges, 2071 markings/sec, 335 secs
lola: sara is running 340 secs || 660903 markings, 927956 edges, 1615 markings/sec, 340 secs

lola: sara is running 345 secs || 671535 markings, 942464 edges, 2126 markings/sec, 345 secs
lola: sara is running 350 secs || 685544 markings, 960441 edges, 2802 markings/sec, 350 secs
lola: sara is running 355 secs || 699917 markings, 979322 edges, 2875 markings/sec, 355 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= place_462))))
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: ((place_462 <= 0))
lola: processed formula length: 18
lola: 57 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((Perform_Work_E_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_W... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Perform_Work_E_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_W... (shortened)
lola: processed formula length: 699
lola: 55 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((place_518_1 <= place_523_1) AND (Try_Check_Sources_B_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) AND ((2 <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJob... (shortened)
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: ((place_523_1 + 1 <= place_518_1) OR (f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + 1 <= Try_Check_Sources_B_1) OR ((CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_2... (shortened)
lola: processed formula length: 6137
lola: 57 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 982 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((CreatedJobs_24_6 <= Schedule_Task_E_1_PerformWork_25) U (place_782_1 <= Schedule_Task_E_1_PerformWork_16)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((CreatedJobs_24_6 <= Schedule_Task_E_1_PerformWork_25) U (place_782_1 <= Schedule_Task_E_1_PerformWork_16)))))
lola: processed formula length: 129
lola: 57 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 26 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((CreatedJobs_9_9 + 1 <= f3_12) OR (CreatedJobs_2_10 <= Perform_Work_B_1_8)) U E (G ((f2_12 <= FetchJobE_1_15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(((CreatedJobs_9_9 + 1 <= f3_12) OR (CreatedJobs_2_10 <= Perform_Work_B_1_8)) U NOT(A(TRUE U (FetchJobE_1_15 + 1 <= f2_12))))
lola: processed formula length: 127
lola: 58 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((NotifyEventJobQueuedE_1 + 1 <= JobCnt)) R ((CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E ((((NotifyEventJobQueuedE_1 + 1 <= JobCnt)) R ((CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJ... (shortened)
lola: processed formula length: 5904
lola: 57 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no no no no yes no yes yes no no
lola:
preliminary result: yes no yes no no no no no no no yes no yes yes no no
lola: memory consumption: 75988 KB
lola: time consumption: 623 seconds

BK_STOP 1527266299923

--------------------
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="PolyORBNT-PT-S10J30"
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/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 PolyORBNT-PT-S10J30, 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-152673527200374"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;