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 10M
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 56K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528500220
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526844431260


BK_STOP 1526844732043

--------------------
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 PolyORBLF-PT-S06J04T04 as instance name.
Using PolyORBLF 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': 2810, 'Memory': 176.16, 'Tool': 'lola'}, {'Time': 3092, 'Memory': 176.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J04T04...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J04T04: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-PT-S06J04T04 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: A (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4)))) : (((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead)) AND E (G (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1 <= CanInjectEvent) OR (FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4) OR (1 <= RunE_1 + RunE_2 + RunE_3 + RunE_4))))) : A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))))) : ((E (F ((IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= 2))) AND ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))) AND A (G (A (G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4)))))) : A (G ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 2))) : A (G (E (G (((1 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4) OR (2 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)))))) : A ((E (F ((3 <= RunB_1 + RunB_2 + RunB_3 + RunB_4))) U ((cBlockedTasks <= 2) AND (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 0)))) : NOT(E (X (E (F ((1 <= P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4)))))) : NOT(((DataOnSrc_3 <= QueueJobB_4_1) OR A (F ((1 <= DisablePollingB_4_1))))) : NOT(A (((NotifyEventJobQueuedB_2_3 <= 2) U ((cJobCnt <= QueueJobB_4_2) AND (1 <= Try_Check_Sources_B_1))))) : (((A (X ((1 <= ScheduleTaskE_Work_1_2))) AND (DisablePollingB_1_4 + 1 <= RunE_2)) OR A (((Insert_Source_B_2_5 <= P_2579_3_5) U (2 <= Insert_Source_B_1_1)))) AND E (F (((QueueJobB_3_2 + 1 <= QueueJobB_4_4) OR (DataOnSrc_2 + 1 <= P_2579_4_6))))) : E (F ((2 <= CreatedJobs_1_6))) : NOT((A (G (((NotifyEventJobQueuedB_3_1 <= EnablePollingB_2) OR (P_2579_1_2 <= NotifyEventJobCompletedE_2)))) OR ((cBlockedTasks <= DisablePollingE_1_3) AND (2 <= CreatedJobs_4_3) AND (3 <= DisablePollingE_3_3) AND (P_1155_3 <= CreatedJobs_0_6) AND (cJobCnt <= Abort_Check_Sources_B_1)))) : NOT(E (((Insert_Source_B_1_3 <= P_1095) U (DisablePollingE_4_4 + 1 <= ScheduleTaskE_Work_1_3)))) : ((NOT(A (G ((1 <= Abort_Check_Sources_E_3)))) AND E (G ((ScheduleTaskE_Work_4_2 <= 0)))) AND A (F ((NotifyEventJobQueuedB_2_1 <= Insert_Source_B_2_2)))) : NOT(NOT(A (G ((TryAllocateOneTaskE_4 <= NotifyEventJobQueuedB_2_1)))))
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 (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4))))
lola: processed formula: A (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4))))
lola: processed formula length: 379
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead)) AND E (G (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead))
lola: processed formula length: 254
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((CanInjectEvent + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePoll... (shortened)
lola: processed formula length: 772
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 198 markings, 197 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6)))))
lola: processed formula: A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6)))... (shortened)
lola: processed formula length: 402
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 119 markings, 119 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= 2))) AND ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))) AND A (G (A (G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4))))))
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: E (F ((IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= 2)))
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 1616 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4)))
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 1616 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 PolyORBLF-PT-S06J04T04-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T04-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 447 markings, 679 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 2)))
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 1616 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 PolyORBLF-PT-S06J04T04-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T04-CTLCardinality-4.sara.
lola: sara is running 0 secs || 11981 markings, 30221 edges, 2396 markings/sec, 0 secs
lola: sara is running 5 secs || 29869 markings, 58477 edges, 3578 markings/sec, 5 secs
lola: sara is running 10 secs || 46088 markings, 90559 edges, 3244 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 63570 markings, 122595 edges, 3496 markings/sec, 15 secs
lola: sara is running 20 secs || 83323 markings, 152188 edges, 3951 markings/sec, 20 secs
lola: sara is running 25 secs || 104340 markings, 180632 edges, 4203 markings/sec, 25 secs
lola: sara is running 30 secs || 122951 markings, 211646 edges, 3722 markings/sec, 30 secs
lola: sara is running 35 secs || 141337 markings, 243670 edges, 3677 markings/sec, 35 secs
lola: sara is running 40 secs || 161275 markings, 273496 edges, 3988 markings/sec, 40 secs
lola: sara is running 45 secs || 181718 markings, 304158 edges, 4089 markings/sec, 45 secs
lola: sara is running 50 secs || 202040 markings, 334494 edges, 4064 markings/sec, 50 secs
lola: sara is running 55 secs || 223199 markings, 363446 edges, 4232 markings/sec, 55 secs
lola: sara is running 60 secs || 242787 markings, 393922 edges, 3918 markings/sec, 60 secs
lola: sara is running 65 secs || 263744 markings, 422599 edges, 4191 markings/sec, 65 secs
lola: sara is running 70 secs || 282472 markings, 453077 edges, 3746 markings/sec, 70 secs
lola: sara is running 75 secs || 302656 markings, 482334 edges, 4037 markings/sec, 75 secs
lola: sara is running 80 secs || 323012 markings, 511704 edges, 4071 markings/sec, 80 secs
lola: sara is running 85 secs || 345632 markings, 540399 edges, 4524 markings/sec, 85 secs
lola: sara is running 90 secs || 366977 markings, 570207 edges, 4269 markings/sec, 90 secs
lola: sara is running 95 secs || 387565 markings, 599756 edges, 4118 markings/sec, 95 secs
lola: sara is running 100 secs || 411436 markings, 628431 edges, 4774 markings/sec, 100 secs
lola: sara is running 105 secs || 435963 markings, 657057 edges, 4905 markings/sec, 105 secs
lola: sara is running 110 secs || 460698 markings, 685882 edges, 4947 markings/sec, 110 secs
lola: sara is running 115 secs || 482803 markings, 715961 edges, 4421 markings/sec, 115 secs
lola: sara is running 120 secs || 505180 markings, 745772 edges, 4475 markings/sec, 120 secs
lola: sara is running 125 secs || 532901 markings, 790896 edges, 5544 markings/sec, 125 secs
lola: sara is running 130 secs || 557653 markings, 820276 edges, 4950 markings/sec, 130 secs
lola: sara is running 135 secs || 580216 markings, 850898 edges, 4513 markings/sec, 135 secs
lola: sara is running 140 secs || 609009 markings, 895359 edges, 5759 markings/sec, 140 secs
lola: sara is running 145 secs || 632972 markings, 925650 edges, 4793 markings/sec, 145 secs
lola: sara is running 150 secs || 658098 markings, 955330 edges, 5025 markings/sec, 150 secs
lola: sara is running 155 secs || 683393 markings, 985589 edges, 5059 markings/sec, 155 secs
lola: sara is running 160 secs || 706677 markings, 1015501 edges, 4657 markings/sec, 160 secs
lola: sara is running 165 secs || 730922 markings, 1044613 edges, 4849 markings/sec, 165 secs
lola: sara is running 170 secs || 756562 markings, 1074698 edges, 5128 markings/sec, 170 secs
lola: sara is running 175 secs || 774737 markings, 1110359 edges, 3635 markings/sec, 175 secs
lola: sara is running 180 secs || 793197 markings, 1143533 edges, 3692 markings/sec, 180 secs
lola: sara is running 185 secs || 817837 markings, 1174015 edges, 4928 markings/sec, 185 secs
lola: sara is running 190 secs || 839715 markings, 1204014 edges, 4376 markings/sec, 190 secs
lola: sara is running 195 secs || 863511 markings, 1233734 edges, 4759 markings/sec, 195 secs
lola: sara is running 200 secs || 887871 markings, 1264262 edges, 4872 markings/sec, 200 secs
lola: sara is running 205 secs || 907031 markings, 1297167 edges, 3832 markings/sec, 205 secs
lola: sara is running 210 secs || 932192 markings, 1327024 edges, 5032 markings/sec, 210 secs
lola: sara is running 215 secs || 954990 markings, 1358300 edges, 4560 markings/sec, 215 secs
lola: sara is running 220 secs || 972523 markings, 1393198 edges, 3507 markings/sec, 220 secs
lola: sara is running 225 secs || 993826 markings, 1425334 edges, 4261 markings/sec, 225 secs
lola: sara is running 230 secs || 1016866 markings, 1457129 edges, 4608 markings/sec, 230 secs
lola: sara is running 235 secs || 1039680 markings, 1487899 edges, 4563 markings/sec, 235 secs
lola: sara is running 240 secs || 1062840 markings, 1519387 edges, 4632 markings/sec, 240 secs
lola: sara is running 245 secs || 1085926 markings, 1550351 edges, 4617 markings/sec, 245 secs
lola: sara is running 250 secs || 1107112 markings, 1582416 edges, 4237 markings/sec, 250 secs
lola: sara is running 255 secs || 1130069 markings, 1613938 edges, 4591 markings/sec, 255 secs
lola: sara is running 260 secs || 1154565 markings, 1643762 edges, 4899 markings/sec, 260 secs
lola: sara is running 265 secs || 1175578 markings, 1676802 edges, 4203 markings/sec, 265 secs
lola: sara is running 270 secs || 1197311 markings, 1710553 edges, 4347 markings/sec, 270 secs
lola: sara is running 275 secs || 1216709 markings, 1745978 edges, 3880 markings/sec, 275 secs
lola: sara is running 280 secs || 1248607 markings, 1805870 edges, 6380 markings/sec, 280 secs
lola: sara is running 285 secs || 1270101 markings, 1839242 edges, 4299 markings/sec, 285 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: '
'
Aborted (core dumped)
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-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="PolyORBLF-PT-S06J04T04"
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/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 PolyORBLF-PT-S06J04T04, 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-152673528500220"
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 ;