About the Execution of Irma.full for PolyORBLF-PT-S02J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6610.080 | 649502.00 | 1294762.00 | 2368.00 | ???????????????? | 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 1.6M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K 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 4.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 7.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K 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.7K 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 1.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S02J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528400166
=====================================================================
--------------------
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-S02J06T08-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526830445436
BK_STOP 1526831094938
--------------------
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-S02J06T08 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': 3100892, 'Memory': 8534.62, 'Tool': 'lola'}, {'Time': 3102973, 'Memory': 8713.55, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
ReachabilityCardinality lola PolyORBLF-PT-S02J06T08...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-PT-S02J06T08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-PT-S02J06T08: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PolyORBLF-PT-S02J06T08 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 2124/65536 symbol table entries, 10 collisions
lola: preprocessing...
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J06T08-ReachabilityCardinality.task
lola: E (F (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8)))) : E (F ((((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= 2) AND (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + 1 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8)) OR (NoSigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)))) : E (F (((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2) AND (1 <= P_1717)))) : E (F (((P_1716 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (2 <= NoSigAbort)))) : A (G (((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) AND (FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_7_5 + FetchJobE_7_6 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_8_5 + FetchJobE_8_6 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8)))) : E (F (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + 1 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8) AND (QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + 1 <= P_1099) AND (P_1716 <= 2)))) : A (G ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8))) : A (G ((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))) : A (G ((((3 <= FetchJobE_4_1) AND (3 <= DisablePollingB_3_1)) OR (NotifyEventJobQueuedB_8_5 <= 1) OR (((2 <= P_1155_3) OR (2 <= Perform_Work_E_4)) AND (2 <= NotifyEventJobQueuedB_7_1))))) : A (G ((NotifyEventJobQueuedB_6_0 <= RunE_2))) : A (G (((NotifyEventJobQueuedE_6 <= 1) AND (cIsMonitoring <= P_1160_7)))) : A (G (((1 <= NotifyEventJobQueuedE_8) OR (2 <= cIdleTasks) OR ((P_1724_0 <= 1) AND (NotifyEventSourceAddedE_4 <= 0))))) : A (G ((((Abort_Check_Sources_B_4 + 1 <= nyo_5) OR (P_1158_3 <= 2)) AND (FetchJobE_5_1 <= 1)))) : A (G (((NotifyEventJobQueuedB_4_0 <= ScheduleTaskE_Work_6_2) AND (TryAllocateOneTaskB_7 <= ScheduleTaskE_Work_8_1) AND (FetchJobE_5_3 <= ScheduleTaskE_Work_6_0) AND (ScheduleTaskE_Idle_4 <= Insert_Source_B_5_1) AND (ScheduleTaskE_Work_5_1 <= P_1155_7) AND (ScheduleTaskE_Work_3_3 <= P_1113_2)))) : E (F ((((DisablePollingE_5_2 <= 1) OR (NoSigAbort <= QueueJobB_6_4)) AND (3 <= Check_Sources_E_4)))) : A (G (((Insert_Source_E_2 + 1 <= RunE_8) OR (P_1159_7 <= 0) OR (ScheduleTaskE_Work_1_6 <= NotifyEventEndOfCheckSourcesE_2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourc... (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 2544 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= 2) AND (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + 1 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8)) OR (NoSigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_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 2544 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-S02J06T08-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 177 markings, 176 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + 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 2544 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-S02J06T08-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P_1716 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (2 <= NoSigAbort))))
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 2544 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-S02J06T08-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) AND (FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + Fet... (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 2544 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + 1 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8) AND (QueueJobE_1 + QueueJobE_2 + QueueJobE_3... (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 2544 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 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 93642 markings, 107807 edges, 18728 markings/sec, 0 secs
lola: sara is running 5 secs || 186607 markings, 215556 edges, 18593 markings/sec, 5 secs
lola: sara is running 10 secs || 279061 markings, 323149 edges, 18491 markings/sec, 10 secs
lola: sara is running 15 secs || 371616 markings, 431590 edges, 18511 markings/sec, 15 secs
lola: sara is running 20 secs || 464026 markings, 540727 edges, 18482 markings/sec, 20 secs
lola: sara is running 25 secs || 555983 markings, 648092 edges, 18391 markings/sec, 25 secs
lola: sara is running 30 secs || 647589 markings, 755567 edges, 18321 markings/sec, 30 secs
lola: sara is running 35 secs || 738806 markings, 863464 edges, 18243 markings/sec, 35 secs
lola: sara is running 40 secs || 830243 markings, 971298 edges, 18287 markings/sec, 40 secs
lola: sara is running 45 secs || 921397 markings, 1079122 edges, 18231 markings/sec, 45 secs
lola: sara is running 50 secs || 1012706 markings, 1187996 edges, 18262 markings/sec, 50 secs
lola: sara is running 55 secs || 1103724 markings, 1295448 edges, 18204 markings/sec, 55 secs
lola: sara is running 60 secs || 1194663 markings, 1403704 edges, 18188 markings/sec, 60 secs
lola: sara is running 65 secs || 1285680 markings, 1510663 edges, 18203 markings/sec, 65 secs
lola: sara is running 70 secs || 1376882 markings, 1618861 edges, 18240 markings/sec, 70 secs
lola: sara is running 75 secs || 1467715 markings, 1726549 edges, 18167 markings/sec, 75 secs
lola: sara is running 80 secs || 1558713 markings, 1833372 edges, 18200 markings/sec, 80 secs
lola: sara is running 85 secs || 1649474 markings, 1940710 edges, 18152 markings/sec, 85 secs
lola: sara is running 90 secs || 1738702 markings, 2045981 edges, 17846 markings/sec, 90 secs
lola: sara is running 95 secs || 1828041 markings, 2152071 edges, 17868 markings/sec, 95 secs
lola: sara is running 100 secs || 1918442 markings, 2259698 edges, 18080 markings/sec, 100 secs
lola: sara is running 105 secs || 2008238 markings, 2366496 edges, 17959 markings/sec, 105 secs
lola: sara is running 110 secs || 2098455 markings, 2473218 edges, 18043 markings/sec, 110 secs
lola: sara is running 115 secs || 2186782 markings, 2577182 edges, 17665 markings/sec, 115 secs
lola: sara is running 120 secs || 2276184 markings, 2684018 edges, 17880 markings/sec, 120 secs
lola: sara is running 125 secs || 2366866 markings, 2791894 edges, 18136 markings/sec, 125 secs
lola: sara is running 130 secs || 2456990 markings, 2899771 edges, 18025 markings/sec, 130 secs
lola: sara is running 135 secs || 2546390 markings, 3005620 edges, 17880 markings/sec, 135 secs
lola: sara is running 140 secs || 2636698 markings, 3112622 edges, 18062 markings/sec, 140 secs
lola: sara is running 145 secs || 2725265 markings, 3218908 edges, 17713 markings/sec, 145 secs
lola: sara is running 150 secs || 2812444 markings, 3324039 edges, 17436 markings/sec, 150 secs
lola: sara is running 155 secs || 2899184 markings, 3427426 edges, 17348 markings/sec, 155 secs
lola: sara is running 160 secs || 2985835 markings, 3530981 edges, 17330 markings/sec, 160 secs
lola: sara is running 165 secs || 3072731 markings, 3634390 edges, 17379 markings/sec, 165 secs
lola: sara is running 170 secs || 3159627 markings, 3738464 edges, 17379 markings/sec, 170 secs
lola: sara is running 175 secs || 3246013 markings, 3842647 edges, 17277 markings/sec, 175 secs
lola: sara is running 180 secs || 3334251 markings, 3948496 edges, 17648 markings/sec, 180 secs
lola: sara is running 185 secs || 3413814 markings, 4043485 edges, 15913 markings/sec, 185 secs
lola: sara is running 190 secs || 3498974 markings, 4145659 edges, 17032 markings/sec, 190 secs
lola: sara is running 195 secs || 3585558 markings, 4250645 edges, 17317 markings/sec, 195 secs
lola: sara is running 200 secs || 3672954 markings, 4355212 edges, 17479 markings/sec, 200 secs
lola: sara is running 205 secs || 3760726 markings, 4460190 edges, 17554 markings/sec, 205 secs
lola: sara is running 210 secs || 3848765 markings, 4564414 edges, 17608 markings/sec, 210 secs
lola: sara is running 215 secs || 3937035 markings, 4670015 edges, 17654 markings/sec, 215 secs
lola: sara is running 220 secs || 4025826 markings, 4776582 edges, 17758 markings/sec, 220 secs
lola: sara is running 225 secs || 4113790 markings, 4881597 edges, 17593 markings/sec, 225 secs
lola: sara is running 230 secs || 4201985 markings, 4987230 edges, 17639 markings/sec, 230 secs
lola: sara is running 235 secs || 4289730 markings, 5092211 edges, 17549 markings/sec, 235 secs
lola: sara is running 240 secs || 4370378 markings, 5187817 edges, 16130 markings/sec, 240 secs
lola: sara is running 245 secs || 4457697 markings, 5292175 edges, 17464 markings/sec, 245 secs
lola: sara is running 250 secs || 4543641 markings, 5395322 edges, 17189 markings/sec, 250 secs
lola: sara is running 255 secs || 4631574 markings, 5501490 edges, 17587 markings/sec, 255 secs
lola: sara is running 260 secs || 4719399 markings, 5606925 edges, 17565 markings/sec, 260 secs
lola: sara is running 265 secs || 4805550 markings, 5709958 edges, 17230 markings/sec, 265 secs
lola: sara is running 270 secs || 4891964 markings, 5814684 edges, 17283 markings/sec, 270 secs
lola: sara is running 275 secs || 4979996 markings, 5918780 edges, 17606 markings/sec, 275 secs
lola: sara is running 280 secs || 5067928 markings, 6023156 edges, 17586 markings/sec, 280 secs
lola: sara is running 285 secs || 5155916 markings, 6128283 edges, 17598 markings/sec, 285 secs
lola: sara is running 290 secs || 5243624 markings, 6233166 edges, 17542 markings/sec, 290 secs
lola: sara is running 295 secs || 5331452 markings, 6337413 edges, 17566 markings/sec, 295 secs
lola: sara is running 300 secs || 5419039 markings, 6441976 edges, 17517 markings/sec, 300 secs
lola: sara is running 305 secs || 5506910 markings, 6546458 edges, 17574 markings/sec, 305 secs
lola: sara is running 310 secs || 5594463 markings, 6651246 edges, 17511 markings/sec, 310 secs
lola: sara is running 315 secs || 5682015 markings, 6755567 edges, 17510 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: A (G ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)))
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 2544 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-S02J06T08-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 80927 markings, 97529 edges, 16185 markings/sec, 0 secs
lola: sara is running 5 secs || 163950 markings, 199717 edges, 16605 markings/sec, 5 secs
lola: sara is running 10 secs || 243338 markings, 298219 edges, 15878 markings/sec, 10 secs
lola: sara is running 15 secs || 320806 markings, 393606 edges, 15494 markings/sec, 15 secs
lola: sara is running 20 secs || 398413 markings, 488433 edges, 15521 markings/sec, 20 secs
lola: sara is running 25 secs || 475498 markings, 583235 edges, 15417 markings/sec, 25 secs
lola: sara is running 30 secs || 552681 markings, 679168 edges, 15437 markings/sec, 30 secs
lola: sara is running 35 secs || 629433 markings, 774781 edges, 15350 markings/sec, 35 secs
lola: sara is running 40 secs || 706016 markings, 870547 edges, 15317 markings/sec, 40 secs
lola: sara is running 45 secs || 782593 markings, 964872 edges, 15315 markings/sec, 45 secs
lola: sara is running 50 secs || 859111 markings, 1059456 edges, 15304 markings/sec, 50 secs
lola: sara is running 55 secs || 935575 markings, 1156440 edges, 15293 markings/sec, 55 secs
lola: sara is running 60 secs || 1011813 markings, 1251147 edges, 15248 markings/sec, 60 secs
lola: sara is running 65 secs || 1088169 markings, 1345580 edges, 15271 markings/sec, 65 secs
lola: sara is running 70 secs || 1164214 markings, 1440886 edges, 15209 markings/sec, 70 secs
lola: sara is running 75 secs || 1240425 markings, 1535606 edges, 15242 markings/sec, 75 secs
lola: sara is running 80 secs || 1316525 markings, 1629712 edges, 15220 markings/sec, 80 secs
----- Kill lola and sara stderr -----
lola: sara is running 85 secs || 1392529 markings, 1724291 edges, 15201 markings/sec, 85 secs
lola: sara is running 90 secs || 1468439 markings, 1819309 edges, 15182 markings/sec, 90 secs
lola: sara is running 95 secs || 1544351 markings, 1913311 edges, 15182 markings/sec, 95 secs
lola: sara is running 100 secs || 1620175 markings, 2007937 edges, 15165 markings/sec, 100 secs
lola: sara is running 105 secs || 1695669 markings, 2103223 edges, 15099 markings/sec, 105 secs
lola: sara is running 110 secs || 1771612 markings, 2197011 edges, 15189 markings/sec, 110 secs
lola: sara is running 115 secs || 1846988 markings, 2290270 edges, 15075 markings/sec, 115 secs
lola: sara is running 120 secs || 1922596 markings, 2384730 edges, 15122 markings/sec, 120 secs
lola: sara is running 125 secs || 1997876 markings, 2478920 edges, 15056 markings/sec, 125 secs
lola: sara is running 130 secs || 2073377 markings, 2573565 edges, 15100 markings/sec, 130 secs
lola: sara is running 135 secs || 2148843 markings, 2667184 edges, 15093 markings/sec, 135 secs
lola: sara is running 140 secs || 2224149 markings, 2760894 edges, 15061 markings/sec, 140 secs
lola: sara is running 145 secs || 2299410 markings, 2855285 edges, 15052 markings/sec, 145 secs
lola: sara is running 150 secs || 2374804 markings, 2949485 edges, 15079 markings/sec, 150 secs
lola: sara is running 155 secs || 2450130 markings, 3043487 edges, 15065 markings/sec, 155 secs
lola: sara is running 160 secs || 2528140 markings, 3139992 edges, 15602 markings/sec, 160 secs
lola: sara is running 165 secs || 2605721 markings, 3237590 edges, 15516 markings/sec, 165 secs
lola: sara is running 170 secs || 2682379 markings, 3333866 edges, 15332 markings/sec, 170 secs
lola: sara is running 175 secs || 2760777 markings, 3433202 edges, 15680 markings/sec, 175 secs
lola: sara is running 180 secs || 2839753 markings, 3532037 edges, 15795 markings/sec, 180 secs
lola: sara is running 185 secs || 2917399 markings, 3630216 edges, 15529 markings/sec, 185 secs
lola: sara is running 190 secs || 2995378 markings, 3728118 edges, 15596 markings/sec, 190 secs
lola: sara is running 195 secs || 3074047 markings, 3826913 edges, 15734 markings/sec, 195 secs
lola: sara is running 200 secs || 3153107 markings, 3926437 edges, 15812 markings/sec, 200 secs
lola: sara is running 205 secs || 3231734 markings, 4025002 edges, 15725 markings/sec, 205 secs
lola: sara is running 210 secs || 3310101 markings, 4124445 edges, 15673 markings/sec, 210 secs
lola: sara is running 215 secs || 3388637 markings, 4223129 edges, 15707 markings/sec, 215 secs
lola: sara is running 220 secs || 3467660 markings, 4322630 edges, 15805 markings/sec, 220 secs
lola: sara is running 225 secs || 3546271 markings, 4422049 edges, 15722 markings/sec, 225 secs
lola: sara is running 230 secs || 3624819 markings, 4520482 edges, 15710 markings/sec, 230 secs
lola: sara is running 235 secs || 3703329 markings, 4617937 edges, 15702 markings/sec, 235 secs
lola: sara is running 240 secs || 3781619 markings, 4715732 edges, 15658 markings/sec, 240 secs
lola: sara is running 245 secs || 3860335 markings, 4813715 edges, 15743 markings/sec, 245 secs
lola: sara is running 250 secs || 3939088 markings, 4911610 edges, 15751 markings/sec, 250 secs
lola: sara is running 255 secs || 4017726 markings, 5011124 edges, 15728 markings/sec, 255 secs
lola: sara is running 260 secs || 4096227 markings, 5108988 edges, 15700 markings/sec, 260 secs
lola: sara is running 265 secs || 4174845 markings, 5208049 edges, 15724 markings/sec, 265 secs
lola: sara is running 270 secs || 4252996 markings, 5306432 edges, 15630 markings/sec, 270 secs
lola: sara is running 275 secs || 4331356 markings, 5404344 edges, 15672 markings/sec, 275 secs
lola: sara is running 280 secs || 4409746 markings, 5504011 edges, 15678 markings/sec, 280 secs
lola: sara is running 285 secs || 4488204 markings, 5602725 edges, 15692 markings/sec, 285 secs
lola: sara is running 290 secs || 4566447 markings, 5700556 edges, 15649 markings/sec, 290 secs
lola: sara is running 295 secs || 4644888 markings, 5798608 edges, 15688 markings/sec, 295 secs
lola: sara is running 300 secs || 4723416 markings, 5896692 edges, 15706 markings/sec, 300 secs
lola: sara is running 305 secs || 4801762 markings, 5994772 edges, 15669 markings/sec, 305 secs
lola: sara is running 310 secs || 4880936 markings, 6091217 edges, 15835 markings/sec, 310 secs
lola: sara is running 315 secs || 4959130 markings, 6189581 edges, 15639 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-S02J06T08-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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-S02J06T08"
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-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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-S02J06T08, 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-152673528400166"
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 ;