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.0M
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 52K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K 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.6M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-PT-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266800445
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527492502512


BK_STOP 1527493357138

--------------------
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-S05J20 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 841424, 'Memory': 15934.85, 'Tool': 'lola'}, {'Time': 860550, 'Memory': 15928.8, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBNT-PT-S05J20...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
PolyORBNT-PT-S05J20: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBNT-PT-S05J20 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 1559/65536 symbol table entries, 146 collisions
lola: preprocessing...
lola: finding significant places
lola: 349 places, 1210 transitions, 287 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S05J20-LTLCardinality.task
lola: A ((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)) : A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16))))) : A (G ((cJobCnt <= place_520_1))) : A (F (F (G (X ((2 <= place_782_1)))))) : A ((X (X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))) U X (G ((place_522_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))))) : A (F (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))))) : A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16)) U G (G ((3 <= mi1))))) : A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1)))) : A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14))) : A (F (F (F (F ((f2_3 <= CreatedJobs_9_4)))))) : A (F ((TheSour_4 <= CreatedJobs_18_4))) : A (F (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4)))))) : A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3)))) : A (G ((CreatedJobs_1_2 <= QueueJobB_1_18))) : A (G ((2 <= mo2))) : A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
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 ((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 + Perfo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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_... (shortened)
lola: processed formula length: 456
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + Ava... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16)))))
lola: processed formula: A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + Ava... (shortened)
lola: processed formula length: 499
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: 123804 markings, 186438 edges, 24761 markings/sec, 0 secs
lola: 247075 markings, 366545 edges, 24654 markings/sec, 5 secs
lola: 355425 markings, 525467 edges, 21670 markings/sec, 10 secs
lola: 443836 markings, 649744 edges, 17682 markings/sec, 15 secs
lola: 535504 markings, 779941 edges, 18334 markings/sec, 20 secs
lola: 618371 markings, 897705 edges, 16573 markings/sec, 25 secs
lola: 703918 markings, 1020439 edges, 17109 markings/sec, 30 secs
lola: 795490 markings, 1148802 edges, 18314 markings/sec, 35 secs
lola: 875002 markings, 1263306 edges, 15902 markings/sec, 40 secs
lola: 965508 markings, 1391826 edges, 18101 markings/sec, 45 secs
lola: 1047879 markings, 1511885 edges, 16474 markings/sec, 50 secs
lola: 1131229 markings, 1634247 edges, 16670 markings/sec, 55 secs
lola: 1217305 markings, 1759334 edges, 17215 markings/sec, 60 secs
lola: 1302055 markings, 1885045 edges, 16950 markings/sec, 65 secs
lola: 1387085 markings, 2011936 edges, 17006 markings/sec, 70 secs
lola: 1472224 markings, 2142399 edges, 17028 markings/sec, 75 secs
lola: 1558194 markings, 2279564 edges, 17194 markings/sec, 80 secs
lola: 1629013 markings, 2402470 edges, 14164 markings/sec, 85 secs
lola: 1688099 markings, 2492572 edges, 11817 markings/sec, 90 secs
lola: 1747528 markings, 2591932 edges, 11886 markings/sec, 95 secs
lola: 1806773 markings, 2681690 edges, 11849 markings/sec, 100 secs
lola: 1867060 markings, 2780761 edges, 12057 markings/sec, 105 secs
lola: 1925138 markings, 2870729 edges, 11616 markings/sec, 110 secs
lola: 1987101 markings, 2970096 edges, 12393 markings/sec, 115 secs
lola: 2043389 markings, 3059654 edges, 11258 markings/sec, 120 secs
lola: 2097812 markings, 3143965 edges, 10885 markings/sec, 125 secs
lola: 2154150 markings, 3237157 edges, 11268 markings/sec, 130 secs
lola: 2212278 markings, 3328212 edges, 11626 markings/sec, 135 secs
lola: 2271602 markings, 3425165 edges, 11865 markings/sec, 140 secs
lola: 2330625 markings, 3517110 edges, 11805 markings/sec, 145 secs
lola: 2390513 markings, 3615395 edges, 11978 markings/sec, 150 secs
lola: 2449409 markings, 3706382 edges, 11779 markings/sec, 155 secs
lola: 2508947 markings, 3804858 edges, 11908 markings/sec, 160 secs
lola: 2568113 markings, 3896953 edges, 11833 markings/sec, 165 secs
lola: 2629336 markings, 3996009 edges, 12245 markings/sec, 170 secs
lola: 2690836 markings, 4094599 edges, 12300 markings/sec, 175 secs
lola: 2745572 markings, 4184056 edges, 10947 markings/sec, 180 secs
lola: 2804832 markings, 4282704 edges, 11852 markings/sec, 185 secs
lola: 2863850 markings, 4374543 edges, 11804 markings/sec, 190 secs
lola: 2924973 markings, 4474654 edges, 12225 markings/sec, 195 secs
lola: 2984376 markings, 4571928 edges, 11881 markings/sec, 200 secs
lola: 3040813 markings, 4662481 edges, 11287 markings/sec, 205 secs
lola: 3099496 markings, 4761240 edges, 11737 markings/sec, 210 secs
lola: 3157904 markings, 4853459 edges, 11682 markings/sec, 215 secs
lola: 3217511 markings, 4952087 edges, 11921 markings/sec, 220 secs
lola: 3276075 markings, 5048007 edges, 11713 markings/sec, 225 secs
lola: 3334810 markings, 5143908 edges, 11747 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cJobCnt <= place_520_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((2 <= place_782_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= place_782_1)))))
lola: processed formula: A (F (G (X ((2 <= place_782_1)))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))) U X (G ((place_522_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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)) U G ((place_522_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)))))
lola: processed formula: A (X ((X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)) U G ((place_522_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... (shortened)
lola: processed formula length: 649
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 753380 markings, 2099283 edges, 150676 markings/sec, 0 secs
lola: 1442144 markings, 4045299 edges, 137753 markings/sec, 5 secs
lola: 2157194 markings, 6047794 edges, 143010 markings/sec, 10 secs
lola: 2802858 markings, 7903305 edges, 129133 markings/sec, 15 secs
lola: 3424136 markings, 9693142 edges, 124256 markings/sec, 20 secs
lola: 3992329 markings, 11347001 edges, 113639 markings/sec, 25 secs
lola: 4588398 markings, 13136821 edges, 119214 markings/sec, 30 secs
lola: 5145910 markings, 14829199 edges, 111502 markings/sec, 35 secs
lola: 5647368 markings, 16420702 edges, 100292 markings/sec, 40 secs
lola: 6092883 markings, 18017643 edges, 89103 markings/sec, 45 secs
lola: 6685566 markings, 19849231 edges, 118537 markings/sec, 50 secs
lola: 7355389 markings, 21745023 edges, 133965 markings/sec, 55 secs
lola: 7996582 markings, 23543588 edges, 128239 markings/sec, 60 secs
lola: 8609982 markings, 25304080 edges, 122680 markings/sec, 65 secs
lola: 9172760 markings, 26935863 edges, 112556 markings/sec, 70 secs
lola: 9789726 markings, 28717416 edges, 123393 markings/sec, 75 secs
lola: 10332110 markings, 30328846 edges, 108477 markings/sec, 80 secs
lola: 10900360 markings, 32047603 edges, 113650 markings/sec, 85 secs
lola: 11376255 markings, 33680433 edges, 95179 markings/sec, 90 secs
lola: 11877965 markings, 35258503 edges, 100342 markings/sec, 95 secs
lola: 12362189 markings, 36882275 edges, 96845 markings/sec, 100 secs
lola: 12986199 markings, 38654112 edges, 124802 markings/sec, 105 secs
lola: 13577234 markings, 40314348 edges, 118207 markings/sec, 110 secs
lola: 14207253 markings, 42117564 edges, 126004 markings/sec, 115 secs
lola: 14734496 markings, 43629600 edges, 105449 markings/sec, 120 secs
lola: 15318772 markings, 45338227 edges, 116855 markings/sec, 125 secs
lola: 15824326 markings, 46822242 edges, 101111 markings/sec, 130 secs
lola: 16379736 markings, 48503520 edges, 111082 markings/sec, 135 secs
lola: 16830434 markings, 50052970 edges, 90140 markings/sec, 140 secs
lola: 17328565 markings, 51549062 edges, 99626 markings/sec, 145 secs
lola: 17716850 markings, 52968527 edges, 77657 markings/sec, 150 secs
lola: 18306973 markings, 54691063 edges, 118025 markings/sec, 155 secs
lola: 18891296 markings, 56335733 edges, 116865 markings/sec, 160 secs
lola: 19478074 markings, 58000068 edges, 117356 markings/sec, 165 secs
lola: 20011694 markings, 59540526 edges, 106724 markings/sec, 170 secs
lola: 20561506 markings, 61138046 edges, 109962 markings/sec, 175 secs
lola: 21109282 markings, 62764527 edges, 109555 markings/sec, 180 secs
lola: 21586763 markings, 64411916 edges, 95496 markings/sec, 185 secs
lola: 22151523 markings, 66010201 edges, 112952 markings/sec, 190 secs
lola: 22626833 markings, 67493026 edges, 95062 markings/sec, 195 secs
lola: 23014781 markings, 68894958 edges, 77590 markings/sec, 200 secs
lola: 23545271 markings, 70473211 edges, 106098 markings/sec, 205 secs
lola: 24095765 markings, 72018813 edges, 110099 markings/sec, 210 secs
lola: 24618516 markings, 73524175 edges, 104550 markings/sec, 215 secs
lola: 25109002 markings, 74940634 edges, 98097 markings/sec, 220 secs
lola: 25651394 markings, 76487773 edges, 108478 markings/sec, 225 secs
lola: 26143295 markings, 77925807 edges, 98380 markings/sec, 230 secs
lola: 26681667 markings, 79534760 edges, 107674 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))))
lola: processed formula: A (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))))
lola: processed formula length: 115
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16)) U G (G ((3 <= mi1)))))
lola: processed formula: A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17... (shortened)
lola: processed formula length: 445
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 27 markings, 30 edges
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1))))
lola: processed formula: A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1))))
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: subprocess 8 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14)))
lola: processed formula: A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14)))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((f2_3 <= CreatedJobs_9_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((f2_3 <= CreatedJobs_9_4)))
lola: processed formula: A (F ((f2_3 <= CreatedJobs_9_4)))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((TheSour_4 <= CreatedJobs_18_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((TheSour_4 <= CreatedJobs_18_4)))
lola: processed formula: A (F ((TheSour_4 <= CreatedJobs_18_4)))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 11 will run for 612 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4)))))
lola: processed formula: A (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 23 markings, 37 edges
lola: ========================================
lola: subprocess 12 will run for 765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3))))
lola: processed formula: A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 1796 markings, 4284 edges
lola: ========================================
lola: subprocess 13 will run for 1020 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CreatedJobs_1_2 <= QueueJobB_1_18)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 14 will run for 1531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= mo2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: processed formula: A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 807923 markings, 2222059 edges, 161585 markings/sec, 0 secs
lola: 1609218 markings, 4458622 edges, 160259 markings/sec, 5 secs
lola: 2344281 markings, 6567497 edges, 147013 markings/sec, 10 secs
lola: 3147437 markings, 8787520 edges, 160631 markings/sec, 15 secs
lola: 3881584 markings, 10917245 edges, 146829 markings/sec, 20 secs
lola: 4670644 markings, 13097273 edges, 157812 markings/sec, 25 secs
lola: 5352031 markings, 15094684 edges, 136277 markings/sec, 30 secs
lola: 6071609 markings, 17159051 edges, 143916 markings/sec, 35 secs
lola: 6770491 markings, 19147481 edges, 139776 markings/sec, 40 secs
lola: 7461959 markings, 21149882 edges, 138294 markings/sec, 45 secs
lola: 8066647 markings, 22951956 edges, 120938 markings/sec, 50 secs
lola: 8726907 markings, 24923785 edges, 132052 markings/sec, 55 secs
lola: 9339113 markings, 26735170 edges, 122441 markings/sec, 60 secs
lola: 9949753 markings, 28614886 edges, 122128 markings/sec, 65 secs
lola: 10565489 markings, 30517232 edges, 123147 markings/sec, 70 secs
lola: 11095899 markings, 32191025 edges, 106082 markings/sec, 75 secs
lola: 11606639 markings, 33984731 edges, 102148 markings/sec, 80 secs
lola: 12109453 markings, 35736821 edges, 100563 markings/sec, 85 secs
lola: 12606285 markings, 37550076 edges, 99366 markings/sec, 90 secs
lola: 13362235 markings, 39675753 edges, 151190 markings/sec, 95 secs
lola: 14067339 markings, 41641413 edges, 141021 markings/sec, 100 secs
lola: 14814152 markings, 43761673 edges, 149363 markings/sec, 105 secs
lola: 15538147 markings, 45770147 edges, 144799 markings/sec, 110 secs
lola: 16166217 markings, 47607907 edges, 125614 markings/sec, 115 secs
lola: 16847171 markings, 49532573 edges, 136191 markings/sec, 120 secs
lola: 17485059 markings, 51369443 edges, 127578 markings/sec, 125 secs
lola: 18125839 markings, 53202550 edges, 128156 markings/sec, 130 secs
lola: 18736219 markings, 55003320 edges, 122076 markings/sec, 135 secs
lola: 19445677 markings, 57070529 edges, 141892 markings/sec, 140 secs
lola: 20040808 markings, 58775008 edges, 119026 markings/sec, 145 secs
lola: 20664248 markings, 60657767 edges, 124688 markings/sec, 150 secs
lola: 21293935 markings, 62558135 edges, 125937 markings/sec, 155 secs
lola: 21936069 markings, 64504352 edges, 128427 markings/sec, 160 secs
lola: 22484614 markings, 66327418 edges, 109709 markings/sec, 165 secs
lola: 23026259 markings, 68164624 edges, 108329 markings/sec, 170 secs
lola: 23603207 markings, 69966125 edges, 115390 markings/sec, 175 secs
lola: 24077450 markings, 71747430 edges, 94849 markings/sec, 180 secs
lola: 24716117 markings, 73744744 edges, 127733 markings/sec, 185 secs
lola: 25411070 markings, 75729893 edges, 138991 markings/sec, 190 secs
lola: 26167749 markings, 77828069 edges, 151336 markings/sec, 195 secs
lola: 26868204 markings, 79832913 edges, 140091 markings/sec, 200 secs
lola: 27582486 markings, 81852768 edges, 142856 markings/sec, 205 secs
lola: 28343995 markings, 84054748 edges, 152302 markings/sec, 210 secs
lola: 29021705 markings, 85981232 edges, 135542 markings/sec, 215 secs
lola: 29657483 markings, 87822627 edges, 127156 markings/sec, 220 secs
lola: 30394149 markings, 89965186 edges, 147333 markings/sec, 225 secs
lola: 31088155 markings, 91985777 edges, 138801 markings/sec, 230 secs
lola: 31701919 markings, 93807787 edges, 122753 markings/sec, 235 secs
lola: 32388088 markings, 95855238 edges, 137234 markings/sec, 240 secs
lola: 33044175 markings, 97883409 edges, 131217 markings/sec, 245 secs
lola: 33576275 markings, 99871192 edges, 106420 markings/sec, 250 secs
lola: 34238644 markings, 101788030 edges, 132474 markings/sec, 255 secs
lola: 34826478 markings, 103656505 edges, 117567 markings/sec, 260 secs
lola: 35327773 markings, 105536905 edges, 100259 markings/sec, 265 secs
lola: 35985919 markings, 107580410 edges, 131629 markings/sec, 270 secs
lola: 36642173 markings, 109461796 edges, 131251 markings/sec, 275 secs
lola: 37341277 markings, 111413285 edges, 139821 markings/sec, 280 secs
lola: 37961483 markings, 113168743 edges, 124041 markings/sec, 285 secs
lola: 38623071 markings, 115086025 edges, 132318 markings/sec, 290 secs
lola: 39262610 markings, 116867237 edges, 127908 markings/sec, 295 secs
lola: 39866252 markings, 118618237 edges, 120728 markings/sec, 300 secs
lola: 40524898 markings, 120547374 edges, 131729 markings/sec, 305 secs
lola: 41123011 markings, 122276099 edges, 119623 markings/sec, 310 secs
lola: 41745461 markings, 124098525 edges, 124490 markings/sec, 315 secs
lola: 42363733 markings, 125980071 edges, 123654 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no no yes yes no yes no no no unknown
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-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-S05J20"
export BK_EXAMINATION="LTLCardinality"
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-S05J20.tgz
mv PolyORBNT-PT-S05J20 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-S05J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-smll-152732266800445"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;