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 21M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 259K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 736K 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 26K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K 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 68K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 213K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 19M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-PT-S10J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534400395
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527094824621


BK_STOP 1527095192333

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-PT-S10J80 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': 395210, 'Memory': 1521.77, 'Tool': 'lola'}, {'Time': 395852, 'Memory': 1528.66, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-PT-S10J80...

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


checking for too many tokens
===========================================================================================
PolyORBNT-PT-S10J80: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-PT-S10J80 @ 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: 15114/65536 symbol table entries, 4786 collisions
lola: preprocessing...
lola: finding significant places
lola: 1614 places, 13500 transitions, 1422 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S10J80-CTLCardinality.task
lola: A (G (((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3))) AND E (X ((QueueJobE_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 + f2_48 + f2_49 + f2_50 + f2_51 + f2_52 + f2_53 + f2_54 + f2_55 + f2_56 + f2_57 + f2_58 + f2_59 + f2_60 + f2_61 + f2_62 + f2_63 + f2_64 + f2_65 + f2_66 + f2_67 + f2_68 + f2_69 + f2_70 + f2_71 + f2_72 + f2_73 + f2_74 + f2_75 + f2_76 + f2_77 + f2_78 + f2_79 + f2_80)))))) : E (G (A (X ((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 + f1_41 + f1_42 + f1_43 + f1_44 + f1_45 + f1_46 + f1_47 + f1_48 + f1_49 + f1_50 + f1_51 + f1_52 + f1_53 + f1_54 + f1_55 + f1_56 + f1_57 + f1_58 + f1_59 + f1_60 + f1_61 + f1_62 + f1_63 + f1_64 + f1_65 + f1_66 + f1_67 + f1_68 + f1_69 + f1_70 + f1_71 + f1_72 + f1_73 + f1_74 + f1_75 + f1_76 + f1_77 + f1_78 + f1_79 + f1_80 <= 0))))) : (E (F ((1 <= place_522_1))) AND NOT(E (F ((DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJobQueuedB_1_67 + NotifyEventJobQueuedB_1_66 + NotifyEventJobQueuedB_1_65 + NotifyEventJobQueuedB_1_64 + NotifyEventJobQueuedB_1_63 + NotifyEventJobQueuedB_1_62 + NotifyEventJobQueuedB_1_61 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + 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_10 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_80 + 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))))) : A (F (((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 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80 <= place_521_1) AND (2 <= place_460)))) : A (F ((A (G ((3 <= Perform_Work_E_1))) AND (place_462 <= mo1)))) : (((place_782_1 <= NotifyEventEndOfCheckSourcesE_1) AND E (G ((place_456 + 1 <= mo1)))) OR (3 <= 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 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80)) : E (X (E (F ((cJobCnt <= QueueJobE_1))))) : A (G (E (G ((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_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_58 + f3_59 + f3_60 + f3_61 + f3_62 + f3_63 + f3_64 + f3_65 + f3_66 + f3_67 + f3_68 + f3_69 + f3_70 + f3_71 + f3_72 + f3_73 + f3_74 + f3_75 + f3_76 + f3_77 + f3_78 + f3_79 + f3_80 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 <= 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_33 + AvailableJobId_34 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_40 + AvailableJobId_41 + AvailableJobId_45 + AvailableJobId_46 + AvailableJobId_48 + AvailableJobId_49 + AvailableJobId_50 + AvailableJobId_51 + AvailableJobId_52 + AvailableJobId_53 + AvailableJobId_57 + AvailableJobId_58 + AvailableJobId_60 + AvailableJobId_61 + AvailableJobId_62 + AvailableJobId_63 + AvailableJobId_64 + AvailableJobId_65 + AvailableJobId_69 + AvailableJobId_70 + AvailableJobId_71 + AvailableJobId_72 + AvailableJobId_73 + AvailableJobId_74 + AvailableJobId_75 + AvailableJobId_76 + AvailableJobId_77 + AvailableJobId_4 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_80 + AvailableJobId_79 + AvailableJobId_78 + AvailableJobId_68 + AvailableJobId_67 + AvailableJobId_66 + AvailableJobId_59 + AvailableJobId_56 + AvailableJobId_55 + AvailableJobId_54 + AvailableJobId_47 + AvailableJobId_44 + AvailableJobId_43 + AvailableJobId_42 + AvailableJobId_32 + AvailableJobId_31 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_20 + AvailableJobId_18 + AvailableJobId_17))))) : NOT(E (G ((f3_6 <= CreatedJobs_12_1)))) : A (G (E (G ((CreatedJobs_61_7 <= CreatedJobs_50_10))))) : E ((E (G ((3 <= NotifyEventJobQueuedB_1_38))) U E (G ((f1_8 <= Perform_Work_B_1_58))))) : E ((((Schedule_Task_E_1_PerformWork_51 <= 1) AND (CreatedJobs_33_10 <= 1)) U E (G ((CreatedJobs_18_2 <= CreatedJobs_26_5))))) : A ((E (X ((CreatedJobs_5_8 <= FetchJobE_1_27))) U (3 <= CreatedJobs_24_3))) : E (G (E (F (((TheSour_8 <= CreatedJobs_58_9) OR (CreatedJobs_58_3 <= CreatedJobs_63_1)))))) : A (G ((FetchJobE_1_80 <= CreatedJobs_39_7))) : A ((A (G ((FetchJobE_1_1 <= f1_24))) U A (X ((1 <= FetchJobE_1_15)))))
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 (G (((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3))) AND E (X ((QueueJobE_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3)))))
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 5688 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: The predicate is not invariant.state equation: calling and running sara

lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((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 + f1_41 + f1_42 + f1_43 + f1_44 + f1_45 + f1_46 + f1_47 + f1_48 + f1_49... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality.sara.
lola: processed formula: NOT(A(TRUE U NOT(AX((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 + f1_41 + f1_42 + f1_43 + f1_44 + f1_45 + f1_46 + f1_47 + f1_48... (shortened)
lola: processed formula length: 666
lola: 2 rewrites
lola: formula mentions 0 of 1614 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5688 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= place_522_1))) AND NOT(E (F ((DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJ... (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 (F ((1 <= place_522_1)))
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 5688 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJobQueuedB_1_67 + NotifyEventJobQu... (shortened)
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 5688 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 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 (F (((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 + Perfor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((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 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80 <= place_521_1) AND (2 <= place_460))))
lola: processed formula: A (F (((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 + Perfor... (shortened)
lola: processed formula length: 1817
lola: 0 rewrites
lola: formula mentions 0 of 1614 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5692 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((3 <= Perform_Work_E_1))) AND (place_462 <= mo1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((3 <= Perform_Work_E_1))) AND (place_462 <= mo1))))
lola: processed formula: A (F ((A (G ((3 <= Perform_Work_E_1))) AND (place_462 <= mo1))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 1614 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5692 bytes per marking, with 30 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((place_782_1 <= NotifyEventEndOfCheckSourcesE_1) AND E (G ((place_456 + 1 <= mo1)))) OR (3 <= 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 + Perfor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (place_782_1 <= NotifyEventEndOfCheckSourcesE_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (place_782_1 <= NotifyEventEndOfCheckSourcesE_1)
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 1614 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((place_456 + 1 <= mo1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (mo1 <= place_456)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 1614 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5688 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((cJobCnt <= QueueJobE_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (cJobCnt <= QueueJobE_1)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 1614 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5688 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: 179086 markings, 450596 edges, 3689320832170983424 markings/sec, 0 secs
lola: 341644 markings, 858118 edges, 32512 markings/sec, 5 secs
lola: 506178 markings, 1264360 edges, 32907 markings/sec, 10 secs
lola: 671099 markings, 1676513 edges, 32984 markings/sec, 15 secs
lola: 827898 markings, 2069011 edges, 31360 markings/sec, 20 secs
lola: 991381 markings, 2469884 edges, 32697 markings/sec, 25 secs
lola: 1153511 markings, 2871305 edges, 32426 markings/sec, 30 secs
lola: 1295047 markings, 3224189 edges, 28307 markings/sec, 35 secs
lola: 1451464 markings, 3621008 edges, 31283 markings/sec, 40 secs
lola: 1611568 markings, 4015902 edges, 32021 markings/sec, 45 secs
lola: 1754064 markings, 4378224 edges, 28499 markings/sec, 50 secs
lola: 1907637 markings, 4761713 edges, 30715 markings/sec, 55 secs
lola: 2057259 markings, 5122058 edges, 29924 markings/sec, 60 secs
lola: 2204631 markings, 5479872 edges, 29474 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: 2352407 markings, 5838640 edges, 29555 markings/sec, 70 secs
lola: 2496344 markings, 6190484 edges, 28787 markings/sec, 75 secs
lola: 2633297 markings, 6526204 edges, 27391 markings/sec, 80 secs
lola: 2780341 markings, 6892904 edges, 29409 markings/sec, 85 secs
lola: 2919447 markings, 7240200 edges, 27821 markings/sec, 90 secs
lola: 3063486 markings, 7605261 edges, 28808 markings/sec, 95 secs
lola: 3200228 markings, 7960880 edges, 27348 markings/sec, 100 secs
lola: 3334395 markings, 8313206 edges, 26833 markings/sec, 105 secs
lola: 3453954 markings, 8679014 edges, 23912 markings/sec, 110 secs
lola: 3553282 markings, 9030993 edges, 19866 markings/sec, 115 secs
lola: 3672958 markings, 9354793 edges, 23935 markings/sec, 120 secs
lola: 3781797 markings, 9670088 edges, 21768 markings/sec, 125 secs
lola: 3870738 markings, 10027671 edges, 17788 markings/sec, 130 secs
lola: 3972923 markings, 10355467 edges, 20437 markings/sec, 135 secs
lola: 4069964 markings, 10651420 edges, 19408 markings/sec, 140 secs
lola: 4175663 markings, 10978248 edges, 21140 markings/sec, 145 secs
lola: 4273170 markings, 11286828 edges, 19501 markings/sec, 150 secs
lola: 4359781 markings, 11600448 edges, 17322 markings/sec, 155 secs
lola: 4446146 markings, 11890249 edges, 17273 markings/sec, 160 secs
lola: 4554794 markings, 12223122 edges, 21730 markings/sec, 165 secs
lola: 4658947 markings, 12546173 edges, 20831 markings/sec, 170 secs
lola: 4759179 markings, 12857394 edges, 20046 markings/sec, 175 secs
lola: 4854972 markings, 13151368 edges, 19159 markings/sec, 180 secs
lola: 4953041 markings, 13448951 edges, 19614 markings/sec, 185 secs
lola: 5047373 markings, 13738111 edges, 18866 markings/sec, 190 secs
lola: 5144668 markings, 14040044 edges, 19459 markings/sec, 195 secs
lola: 5241566 markings, 14349251 edges, 19380 markings/sec, 200 secs
lola: 5323738 markings, 14629466 edges, 16434 markings/sec, 205 secs
lola: 5396610 markings, 14923600 edges, 14574 markings/sec, 210 secs
lola: 5494123 markings, 15246667 edges, 19503 markings/sec, 215 secs
lola: 5656900 markings, 15674998 edges, 32555 markings/sec, 220 secs
lola: 5828539 markings, 16110339 edges, 34328 markings/sec, 225 secs
lola: 5984819 markings, 16504802 edges, 31256 markings/sec, 230 secs
lola: 6143704 markings, 16895226 edges, 31777 markings/sec, 235 secs
lola: 6267894 markings, 17209056 edges, 24838 markings/sec, 240 secs
lola: 6267913 markings, 17209121 edges, 4 markings/sec, 245 secs
lola: 6268611 markings, 17210685 edges, 140 markings/sec, 250 secs
lola: 6268624 markings, 17210714 edges, 3 markings/sec, 255 secs
lola: 6268634 markings, 17210727 edges, 2 markings/sec, 260 secs
lola: 6268650 markings, 17210758 edges, 3 markings/sec, 265 secs
lola: 6268659 markings, 17210787 edges, 2 markings/sec, 270 secs
lola: 6268675 markings, 17210822 edges, 3 markings/sec, 275 secs
lola: 6268684 markings, 17210852 edges, 2 markings/sec, 280 secs
lola: 6268703 markings, 17210878 edges, 4 markings/sec, 285 secs
lola: 6268765 markings, 17211012 edges, 12 markings/sec, 290 secs
lola: 6268770 markings, 17211030 edges, 1 markings/sec, 295 secs
lola: 6268780 markings, 17211060 edges, 2 markings/sec, 300 secs
lola: 6268796 markings, 17211082 edges, 3 markings/sec, 305 secs
lola: local time limit reached - aborting
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-S10J80-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J80-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 stdout -----
----- Finished 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-S10J80"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-S10J80.tgz
mv PolyORBNT-PT-S10J80 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 mcc4mcc-structural"
echo " Input is PolyORBNT-PT-S10J80, 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 r131-smll-152673534400395"
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 ;