About the Execution of Irma.full for PolyORBLF-PT-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1262.580 | 648226.00 | 1295204.00 | 2793.30 | ???????????????? | 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-full
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 r126-smll-152673528500250
=====================================================================
--------------------
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 1526851031474
BK_STOP 1526851679700
--------------------
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-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': 'gspn'}].
ReachabilityCardinality lola PolyORBLF-PT-S06J06T06...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ PolyORBLF-PT-S06J06T06 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- 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: 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 || 7812 markings, 8117 edges, 1562 markings/sec, 0 secs
lola: sara is running 5 secs || 15526 markings, 16232 edges, 1543 markings/sec, 5 secs
lola: sara is running 10 secs || 23215 markings, 24314 edges, 1538 markings/sec, 10 secs
lola: sara is running 15 secs || 30776 markings, 32242 edges, 1512 markings/sec, 15 secs
lola: sara is running 20 secs || 38327 markings, 40091 edges, 1510 markings/sec, 20 secs
lola: sara is running 25 secs || 45914 markings, 48043 edges, 1517 markings/sec, 25 secs
lola: sara is running 30 secs || 53462 markings, 55959 edges, 1510 markings/sec, 30 secs
lola: sara is running 35 secs || 60922 markings, 63789 edges, 1492 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 68455 markings, 71738 edges, 1507 markings/sec, 40 secs
lola: sara is running 45 secs || 76151 markings, 79861 edges, 1539 markings/sec, 45 secs
lola: sara is running 50 secs || 83937 markings, 87924 edges, 1557 markings/sec, 50 secs
lola: sara is running 55 secs || 91737 markings, 96254 edges, 1560 markings/sec, 55 secs
lola: sara is running 60 secs || 99570 markings, 104638 edges, 1567 markings/sec, 60 secs
lola: sara is running 65 secs || 107329 markings, 112842 edges, 1552 markings/sec, 65 secs
lola: sara is running 70 secs || 115167 markings, 121069 edges, 1568 markings/sec, 70 secs
lola: sara is running 75 secs || 123018 markings, 129339 edges, 1570 markings/sec, 75 secs
lola: sara is running 80 secs || 130831 markings, 137561 edges, 1563 markings/sec, 80 secs
lola: sara is running 85 secs || 138624 markings, 145874 edges, 1559 markings/sec, 85 secs
lola: sara is running 90 secs || 146333 markings, 154031 edges, 1542 markings/sec, 90 secs
lola: sara is running 95 secs || 154100 markings, 162258 edges, 1553 markings/sec, 95 secs
lola: sara is running 100 secs || 161838 markings, 170534 edges, 1548 markings/sec, 100 secs
lola: sara is running 105 secs || 169582 markings, 178682 edges, 1549 markings/sec, 105 secs
lola: sara is running 110 secs || 177353 markings, 186905 edges, 1554 markings/sec, 110 secs
lola: sara is running 115 secs || 185127 markings, 195190 edges, 1555 markings/sec, 115 secs
lola: sara is running 120 secs || 192779 markings, 203322 edges, 1530 markings/sec, 120 secs
lola: sara is running 125 secs || 200354 markings, 211330 edges, 1515 markings/sec, 125 secs
lola: sara is running 130 secs || 208177 markings, 219593 edges, 1565 markings/sec, 130 secs
lola: sara is running 135 secs || 215934 markings, 227844 edges, 1551 markings/sec, 135 secs
lola: sara is running 140 secs || 223440 markings, 235731 edges, 1501 markings/sec, 140 secs
lola: sara is running 145 secs || 231040 markings, 243700 edges, 1520 markings/sec, 145 secs
lola: sara is running 150 secs || 238668 markings, 251759 edges, 1526 markings/sec, 150 secs
lola: sara is running 155 secs || 246367 markings, 260419 edges, 1540 markings/sec, 155 secs
lola: sara is running 160 secs || 254001 markings, 268641 edges, 1527 markings/sec, 160 secs
lola: sara is running 165 secs || 261616 markings, 276677 edges, 1523 markings/sec, 165 secs
lola: sara is running 170 secs || 269362 markings, 284834 edges, 1549 markings/sec, 170 secs
lola: sara is running 175 secs || 277136 markings, 293001 edges, 1555 markings/sec, 175 secs
lola: sara is running 180 secs || 284850 markings, 300986 edges, 1543 markings/sec, 180 secs
lola: sara is running 185 secs || 292657 markings, 309118 edges, 1561 markings/sec, 185 secs
lola: sara is running 190 secs || 300346 markings, 317258 edges, 1538 markings/sec, 190 secs
lola: sara is running 195 secs || 308061 markings, 325293 edges, 1543 markings/sec, 195 secs
lola: sara is running 200 secs || 315899 markings, 333495 edges, 1568 markings/sec, 200 secs
lola: sara is running 205 secs || 323662 markings, 341724 edges, 1553 markings/sec, 205 secs
lola: sara is running 210 secs || 331413 markings, 349830 edges, 1550 markings/sec, 210 secs
lola: sara is running 215 secs || 339151 markings, 358040 edges, 1548 markings/sec, 215 secs
lola: sara is running 220 secs || 346901 markings, 366059 edges, 1550 markings/sec, 220 secs
lola: sara is running 225 secs || 354645 markings, 374159 edges, 1549 markings/sec, 225 secs
lola: sara is running 230 secs || 362284 markings, 382370 edges, 1528 markings/sec, 230 secs
lola: sara is running 235 secs || 369983 markings, 390634 edges, 1540 markings/sec, 235 secs
lola: sara is running 240 secs || 377430 markings, 398554 edges, 1489 markings/sec, 240 secs
lola: sara is running 245 secs || 385101 markings, 406886 edges, 1534 markings/sec, 245 secs
lola: sara is running 250 secs || 392798 markings, 415027 edges, 1539 markings/sec, 250 secs
lola: sara is running 255 secs || 400474 markings, 423160 edges, 1535 markings/sec, 255 secs
lola: sara is running 260 secs || 408142 markings, 431254 edges, 1534 markings/sec, 260 secs
lola: sara is running 265 secs || 415849 markings, 439331 edges, 1541 markings/sec, 265 secs
lola: sara is running 270 secs || 423513 markings, 447462 edges, 1533 markings/sec, 270 secs
lola: sara is running 275 secs || 431212 markings, 455732 edges, 1540 markings/sec, 275 secs
lola: sara is running 280 secs || 438899 markings, 463915 edges, 1537 markings/sec, 280 secs
lola: sara is running 285 secs || 446546 markings, 472027 edges, 1529 markings/sec, 285 secs
lola: sara is running 290 secs || 454128 markings, 480006 edges, 1516 markings/sec, 290 secs
lola: sara is running 295 secs || 461819 markings, 488275 edges, 1538 markings/sec, 295 secs
lola: sara is running 300 secs || 469435 markings, 496621 edges, 1523 markings/sec, 300 secs
lola: sara is running 305 secs || 477018 markings, 504789 edges, 1517 markings/sec, 305 secs
lola: sara is running 310 secs || 484642 markings, 513013 edges, 1525 markings/sec, 310 secs
lola: sara is running 315 secs || 492252 markings, 521194 edges, 1522 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 || 7482 markings, 8770 edges, 1496 markings/sec, 0 secs
lola: sara is running 5 secs || 14536 markings, 18465 edges, 1411 markings/sec, 5 secs
lola: sara is running 10 secs || 21604 markings, 28212 edges, 1414 markings/sec, 10 secs
lola: sara is running 15 secs || 28824 markings, 38440 edges, 1444 markings/sec, 15 secs
lola: sara is running 20 secs || 35873 markings, 47940 edges, 1410 markings/sec, 20 secs
lola: sara is running 25 secs || 42951 markings, 58234 edges, 1416 markings/sec, 25 secs
lola: sara is running 30 secs || 50061 markings, 68077 edges, 1422 markings/sec, 30 secs
lola: sara is running 35 secs || 57064 markings, 77691 edges, 1401 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 64228 markings, 87783 edges, 1433 markings/sec, 40 secs
lola: sara is running 45 secs || 71435 markings, 96051 edges, 1441 markings/sec, 45 secs
lola: sara is running 50 secs || 78544 markings, 105944 edges, 1422 markings/sec, 50 secs
lola: sara is running 55 secs || 85631 markings, 116978 edges, 1417 markings/sec, 55 secs
lola: sara is running 60 secs || 93098 markings, 125651 edges, 1493 markings/sec, 60 secs
lola: sara is running 65 secs || 100155 markings, 135451 edges, 1411 markings/sec, 65 secs
lola: sara is running 70 secs || 107235 markings, 145101 edges, 1416 markings/sec, 70 secs
lola: sara is running 75 secs || 114471 markings, 155200 edges, 1447 markings/sec, 75 secs
lola: sara is running 80 secs || 121513 markings, 164731 edges, 1408 markings/sec, 80 secs
lola: sara is running 85 secs || 128586 markings, 174768 edges, 1415 markings/sec, 85 secs
lola: sara is running 90 secs || 135682 markings, 185141 edges, 1419 markings/sec, 90 secs
lola: sara is running 95 secs || 142887 markings, 195499 edges, 1441 markings/sec, 95 secs
lola: sara is running 100 secs || 150107 markings, 205582 edges, 1444 markings/sec, 100 secs
lola: sara is running 105 secs || 157550 markings, 214632 edges, 1489 markings/sec, 105 secs
lola: sara is running 110 secs || 164644 markings, 224512 edges, 1419 markings/sec, 110 secs
lola: sara is running 115 secs || 171685 markings, 234047 edges, 1408 markings/sec, 115 secs
lola: sara is running 120 secs || 178896 markings, 244289 edges, 1442 markings/sec, 120 secs
lola: sara is running 125 secs || 185952 markings, 253945 edges, 1411 markings/sec, 125 secs
lola: sara is running 130 secs || 193032 markings, 263841 edges, 1416 markings/sec, 130 secs
lola: sara is running 135 secs || 200254 markings, 274062 edges, 1444 markings/sec, 135 secs
lola: sara is running 140 secs || 207291 markings, 283513 edges, 1407 markings/sec, 140 secs
lola: sara is running 145 secs || 214356 markings, 294088 edges, 1413 markings/sec, 145 secs
lola: sara is running 150 secs || 221432 markings, 304656 edges, 1415 markings/sec, 150 secs
lola: sara is running 155 secs || 228683 markings, 314884 edges, 1450 markings/sec, 155 secs
lola: sara is running 160 secs || 235942 markings, 324858 edges, 1452 markings/sec, 160 secs
lola: sara is running 165 secs || 243192 markings, 334483 edges, 1450 markings/sec, 165 secs
lola: sara is running 170 secs || 250185 markings, 344087 edges, 1399 markings/sec, 170 secs
lola: sara is running 175 secs || 257333 markings, 354248 edges, 1430 markings/sec, 175 secs
lola: sara is running 180 secs || 264383 markings, 364614 edges, 1410 markings/sec, 180 secs
lola: sara is running 185 secs || 271772 markings, 372962 edges, 1478 markings/sec, 185 secs
lola: sara is running 190 secs || 279067 markings, 382447 edges, 1459 markings/sec, 190 secs
lola: sara is running 195 secs || 286088 markings, 392016 edges, 1404 markings/sec, 195 secs
lola: sara is running 200 secs || 293242 markings, 402276 edges, 1431 markings/sec, 200 secs
lola: sara is running 205 secs || 300479 markings, 412371 edges, 1447 markings/sec, 205 secs
lola: sara is running 210 secs || 307471 markings, 421641 edges, 1398 markings/sec, 210 secs
lola: sara is running 215 secs || 314646 markings, 431798 edges, 1435 markings/sec, 215 secs
lola: sara is running 220 secs || 321832 markings, 440086 edges, 1437 markings/sec, 220 secs
lola: sara is running 225 secs || 328924 markings, 450509 edges, 1418 markings/sec, 225 secs
lola: sara is running 230 secs || 336029 markings, 460939 edges, 1421 markings/sec, 230 secs
lola: sara is running 235 secs || 343166 markings, 469231 edges, 1427 markings/sec, 235 secs
lola: sara is running 240 secs || 350242 markings, 479898 edges, 1415 markings/sec, 240 secs
lola: sara is running 245 secs || 357290 markings, 490624 edges, 1410 markings/sec, 245 secs
lola: sara is running 250 secs || 364395 markings, 501237 edges, 1421 markings/sec, 250 secs
lola: sara is running 255 secs || 371634 markings, 510919 edges, 1448 markings/sec, 255 secs
lola: sara is running 260 secs || 378773 markings, 519505 edges, 1428 markings/sec, 260 secs
lola: sara is running 265 secs || 385801 markings, 530225 edges, 1406 markings/sec, 265 secs
lola: sara is running 270 secs || 392916 markings, 540239 edges, 1423 markings/sec, 270 secs
lola: sara is running 275 secs || 400026 markings, 549233 edges, 1422 markings/sec, 275 secs
lola: sara is running 280 secs || 407038 markings, 560314 edges, 1402 markings/sec, 280 secs
lola: sara is running 285 secs || 414242 markings, 570538 edges, 1441 markings/sec, 285 secs
lola: sara is running 290 secs || 421267 markings, 579955 edges, 1405 markings/sec, 290 secs
lola: sara is running 295 secs || 428335 markings, 590455 edges, 1414 markings/sec, 295 secs
lola: sara is running 300 secs || 435426 markings, 600466 edges, 1418 markings/sec, 300 secs
lola: sara is running 305 secs || 442640 markings, 610981 edges, 1443 markings/sec, 305 secs
lola: sara is running 310 secs || 449880 markings, 620731 edges, 1448 markings/sec, 310 secs
lola: sara is running 315 secs || 456852 markings, 630481 edges, 1394 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 stderr -----
----- Kill lola and sara stdout -----
----- 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="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="ReachabilityCardinality"
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-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-full"
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 r126-smll-152673528500250"
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 ;