About the Execution of Irma.struct for PolyORBLF-PT-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1237.470 | 649263.00 | 1298548.00 | 2212.10 | ???????????????? | normal |
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 16M
-rw-r--r-- 1 mcc users 6.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 193K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 580K 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 5.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 164K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 15M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S06J06T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529300250
=====================================================================
--------------------
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-S06J06T06-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526852593860
BK_STOP 1526853243123
--------------------
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 PolyORBLF-PT-S06J06T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 3539204, 'Memory': 1169.98, 'Tool': 'lola'}, {'Time': 3539426, 'Memory': 1157.18, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola PolyORBLF-PT-S06J06T06...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-PT-S06J06T06: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T06: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PolyORBLF-PT-S06J06T06 @ 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: 11440/65536 symbol table entries, 6628 collisions
lola: preprocessing...
lola: finding significant places
lola: 700 places, 10740 transitions, 642 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3155 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T06-ReachabilityCardinality.task
lola: E (F ((1 <= P_1717))) : A (G (((P_1726 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6) AND ((Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 <= 1) OR (P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= 2))))) : A (G (((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 <= P_1726) OR (3 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6) OR (1 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6) OR (2 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6) OR (2 <= MarkerWrite)))) : A (G ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6))) : A (G (((cIdleTasks <= CanInjectEvent) OR (ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))) : E (F (((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6) AND (2 <= CanInjectEvent)))) : E (F (((1 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6) AND (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6)))) : A (G (((CanInjectEvent <= 1) OR (P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 + 1 <= cPollingAbort) OR (3 <= P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)))) : A (G ((P_2321_5 <= QueueJobB_4_5))) : A (G ((DisablePollingE_3_3 <= DisablePollingB_2_1))) : E (F ((1 <= NotifyEventSourceAddedE_1))) : A (G (((FetchJobB_1 <= P_1113_5) AND (P_1119_2_2 <= P_1113_2)))) : E (F (((3 <= NotifyEventSourceAddedE_2) AND (2 <= P_1158_6) AND (JobCnt + 1 <= DisablePollingB_6_6) AND ((DisablePollingB_2_1 <= 0) OR (DisablePollingB_1_2 <= 2))))) : A (G ((((Abort_Check_Sources_B_5 + 1 <= P_1119_5_1) AND (FetchJobB_5 + 1 <= FetchJobE_2_5)) OR ((QueueJobB_3_1 <= NotifyEventJobQueuedB_3_5) AND (P_1159_1 <= P_1119_5_5))))) : A (G ((FetchJobE_4_4 <= Try_Check_Sources_E_1))) : E (F ((((FetchJobE_4_4 <= EnablePollingB_4) AND (2 <= Insert_Source_B_4_5)) OR (2 <= DisablePollingB_6_5) OR ((2 <= P_2321_5) AND (2 <= P_1113_5) AND (DataOnSrc_3 + 1 <= Insert_Source_B_1_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: E (F ((1 <= P_1717)))
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 2568 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-S06J06T06-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1726 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + Schedul... (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 2568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J06T06-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Wor... (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 2568 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J06T06-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6)))
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 2568 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-S06J06T06-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cIdleTasks <= CanInjectEvent) OR (ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6))))
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 2568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J06T06-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J06T06-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 7315 markings, 7572 edges, 1463 markings/sec, 0 secs
lola: sara is running 5 secs || 14583 markings, 15260 edges, 1454 markings/sec, 5 secs
lola: sara is running 10 secs || 21871 markings, 22936 edges, 1458 markings/sec, 10 secs
lola: sara is running 15 secs || 29120 markings, 30495 edges, 1450 markings/sec, 15 secs
lola: sara is running 20 secs || 36440 markings, 38121 edges, 1464 markings/sec, 20 secs
lola: sara is running 25 secs || 43760 markings, 45800 edges, 1464 markings/sec, 25 secs
lola: sara is running 30 secs || 51123 markings, 53499 edges, 1473 markings/sec, 30 secs
lola: sara is running 35 secs || 58388 markings, 61100 edges, 1453 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 65819 markings, 68973 edges, 1486 markings/sec, 40 secs
lola: sara is running 45 secs || 73409 markings, 76947 edges, 1518 markings/sec, 45 secs
lola: sara is running 50 secs || 81023 markings, 84914 edges, 1523 markings/sec, 50 secs
lola: sara is running 55 secs || 88697 markings, 93017 edges, 1535 markings/sec, 55 secs
lola: sara is running 60 secs || 96364 markings, 101271 edges, 1533 markings/sec, 60 secs
lola: sara is running 65 secs || 103948 markings, 109192 edges, 1517 markings/sec, 65 secs
lola: sara is running 70 secs || 111317 markings, 117032 edges, 1474 markings/sec, 70 secs
lola: sara is running 75 secs || 118684 markings, 124755 edges, 1473 markings/sec, 75 secs
lola: sara is running 80 secs || 126163 markings, 132584 edges, 1496 markings/sec, 80 secs
lola: sara is running 85 secs || 133507 markings, 140427 edges, 1469 markings/sec, 85 secs
lola: sara is running 90 secs || 140804 markings, 148194 edges, 1459 markings/sec, 90 secs
lola: sara is running 95 secs || 148097 markings, 155905 edges, 1459 markings/sec, 95 secs
lola: sara is running 100 secs || 155390 markings, 163615 edges, 1459 markings/sec, 100 secs
lola: sara is running 105 secs || 162742 markings, 171479 edges, 1470 markings/sec, 105 secs
lola: sara is running 110 secs || 170039 markings, 179154 edges, 1459 markings/sec, 110 secs
lola: sara is running 115 secs || 177388 markings, 186940 edges, 1470 markings/sec, 115 secs
lola: sara is running 120 secs || 184736 markings, 194782 edges, 1470 markings/sec, 120 secs
lola: sara is running 125 secs || 192122 markings, 202627 edges, 1477 markings/sec, 125 secs
lola: sara is running 130 secs || 199506 markings, 210437 edges, 1477 markings/sec, 130 secs
lola: sara is running 135 secs || 206925 markings, 218248 edges, 1484 markings/sec, 135 secs
lola: sara is running 140 secs || 214301 markings, 226083 edges, 1475 markings/sec, 140 secs
lola: sara is running 145 secs || 221657 markings, 233850 edges, 1471 markings/sec, 145 secs
lola: sara is running 150 secs || 228913 markings, 241428 edges, 1451 markings/sec, 150 secs
lola: sara is running 155 secs || 236259 markings, 249219 edges, 1469 markings/sec, 155 secs
lola: sara is running 160 secs || 243645 markings, 257111 edges, 1477 markings/sec, 160 secs
lola: sara is running 165 secs || 250983 markings, 265383 edges, 1468 markings/sec, 165 secs
lola: sara is running 170 secs || 258252 markings, 273148 edges, 1454 markings/sec, 170 secs
lola: sara is running 175 secs || 265624 markings, 280883 edges, 1474 markings/sec, 175 secs
lola: sara is running 180 secs || 273124 markings, 288715 edges, 1500 markings/sec, 180 secs
lola: sara is running 185 secs || 280455 markings, 296431 edges, 1466 markings/sec, 185 secs
lola: sara is running 190 secs || 287935 markings, 304175 edges, 1496 markings/sec, 190 secs
lola: sara is running 195 secs || 295367 markings, 311946 edges, 1486 markings/sec, 195 secs
lola: sara is running 200 secs || 302764 markings, 319751 edges, 1479 markings/sec, 200 secs
lola: sara is running 205 secs || 310173 markings, 327531 edges, 1482 markings/sec, 205 secs
lola: sara is running 210 secs || 317648 markings, 335316 edges, 1495 markings/sec, 210 secs
lola: sara is running 215 secs || 325069 markings, 343226 edges, 1484 markings/sec, 215 secs
lola: sara is running 220 secs || 332464 markings, 350974 edges, 1479 markings/sec, 220 secs
lola: sara is running 225 secs || 339893 markings, 358811 edges, 1486 markings/sec, 225 secs
lola: sara is running 230 secs || 347331 markings, 366517 edges, 1488 markings/sec, 230 secs
lola: sara is running 235 secs || 354761 markings, 374275 edges, 1486 markings/sec, 235 secs
lola: sara is running 240 secs || 362079 markings, 382163 edges, 1464 markings/sec, 240 secs
lola: sara is running 245 secs || 369441 markings, 390073 edges, 1472 markings/sec, 245 secs
lola: sara is running 250 secs || 376589 markings, 397656 edges, 1430 markings/sec, 250 secs
lola: sara is running 255 secs || 383970 markings, 405609 edges, 1476 markings/sec, 255 secs
lola: sara is running 260 secs || 391333 markings, 413471 edges, 1473 markings/sec, 260 secs
lola: sara is running 265 secs || 398850 markings, 421460 edges, 1503 markings/sec, 265 secs
lola: sara is running 270 secs || 406134 markings, 429144 edges, 1457 markings/sec, 270 secs
lola: sara is running 275 secs || 413603 markings, 436978 edges, 1494 markings/sec, 275 secs
lola: sara is running 280 secs || 421259 markings, 445126 edges, 1531 markings/sec, 280 secs
lola: sara is running 285 secs || 428948 markings, 453254 edges, 1538 markings/sec, 285 secs
lola: sara is running 290 secs || 436645 markings, 461508 edges, 1539 markings/sec, 290 secs
lola: sara is running 295 secs || 444345 markings, 469720 edges, 1540 markings/sec, 295 secs
lola: sara is running 300 secs || 451939 markings, 477691 edges, 1519 markings/sec, 300 secs
lola: sara is running 305 secs || 459633 markings, 485960 edges, 1539 markings/sec, 305 secs
lola: sara is running 310 secs || 467330 markings, 494318 edges, 1539 markings/sec, 310 secs
lola: sara is running 315 secs || 474962 markings, 502557 edges, 1526 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6) AND (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6))))
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 2568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J06T06-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T06-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 7239 markings, 8394 edges, 1448 markings/sec, 0 secs
lola: sara is running 5 secs || 14080 markings, 17927 edges, 1368 markings/sec, 5 secs
lola: sara is running 10 secs || 20892 markings, 27130 edges, 1362 markings/sec, 10 secs
lola: sara is running 15 secs || 27748 markings, 36961 edges, 1371 markings/sec, 15 secs
lola: sara is running 20 secs || 34439 markings, 46135 edges, 1338 markings/sec, 20 secs
lola: sara is running 25 secs || 41170 markings, 55501 edges, 1346 markings/sec, 25 secs
lola: sara is running 30 secs || 48019 markings, 65276 edges, 1370 markings/sec, 30 secs
lola: sara is running 35 secs || 54723 markings, 74265 edges, 1341 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 61580 markings, 84168 edges, 1371 markings/sec, 40 secs
lola: sara is running 45 secs || 68622 markings, 92776 edges, 1408 markings/sec, 45 secs
lola: sara is running 50 secs || 75552 markings, 101476 edges, 1386 markings/sec, 50 secs
lola: sara is running 55 secs || 82385 markings, 112202 edges, 1367 markings/sec, 55 secs
lola: sara is running 60 secs || 89716 markings, 121381 edges, 1466 markings/sec, 60 secs
lola: sara is running 65 secs || 96944 markings, 130935 edges, 1446 markings/sec, 65 secs
lola: sara is running 70 secs || 103957 markings, 140505 edges, 1403 markings/sec, 70 secs
lola: sara is running 75 secs || 111140 markings, 150746 edges, 1437 markings/sec, 75 secs
lola: sara is running 80 secs || 118352 markings, 160820 edges, 1442 markings/sec, 80 secs
lola: sara is running 85 secs || 125384 markings, 170461 edges, 1406 markings/sec, 85 secs
lola: sara is running 90 secs || 132535 markings, 180336 edges, 1430 markings/sec, 90 secs
lola: sara is running 95 secs || 139657 markings, 191008 edges, 1424 markings/sec, 95 secs
lola: sara is running 100 secs || 146895 markings, 201162 edges, 1448 markings/sec, 100 secs
lola: sara is running 105 secs || 154190 markings, 210651 edges, 1459 markings/sec, 105 secs
lola: sara is running 110 secs || 161517 markings, 219980 edges, 1465 markings/sec, 110 secs
lola: sara is running 115 secs || 168550 markings, 229503 edges, 1407 markings/sec, 115 secs
lola: sara is running 120 secs || 175662 markings, 240029 edges, 1422 markings/sec, 120 secs
lola: sara is running 125 secs || 182895 markings, 250115 edges, 1447 markings/sec, 125 secs
lola: sara is running 130 secs || 189919 markings, 259494 edges, 1405 markings/sec, 130 secs
lola: sara is running 135 secs || 197134 markings, 269843 edges, 1443 markings/sec, 135 secs
lola: sara is running 140 secs || 204242 markings, 279698 edges, 1422 markings/sec, 140 secs
lola: sara is running 145 secs || 211347 markings, 289262 edges, 1421 markings/sec, 145 secs
lola: sara is running 150 secs || 218426 markings, 299945 edges, 1416 markings/sec, 150 secs
lola: sara is running 155 secs || 225626 markings, 310381 edges, 1440 markings/sec, 155 secs
lola: sara is running 160 secs || 232859 markings, 320495 edges, 1447 markings/sec, 160 secs
lola: sara is running 165 secs || 240140 markings, 330264 edges, 1456 markings/sec, 165 secs
lola: sara is running 170 secs || 247167 markings, 339858 edges, 1405 markings/sec, 170 secs
lola: sara is running 175 secs || 254226 markings, 349828 edges, 1412 markings/sec, 175 secs
lola: sara is running 180 secs || 261329 markings, 360145 edges, 1421 markings/sec, 180 secs
lola: sara is running 185 secs || 268504 markings, 369385 edges, 1435 markings/sec, 185 secs
lola: sara is running 190 secs || 275971 markings, 378239 edges, 1493 markings/sec, 190 secs
lola: sara is running 195 secs || 283050 markings, 387961 edges, 1416 markings/sec, 195 secs
lola: sara is running 200 secs || 290157 markings, 397777 edges, 1421 markings/sec, 200 secs
lola: sara is running 205 secs || 297445 markings, 407833 edges, 1458 markings/sec, 205 secs
lola: sara is running 210 secs || 304503 markings, 417359 edges, 1412 markings/sec, 210 secs
lola: sara is running 215 secs || 311592 markings, 427549 edges, 1418 markings/sec, 215 secs
lola: sara is running 220 secs || 318880 markings, 436649 edges, 1458 markings/sec, 220 secs
lola: sara is running 225 secs || 326027 markings, 445830 edges, 1429 markings/sec, 225 secs
lola: sara is running 230 secs || 333069 markings, 456938 edges, 1408 markings/sec, 230 secs
lola: sara is running 235 secs || 340283 markings, 465879 edges, 1443 markings/sec, 235 secs
lola: sara is running 240 secs || 347408 markings, 475346 edges, 1425 markings/sec, 240 secs
lola: sara is running 245 secs || 354439 markings, 486522 edges, 1406 markings/sec, 245 secs
lola: sara is running 250 secs || 361440 markings, 496983 edges, 1400 markings/sec, 250 secs
lola: sara is running 255 secs || 368840 markings, 507813 edges, 1480 markings/sec, 255 secs
lola: sara is running 260 secs || 376217 markings, 516252 edges, 1475 markings/sec, 260 secs
lola: sara is running 265 secs || 383448 markings, 526723 edges, 1446 markings/sec, 265 secs
lola: sara is running 270 secs || 390653 markings, 537619 edges, 1441 markings/sec, 270 secs
lola: sara is running 275 secs || 397814 markings, 546067 edges, 1432 markings/sec, 275 secs
lola: sara is running 280 secs || 404505 markings, 556264 edges, 1338 markings/sec, 280 secs
lola: sara is running 285 secs || 411285 markings, 566522 edges, 1356 markings/sec, 285 secs
lola: sara is running 290 secs || 418010 markings, 575882 edges, 1345 markings/sec, 290 secs
lola: sara is running 295 secs || 424707 markings, 584988 edges, 1339 markings/sec, 295 secs
lola: sara is running 300 secs || 431475 markings, 594415 edges, 1354 markings/sec, 300 secs
lola: sara is running 305 secs || 438237 markings, 604577 edges, 1352 markings/sec, 305 secs
lola: sara is running 310 secs || 445114 markings, 614292 edges, 1375 markings/sec, 310 secs
lola: sara is running 315 secs || 451897 markings, 623616 edges, 1357 markings/sec, 315 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 PolyORBLF-PT-S06J06T06-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-ReachabilityCardinality-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-S06J06T06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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/PolyORBLF-PT-S06J06T06.tgz
mv PolyORBLF-PT-S06J06T06 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-structural"
echo " Input is PolyORBLF-PT-S06J06T06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r127-smll-152673529300250"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;