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 2.4M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 115K 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 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K 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 13K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 1.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBNT-PT-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528700346
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526877763492


BK_STOP 1526878123025

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-PT-S05J40 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 747214, 'Memory': 15952.83, 'Tool': 'lola'}, {'Time': 763905, 'Memory': 15935.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-PT-S05J40...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-PT-S05J40: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBNT-PT-S05J40: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-PT-S05J40 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2219/65536 symbol table entries, 162 collisions
lola: preprocessing...
lola: finding significant places
lola: 629 places, 1590 transitions, 527 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S05J40-CTLCardinality.task
lola: A (F ((((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 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 <= 1) AND (cSources <= place_782_1)) AND A (X ((3 <= place_523_1)))))) : E (G (A (G ((FetchJobB_1 <= 0))))) : (E (X (((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9 <= place_462) OR ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5) AND (2 <= place_782_1))))) AND A (F ((3 <= Schedule_Task_B_1)))) : (A (G ((((block <= place_520_1) OR (mi3 <= place_522_1)) AND (place_518_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)))) OR ((E (X ((2 <= cSources))) AND ((place_521_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 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) AND (2 <= FetchJobB_1) AND (mo2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9) AND (Schedule_Task_B_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 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40))) AND ((ModifiedSrc_4 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_5 <= mo1) OR (mi1 + 1 <= CanInjectEvent)))) : NOT(E (G ((2 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)))) : A (F ((A (F ((2 <= place_458))) AND A (F ((1 <= mi2)))))) : (E (F (((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + 1 <= mo2) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_40_1 + CreatedJobs_40_2 + CreatedJobs_40_3 + CreatedJobs_40_4 + CreatedJobs_40_5 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_31_1 + CreatedJobs_31_2 + CreatedJobs_31_3 + CreatedJobs_31_4 + CreatedJobs_31_5 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_32_1 + CreatedJobs_32_2 + CreatedJobs_32_3 + CreatedJobs_32_4 + CreatedJobs_32_5 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_33_1 + CreatedJobs_33_2 + CreatedJobs_33_3 + CreatedJobs_33_4 + CreatedJobs_33_5 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_34_1 + CreatedJobs_34_2 + CreatedJobs_34_3 + CreatedJobs_34_4 + CreatedJobs_34_5 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_35_1 + CreatedJobs_35_2 + CreatedJobs_35_3 + CreatedJobs_35_4 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_36_1 + CreatedJobs_36_2 + CreatedJobs_36_3 + CreatedJobs_36_4 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_37_1 + CreatedJobs_37_2 + CreatedJobs_37_3 + CreatedJobs_37_4 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_28_2 + CreatedJobs_28_1 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_38_1 + CreatedJobs_38_2 + CreatedJobs_38_3 + CreatedJobs_38_4 + CreatedJobs_14_1 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_27_4 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_27_3 + CreatedJobs_39_1 + CreatedJobs_39_2 + CreatedJobs_39_3 + CreatedJobs_39_4 + CreatedJobs_27_2 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_27_1 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_39_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_27_5 + CreatedJobs_38_5 + CreatedJobs_14_5 + CreatedJobs_28_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_37_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_36_5 + CreatedJobs_22_5 + CreatedJobs_35_5 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 + 1 <= place_787_1)))) OR A (G (E (G ((place_521_1 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5)))))) : A (X ((A (G ((NotifyEventEndOfCheckSourcesB_1 <= ModifiedSrc_4 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_5))) AND E (F ((place_500_1 <= Try_Check_Sources_B_1)))))) : A (F (E (F ((2 <= CreatedJobs_11_5))))) : (E (F ((((2 <= Perform_Work_B_1_20) OR (3 <= TheSour_5)) AND ((2 <= f1_1) OR (NotifyEventJobQueuedB_1_34 <= f2_40))))) OR A (((2 <= mi3) U ((3 <= CreatedJobs_33_4) AND (CreatedJobs_1_3 <= CreatedJobs_32_5))))) : (E (G (((f2_7 <= f3_27) OR (1 <= CreatedJobs_30_5) OR (CreatedJobs_22_3 <= 1)))) OR A (G ((AvailableJobId_12 <= AvailableJobId_2)))) : ((((((3 <= CreatedJobs_21_1) OR (2 <= AvailableJobId_4)) AND ((3 <= CreatedJobs_24_5) OR (2 <= CreatedJobs_36_2))) OR (1 <= Perform_Work_B_1_2)) AND E (((1 <= Schedule_Task_E_1_PerformWork_35) U (2 <= CreatedJobs_22_2)))) OR NOT(A (G ((f1_39 <= f1_4))))) : (NOT(A (F (((f2_8 <= Schedule_Task_E_1_PerformWork_1) AND (AvailableJobId_16 <= CreatedJobs_15_3))))) OR E (G (((Perform_Work_B_1_8 + 1 <= CreatedJobs_22_2) OR (Schedule_Task_E_1_PerformWork_4 <= 2))))) : A (F (((2 <= AvailableJobId_24) OR (1 <= CreatedJobs_40_5)))) : (A (G (((3 <= AvailableJobId_32) OR (3 <= Schedule_Task_E_1_PerformWork_32) OR (CreatedJobs_31_2 <= 2)))) AND E (((f2_28 <= Schedule_Task_E_1_PerformWork_22) U (CreatedJobs_38_4 + 1 <= NotifyEventEndOfCheckSourcesB_1)))) : (NOT(A (F ((NotifyEventJobQueuedB_1_16 <= 1)))) OR A (G (((f2_12 <= NotifyEventJobQueuedB_1_13) OR (3 <= f2_34) OR (1 <= Schedule_Task_E_1_PerformWork_34)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((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 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 <= 1) AND (cSources <= place_782_1)) AND A (X ((3 <= place_523_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((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 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 <= 1) AND (cSources <= place_782_1)) AND AX((3 <= place_523_1))))
lola: processed formula length: 393
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((FetchJobB_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (1 <= FetchJobB_1))))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedul... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_T... (shortened)
lola: processed formula length: 1591
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= Schedule_Task_B_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= Schedule_Task_B_1)))
lola: processed formula: A (F ((3 <= Schedule_Task_B_1)))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2112 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((block <= place_520_1) OR (mi3 <= place_522_1)) AND (place_518_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)))) OR ((E (X ((2 <= cSources))) AND ((place_521_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_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((block <= place_520_1) OR (mi3 <= place_522_1)) AND (place_518_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 34 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= cSources)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= cSources))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((place_521_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 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) AND (2 <= FetchJobB_1) AND (mo2 <= f3_10 + f3_11 + f3_12 + f3_13 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((place_521_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 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) AND (2 <= FetchJobB_1) AND (mo2 <= f3_10 + f3_11 + f3_12 + f3_13 ... (shortened)
lola: processed formula length: 1730
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((2 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= 1)))
lola: processed formula: A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= 1)))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2112 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((2 <= place_458))) AND A (F ((1 <= mi2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (2 <= place_458)) AND A(TRUE U (1 <= mi2))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 38 markings, 112 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + 1 <= mo2) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_17_1 + CreatedJobs_17_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + 1 <= mo2) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_17_1 + CreatedJobs_17_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S05J40-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S05J40-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 95802 markings, 124666 edges, 19160 markings/sec, 0 secs
lola: sara is running 5 secs || 181708 markings, 243955 edges, 17181 markings/sec, 5 secs
lola: sara is running 10 secs || 262684 markings, 362519 edges, 16195 markings/sec, 10 secs
lola: sara is running 15 secs || 352397 markings, 487416 edges, 17943 markings/sec, 15 secs
lola: sara is running 20 secs || 445205 markings, 612481 edges, 18562 markings/sec, 20 secs
lola: sara is running 25 secs || 527665 markings, 729619 edges, 16492 markings/sec, 25 secs
lola: sara is running 30 secs || 609619 markings, 848906 edges, 16391 markings/sec, 30 secs
lola: sara is running 35 secs || 697878 markings, 973110 edges, 17652 markings/sec, 35 secs
lola: sara is running 40 secs || 789398 markings, 1097584 edges, 18304 markings/sec, 40 secs
lola: sara is running 45 secs || 876460 markings, 1218118 edges, 17412 markings/sec, 45 secs
lola: sara is running 50 secs || 959009 markings, 1338291 edges, 16510 markings/sec, 50 secs
lola: sara is running 55 secs || 1043068 markings, 1459702 edges, 16812 markings/sec, 55 secs
lola: sara is running 60 secs || 1129695 markings, 1584544 edges, 17325 markings/sec, 60 secs
lola: sara is running 65 secs || 1220255 markings, 1707871 edges, 18112 markings/sec, 65 secs
lola: sara is running 70 secs || 1310617 markings, 1832930 edges, 18072 markings/sec, 70 secs
lola: sara is running 75 secs || 1395683 markings, 1952637 edges, 17013 markings/sec, 75 secs
lola: sara is running 80 secs || 1479373 markings, 2073288 edges, 16738 markings/sec, 80 secs
lola: sara is running 85 secs || 1563301 markings, 2194709 edges, 16786 markings/sec, 85 secs
lola: sara is running 90 secs || 1647327 markings, 2316603 edges, 16805 markings/sec, 90 secs
lola: sara is running 95 secs || 1732713 markings, 2438418 edges, 17077 markings/sec, 95 secs
lola: sara is running 100 secs || 1818910 markings, 2562141 edges, 17239 markings/sec, 100 secs
lola: sara is running 105 secs || 1905373 markings, 2686686 edges, 17293 markings/sec, 105 secs
lola: sara is running 110 secs || 1991615 markings, 2810324 edges, 17248 markings/sec, 110 secs
lola: sara is running 115 secs || 2077796 markings, 2933837 edges, 17236 markings/sec, 115 secs
lola: sara is running 120 secs || 2163665 markings, 3057102 edges, 17174 markings/sec, 120 secs
lola: sara is running 125 secs || 2248893 markings, 3179022 edges, 17046 markings/sec, 125 secs
lola: sara is running 130 secs || 2334277 markings, 3302062 edges, 17077 markings/sec, 130 secs
lola: sara is running 135 secs || 2420967 markings, 3426556 edges, 17338 markings/sec, 135 secs
lola: sara is running 140 secs || 2508651 markings, 3551320 edges, 17537 markings/sec, 140 secs
lola: sara is running 145 secs || 2596582 markings, 3676887 edges, 17586 markings/sec, 145 secs
lola: sara is running 150 secs || 2681897 markings, 3802775 edges, 17063 markings/sec, 150 secs
lola: sara is running 155 secs || 2763898 markings, 3925151 edges, 16400 markings/sec, 155 secs
lola: sara is running 160 secs || 2847928 markings, 4048857 edges, 16806 markings/sec, 160 secs
lola: sara is running 165 secs || 2937210 markings, 4176474 edges, 17856 markings/sec, 165 secs
lola: sara is running 170 secs || 3024572 markings, 4304786 edges, 17472 markings/sec, 170 secs
lola: sara is running 175 secs || 3106444 markings, 4429349 edges, 16374 markings/sec, 175 secs
lola: sara is running 180 secs || 3195613 markings, 4556706 edges, 17834 markings/sec, 180 secs
lola: sara is running 185 secs || 3277980 markings, 4682736 edges, 16473 markings/sec, 185 secs
lola: sara is running 190 secs || 3364091 markings, 4808491 edges, 17222 markings/sec, 190 secs
lola: sara is running 195 secs || 3447213 markings, 4935928 edges, 16624 markings/sec, 195 secs
lola: sara is running 200 secs || 3536159 markings, 5064787 edges, 17789 markings/sec, 200 secs
lola: sara is running 205 secs || 3613987 markings, 5187107 edges, 15566 markings/sec, 205 secs
lola: sara is running 210 secs || 3698727 markings, 5313860 edges, 16948 markings/sec, 210 secs
lola: sara is running 215 secs || 3784323 markings, 5443150 edges, 17119 markings/sec, 215 secs
lola: sara is running 220 secs || 3869158 markings, 5572763 edges, 16967 markings/sec, 220 secs
lola: sara is running 225 secs || 3953651 markings, 5703159 edges, 16899 markings/sec, 225 secs
lola: sara is running 230 secs || 4035500 markings, 5831977 edges, 16370 markings/sec, 230 secs
lola: sara is running 235 secs || 4118091 markings, 5962561 edges, 16518 markings/sec, 235 secs
lola: sara is running 240 secs || 4203493 markings, 6095102 edges, 17080 markings/sec, 240 secs
lola: sara is running 245 secs || 4286142 markings, 6227618 edges, 16530 markings/sec, 245 secs
lola: sara is running 250 secs || 4367767 markings, 6360369 edges, 16325 markings/sec, 250 secs
lola: sara is running 255 secs || 4451602 markings, 6497753 edges, 16767 markings/sec, 255 secs
lola: sara is running 260 secs || 4534171 markings, 6635787 edges, 16514 markings/sec, 260 secs
lola: sara is running 265 secs || 4614652 markings, 6776726 edges, 16096 markings/sec, 265 secs
lola: sara is running 270 secs || 4696380 markings, 6922220 edges, 16346 markings/sec, 270 secs
lola: sara is running 275 secs || 4775376 markings, 7075462 edges, 15799 markings/sec, 275 secs
lola: sara is running 280 secs || 4852857 markings, 7262405 edges, 15496 markings/sec, 280 secs
lola: sara is running 285 secs || 4955098 markings, 7391280 edges, 20448 markings/sec, 285 secs
lola: sara is running 290 secs || 5065574 markings, 7523125 edges, 22095 markings/sec, 290 secs
lola: sara is running 295 secs || 5154180 markings, 7650613 edges, 17721 markings/sec, 295 secs
lola: sara is running 300 secs || 5245394 markings, 7774356 edges, 18243 markings/sec, 300 secs
lola: sara is running 305 secs || 5353105 markings, 7905881 edges, 21542 markings/sec, 305 secs
lola: sara is running 310 secs || 5453824 markings, 8037678 edges, 20144 markings/sec, 310 secs
lola: sara is running 315 secs || 5534460 markings, 8156621 edges, 16127 markings/sec, 315 secs
lola: sara is running 320 secs || 5639119 markings, 8287799 edges, 20932 markings/sec, 320 secs
lola: sara is running 325 secs || 5746656 markings, 8417090 edges, 21507 markings/sec, 325 secs
lola: sara is running 330 secs || 5830061 markings, 8541076 edges, 16681 markings/sec, 330 secs
lola: sara is running 335 secs || 5922518 markings, 8664560 edges, 18491 markings/sec, 335 secs
lola: sara is running 340 secs || 6031860 markings, 8796678 edges, 21868 markings/sec, 340 secs
lola: sara is running 345 secs || 6125642 markings, 8925849 edges, 18756 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-S05J40"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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-S05J40.tgz
mv PolyORBNT-PT-S05J40 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 irma4mcc-full"
echo " Input is PolyORBNT-PT-S05J40, 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 r126-smll-152673528700346"
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 ;