fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r067-smll-152649739600126
Last Updated
June 26, 2018

About the Execution of Irma.struct for DLCround-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5835.710 1021215.00 1961427.00 4296.10 TF?TTTTFTTTTTFTT 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.9M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DLCround-PT-11b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r067-smll-152649739600126
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526643052941


BK_STOP 1526644074156

--------------------
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 DLCround-PT-11b as instance name.
Using DLCround as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 120876, 'Memory': 2075.66, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola DLCround-PT-11b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DLCround-PT-11b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ DLCround-PT-11b @ 3539 seconds
----- 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: 11366/65536 symbol table entries, 3163 collisions
lola: preprocessing...
lola: finding significant places
lola: 4375 places, 6991 transitions, 4131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10066 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-11b-ReachabilityFireability.task
lola: E (F (FIREABLE(t3033))) : A (G (NOT FIREABLE(t2229))) : E (F (((FIREABLE(t6268) OR FIREABLE(t3703) OR (FIREABLE(t6710) AND FIREABLE(t3481)) OR (FIREABLE(t4139) AND NOT FIREABLE(t4652))) AND NOT FIREABLE(t2430)))) : E (F (FIREABLE(t5037))) : E (F (FIREABLE(t1368))) : E (F (((NOT FIREABLE(t6696) AND NOT FIREABLE(t1195) AND FIREABLE(t3618)) OR FIREABLE(t2037)))) : E (F ((FIREABLE(t4923) AND FIREABLE(t1789)))) : A (G ((FIREABLE(t2894) OR FIREABLE(t399) OR (NOT FIREABLE(t659) AND NOT FIREABLE(t5223))))) : E (F ((FIREABLE(t2512) AND (FIREABLE(t2698) OR (FIREABLE(t5998) AND FIREABLE(t3817))) AND FIREABLE(t2771)))) : E (F ((((FIREABLE(t58) OR FIREABLE(t5087)) AND FIREABLE(t229)) OR (FIREABLE(t4149) AND FIREABLE(t2872) AND (FIREABLE(t2991) OR FIREABLE(t3146))) OR FIREABLE(t3442)))) : E (F (((FIREABLE(t6302) OR FIREABLE(t1345)) AND (FIREABLE(t3217) OR FIREABLE(t2151)) AND (FIREABLE(t2735) OR FIREABLE(t6034) OR FIREABLE(t6850)) AND FIREABLE(t2933)))) : E (F ((FIREABLE(t1000) AND (NOT FIREABLE(t1809) OR (FIREABLE(t585) AND FIREABLE(t1366)) OR ((FIREABLE(t881) OR FIREABLE(t4674)) AND (FIREABLE(t514) OR FIREABLE(t1648))))))) : E (F (FIREABLE(t1313))) : A (G ((FIREABLE(t2450) OR (NOT FIREABLE(t1321) AND NOT FIREABLE(t6020)) OR FIREABLE(t168)))) : E (F (FIREABLE(t6714))) : E (F ((FIREABLE(t2319) AND (FIREABLE(t3003) OR FIREABLE(t6055)))))
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 (FIREABLE(t3033)))
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 520 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2229)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2368 markings, 2630 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t6268) OR FIREABLE(t3703) OR (FIREABLE(t6710) AND FIREABLE(t3481)) OR (FIREABLE(t4139) AND NOT FIREABLE(t4652))) AND NOT FIREABLE(t2430))))
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 520 bytes per marking, with 29 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 15 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-2.sara.
lola: sara is running 0 secs || 18602 markings, 24577 edges, 3720 markings/sec, 0 secs
lola: sara is running 5 secs || 38053 markings, 47291 edges, 3890 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 57733 markings, 70011 edges, 3936 markings/sec, 10 secs
lola: sara is running 15 secs || 77259 markings, 92522 edges, 3905 markings/sec, 15 secs
lola: sara is running 20 secs || 96781 markings, 115143 edges, 3904 markings/sec, 20 secs
lola: sara is running 25 secs || 116377 markings, 137869 edges, 3919 markings/sec, 25 secs
lola: sara is running 30 secs || 135449 markings, 160168 edges, 3814 markings/sec, 30 secs
lola: sara is running 35 secs || 155173 markings, 182959 edges, 3945 markings/sec, 35 secs
lola: sara is running 40 secs || 174580 markings, 205644 edges, 3881 markings/sec, 40 secs
lola: sara is running 45 secs || 194298 markings, 228687 edges, 3944 markings/sec, 45 secs
lola: sara is running 50 secs || 214106 markings, 251526 edges, 3962 markings/sec, 50 secs
lola: sara is running 55 secs || 233577 markings, 274417 edges, 3894 markings/sec, 55 secs
lola: sara is running 60 secs || 253318 markings, 297352 edges, 3948 markings/sec, 60 secs
lola: sara is running 65 secs || 273200 markings, 320372 edges, 3976 markings/sec, 65 secs
lola: sara is running 70 secs || 292685 markings, 343078 edges, 3897 markings/sec, 70 secs
lola: sara is running 75 secs || 311666 markings, 365074 edges, 3796 markings/sec, 75 secs
lola: sara is running 80 secs || 330520 markings, 387487 edges, 3771 markings/sec, 80 secs
lola: sara is running 85 secs || 349619 markings, 410071 edges, 3820 markings/sec, 85 secs
lola: sara is running 90 secs || 368517 markings, 439657 edges, 3780 markings/sec, 90 secs
lola: sara is running 95 secs || 387485 markings, 469730 edges, 3794 markings/sec, 95 secs
lola: sara is running 100 secs || 406492 markings, 491937 edges, 3801 markings/sec, 100 secs
lola: sara is running 105 secs || 425273 markings, 514752 edges, 3756 markings/sec, 105 secs
lola: sara is running 110 secs || 444221 markings, 537113 edges, 3790 markings/sec, 110 secs
lola: sara is running 115 secs || 463139 markings, 559086 edges, 3784 markings/sec, 115 secs
lola: sara is running 120 secs || 482078 markings, 581298 edges, 3788 markings/sec, 120 secs
lola: sara is running 125 secs || 501054 markings, 603363 edges, 3795 markings/sec, 125 secs
lola: sara is running 130 secs || 520083 markings, 625714 edges, 3806 markings/sec, 130 secs
lola: sara is running 135 secs || 539236 markings, 647919 edges, 3831 markings/sec, 135 secs
lola: sara is running 140 secs || 558238 markings, 671037 edges, 3800 markings/sec, 140 secs
lola: sara is running 145 secs || 577521 markings, 694065 edges, 3857 markings/sec, 145 secs
lola: sara is running 150 secs || 597202 markings, 718251 edges, 3936 markings/sec, 150 secs
lola: sara is running 155 secs || 616770 markings, 741638 edges, 3914 markings/sec, 155 secs
lola: sara is running 160 secs || 635872 markings, 764848 edges, 3820 markings/sec, 160 secs
lola: sara is running 165 secs || 655268 markings, 788198 edges, 3879 markings/sec, 165 secs
lola: sara is running 170 secs || 674617 markings, 810792 edges, 3870 markings/sec, 170 secs
lola: sara is running 175 secs || 693399 markings, 832924 edges, 3756 markings/sec, 175 secs
lola: sara is running 180 secs || 712031 markings, 856277 edges, 3726 markings/sec, 180 secs
lola: sara is running 185 secs || 730737 markings, 878499 edges, 3741 markings/sec, 185 secs
lola: sara is running 190 secs || 749607 markings, 900460 edges, 3774 markings/sec, 190 secs
lola: sara is running 195 secs || 768439 markings, 922257 edges, 3766 markings/sec, 195 secs
lola: sara is running 200 secs || 786935 markings, 944261 edges, 3699 markings/sec, 200 secs
lola: sara is running 205 secs || 806137 markings, 966444 edges, 3840 markings/sec, 205 secs
lola: sara is running 210 secs || 825596 markings, 989183 edges, 3892 markings/sec, 210 secs
lola: sara is running 215 secs || 844927 markings, 1012100 edges, 3866 markings/sec, 215 secs
lola: sara is running 220 secs || 864318 markings, 1035126 edges, 3878 markings/sec, 220 secs
lola: sara is running 225 secs || 883201 markings, 1057151 edges, 3777 markings/sec, 225 secs
lola: sara is running 230 secs || 902211 markings, 1079255 edges, 3802 markings/sec, 230 secs
lola: sara is running 235 secs || 921050 markings, 1101231 edges, 3768 markings/sec, 235 secs
lola: sara is running 240 secs || 939734 markings, 1123780 edges, 3737 markings/sec, 240 secs
lola: sara is running 245 secs || 958725 markings, 1154974 edges, 3798 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5037)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 443 markings, 442 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1368)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 183 markings, 182 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t6696) AND NOT FIREABLE(t1195) AND FIREABLE(t3618)) OR FIREABLE(t2037))))
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 520 bytes per marking, with 29 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 19687 markings, 23469 edges, 3937 markings/sec, 0 secs
lola: sara is running 5 secs || 38534 markings, 46103 edges, 3769 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 28)
lola: sara is running 10 secs || 58546 markings, 70009 edges, 4002 markings/sec, 10 secs
lola: sara is running 15 secs || 79300 markings, 95293 edges, 4151 markings/sec, 15 secs
lola: sara is running 20 secs || 99996 markings, 120493 edges, 4139 markings/sec, 20 secs
lola: sara is running 25 secs || 120565 markings, 145523 edges, 4114 markings/sec, 25 secs
lola: sara is running 30 secs || 141344 markings, 170842 edges, 4156 markings/sec, 30 secs
lola: sara is running 35 secs || 161963 markings, 195888 edges, 4124 markings/sec, 35 secs
lola: sara is running 40 secs || 182550 markings, 220951 edges, 4117 markings/sec, 40 secs
lola: sara is running 45 secs || 202773 markings, 245918 edges, 4045 markings/sec, 45 secs
lola: sara is running 50 secs || 220894 markings, 268675 edges, 3624 markings/sec, 50 secs
lola: sara is running 55 secs || 238872 markings, 292455 edges, 3596 markings/sec, 55 secs
lola: sara is running 60 secs || 257787 markings, 316428 edges, 3783 markings/sec, 60 secs
lola: sara is running 65 secs || 276707 markings, 340585 edges, 3784 markings/sec, 65 secs
lola: sara is running 70 secs || 295724 markings, 364585 edges, 3803 markings/sec, 70 secs
lola: sara is running 75 secs || 313923 markings, 387457 edges, 3640 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 331034 markings, 409860 edges
lola: ========================================
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4923) AND FIREABLE(t1789))))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 267 markings, 266 edges
lola: ========================================
lola: subprocess 7 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2894) OR FIREABLE(t399) OR (NOT FIREABLE(t659) AND NOT FIREABLE(t5223)))))
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 520 bytes per marking, with 29 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 895 markings, 946 edges
lola: ========================================
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2512) AND (FIREABLE(t2698) OR (FIREABLE(t5998) AND FIREABLE(t3817))) AND FIREABLE(t2771))))
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 520 bytes per marking, with 29 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 44160 markings, 49510 edges, 8832 markings/sec, 0 secs
lola: sara is running 5 secs || 86466 markings, 97106 edges, 8461 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 126248 markings, 142019 edges
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t58) OR FIREABLE(t5087)) AND FIREABLE(t229)) OR (FIREABLE(t4149) AND FIREABLE(t2872) AND (FIREABLE(t2991) OR FIREABLE(t3146))) OR FIREABLE(t3442))))
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 520 bytes per marking, with 29 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 12 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 54 markings, 53 edges
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t6302) OR FIREABLE(t1345)) AND (FIREABLE(t3217) OR FIREABLE(t2151)) AND (FIREABLE(t2735) OR FIREABLE(t6034) OR FIREABLE(t6850)) AND FIREABLE(t2933))))
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 520 bytes per marking, with 29 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 62 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3803 markings, 4197 edges
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1000) AND (NOT FIREABLE(t1809) OR (FIREABLE(t585) AND FIREABLE(t1366)) OR ((FIREABLE(t881) OR FIREABLE(t4674)) AND (FIREABLE(t514) OR FIREABLE(t1648)))))))
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 520 bytes per marking, with 29 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 19 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 372 markings, 371 edges
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1313)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 135 markings, 134 edges
lola: ========================================
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2450) OR (NOT FIREABLE(t1321) AND NOT FIREABLE(t6020)) OR FIREABLE(t168))))
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 520 bytes per marking, with 29 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 157 markings, 156 edges
lola: ========================================
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t6714)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 15 will run for 3187 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2319) AND (FIREABLE(t3003) OR FIREABLE(t6055)))))
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 520 bytes per marking, with 29 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 76519 markings, 85155 edges, 15304 markings/sec, 0 secs
lola: sara is running 5 secs || 148949 markings, 165927 edges, 14486 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 222910 markings, 248505 edges, 14792 markings/sec, 10 secs
sara: warning, failure of lp_solve (at job 40)
lola: sara is running 15 secs || 296371 markings, 330500 edges, 14692 markings/sec, 15 secs
lola: sara is running 20 secs || 369905 markings, 412647 edges, 14707 markings/sec, 20 secs
lola: sara is running 25 secs || 443391 markings, 494766 edges, 14697 markings/sec, 25 secs
lola: sara is running 30 secs || 516564 markings, 576372 edges, 14635 markings/sec, 30 secs
lola: sara is running 35 secs || 590063 markings, 658455 edges, 14700 markings/sec, 35 secs
lola: sara is running 40 secs || 663385 markings, 740480 edges, 14664 markings/sec, 40 secs
lola: sara is running 45 secs || 736778 markings, 822674 edges, 14679 markings/sec, 45 secs
lola: sara is running 50 secs || 809706 markings, 903954 edges, 14586 markings/sec, 50 secs
lola: sara is running 55 secs || 882773 markings, 985641 edges, 14613 markings/sec, 55 secs
lola: sara is running 60 secs || 955877 markings, 1067496 edges, 14621 markings/sec, 60 secs
lola: sara is running 65 secs || 1028072 markings, 1148126 edges, 14439 markings/sec, 65 secs
lola: sara is running 70 secs || 1101012 markings, 1229602 edges, 14588 markings/sec, 70 secs
lola: sara is running 75 secs || 1173473 markings, 1310519 edges, 14492 markings/sec, 75 secs
lola: sara is running 80 secs || 1246131 markings, 1391778 edges, 14532 markings/sec, 80 secs
lola: sara is running 85 secs || 1318267 markings, 1472267 edges, 14427 markings/sec, 85 secs
lola: sara is running 90 secs || 1391291 markings, 1553834 edges, 14605 markings/sec, 90 secs
lola: sara is running 95 secs || 1464421 markings, 1635533 edges, 14626 markings/sec, 95 secs
lola: sara is running 100 secs || 1537275 markings, 1716942 edges, 14571 markings/sec, 100 secs
lola: sara is running 105 secs || 1610196 markings, 1798296 edges, 14584 markings/sec, 105 secs
lola: sara is running 110 secs || 1683784 markings, 1880568 edges, 14718 markings/sec, 110 secs
lola: sara is running 115 secs || 1756171 markings, 1961429 edges, 14477 markings/sec, 115 secs
lola: sara is running 120 secs || 1829127 markings, 2042848 edges, 14591 markings/sec, 120 secs
lola: sara is running 125 secs || 1899614 markings, 2121294 edges, 14097 markings/sec, 125 secs
lola: sara is running 130 secs || 1972307 markings, 2202400 edges, 14539 markings/sec, 130 secs
lola: sara is running 135 secs || 2045067 markings, 2283514 edges, 14552 markings/sec, 135 secs
lola: sara is running 140 secs || 2117930 markings, 2364856 edges, 14573 markings/sec, 140 secs
lola: sara is running 145 secs || 2190818 markings, 2446211 edges, 14578 markings/sec, 145 secs
lola: sara is running 150 secs || 2264281 markings, 2528372 edges, 14693 markings/sec, 150 secs
lola: sara is running 155 secs || 2337050 markings, 2609645 edges, 14554 markings/sec, 155 secs
lola: sara is running 160 secs || 2410025 markings, 2691114 edges, 14595 markings/sec, 160 secs
lola: sara is running 165 secs || 2483007 markings, 2772609 edges, 14596 markings/sec, 165 secs
lola: sara is running 170 secs || 2555503 markings, 2853684 edges, 14499 markings/sec, 170 secs
lola: sara is running 175 secs || 2627510 markings, 2934032 edges, 14401 markings/sec, 175 secs
lola: sara is running 180 secs || 2699922 markings, 3014905 edges, 14482 markings/sec, 180 secs
lola: sara is running 185 secs || 2772962 markings, 3096498 edges, 14608 markings/sec, 185 secs
lola: sara is running 190 secs || 2845937 markings, 3178069 edges, 14595 markings/sec, 190 secs
lola: sara is running 195 secs || 2918712 markings, 3259255 edges, 14555 markings/sec, 195 secs
lola: sara is running 200 secs || 2991993 markings, 3341185 edges, 14656 markings/sec, 200 secs
lola: sara is running 205 secs || 3064316 markings, 3421975 edges, 14465 markings/sec, 205 secs
lola: sara is running 210 secs || 3137061 markings, 3503159 edges, 14549 markings/sec, 210 secs
lola: sara is running 215 secs || 3210263 markings, 3585029 edges, 14640 markings/sec, 215 secs
lola: sara is running 220 secs || 3282610 markings, 3665858 edges, 14469 markings/sec, 220 secs
lola: sara is running 225 secs || 3353105 markings, 3744341 edges, 14099 markings/sec, 225 secs
lola: sara is running 230 secs || 3424866 markings, 3824262 edges, 14352 markings/sec, 230 secs
lola: sara is running 235 secs || 3497863 markings, 3905753 edges, 14599 markings/sec, 235 secs
lola: sara is running 240 secs || 3570656 markings, 3986945 edges, 14559 markings/sec, 240 secs
lola: sara is running 245 secs || 3644105 markings, 4069004 edges, 14690 markings/sec, 245 secs
lola: sara is running 250 secs || 3717219 markings, 4150630 edges, 14623 markings/sec, 250 secs
lola: sara is running 255 secs || 3790688 markings, 4232804 edges, 14694 markings/sec, 255 secs
lola: sara is running 260 secs || 3863548 markings, 4314105 edges, 14572 markings/sec, 260 secs
lola: sara is running 265 secs || 3936685 markings, 4395754 edges, 14627 markings/sec, 265 secs
lola: sara is running 270 secs || 4010006 markings, 4477680 edges, 14664 markings/sec, 270 secs
lola: sara is running 275 secs || 4083041 markings, 4559318 edges, 14607 markings/sec, 275 secs
lola: sara is running 280 secs || 4156774 markings, 4641578 edges, 14747 markings/sec, 280 secs
lola: sara is running 285 secs || 4230947 markings, 4724493 edges, 14835 markings/sec, 285 secs
lola: sara is running 290 secs || 4303975 markings, 4806066 edges, 14606 markings/sec, 290 secs
lola: sara is running 295 secs || 4377661 markings, 4888328 edges, 14737 markings/sec, 295 secs
lola: sara is running 300 secs || 4451520 markings, 4970925 edges, 14772 markings/sec, 300 secs
lola: sara is running 305 secs || 4524482 markings, 5052436 edges, 14592 markings/sec, 305 secs
lola: sara is running 310 secs || 4597762 markings, 5134212 edges, 14656 markings/sec, 310 secs
lola: sara is running 315 secs || 4671516 markings, 5216661 edges, 14751 markings/sec, 315 secs
lola: sara is running 320 secs || 4744470 markings, 5298183 edges, 14591 markings/sec, 320 secs
lola: sara is running 325 secs || 4815620 markings, 5377440 edges, 14230 markings/sec, 325 secs
lola: sara is running 330 secs || 4886988 markings, 5456896 edges, 14274 markings/sec, 330 secs
lola: sara is running 335 secs || 4960137 markings, 5538529 edges, 14630 markings/sec, 335 secs
lola: sara is running 340 secs || 5032963 markings, 5619762 edges, 14565 markings/sec, 340 secs
lola: sara is running 345 secs || 5106252 markings, 5701604 edges, 14658 markings/sec, 345 secs
lola: sara is running 350 secs || 5179549 markings, 5783492 edges, 14659 markings/sec, 350 secs
lola: sara is running 355 secs || 5252776 markings, 5865331 edges, 14645 markings/sec, 355 secs
lola: sara is running 360 secs || 5325822 markings, 5946894 edges, 14609 markings/sec, 360 secs
lola: sara is running 365 secs || 5398856 markings, 6028419 edges, 14607 markings/sec, 365 secs
lola: sara is running 370 secs || 5472587 markings, 6110817 edges, 14746 markings/sec, 370 secs
lola: sara is running 375 secs || 5546147 markings, 6193037 edges, 14712 markings/sec, 375 secs
lola: sara is running 380 secs || 5619529 markings, 6274889 edges, 14676 markings/sec, 380 secs
lola: sara is running 385 secs || 5693441 markings, 6357535 edges, 14782 markings/sec, 385 secs
lola: sara is running 390 secs || 5766407 markings, 6439059 edges, 14593 markings/sec, 390 secs
lola: sara is running 395 secs || 5839854 markings, 6521015 edges, 14689 markings/sec, 395 secs
lola: sara is running 400 secs || 5913821 markings, 6603753 edges, 14793 markings/sec, 400 secs
lola: sara is running 405 secs || 5986673 markings, 6685106 edges, 14570 markings/sec, 405 secs
lola: sara is running 410 secs || 6060012 markings, 6766998 edges, 14668 markings/sec, 410 secs
lola: sara is running 415 secs || 6133146 markings, 6848653 edges, 14627 markings/sec, 415 secs
lola: sara is running 420 secs || 6205906 markings, 6930020 edges, 14552 markings/sec, 420 secs
lola: sara is running 425 secs || 6277309 markings, 7009582 edges, 14281 markings/sec, 425 secs
lola: sara is running 430 secs || 6348440 markings, 7088774 edges, 14226 markings/sec, 430 secs
lola: sara is running 435 secs || 6421858 markings, 7170712 edges, 14684 markings/sec, 435 secs
lola: sara is running 440 secs || 6494564 markings, 7251806 edges, 14541 markings/sec, 440 secs
lola: sara is running 445 secs || 6567761 markings, 7333537 edges, 14639 markings/sec, 445 secs
lola: sara is running 450 secs || 6640991 markings, 7415296 edges, 14646 markings/sec, 450 secs
lola: sara is running 455 secs || 6714211 markings, 7497104 edges, 14644 markings/sec, 455 secs
lola: sara is running 460 secs || 6786646 markings, 7578085 edges, 14487 markings/sec, 460 secs
lola: sara is running 465 secs || 6858726 markings, 7658478 edges, 14416 markings/sec, 465 secs
lola: sara is running 470 secs || 6931517 markings, 7739864 edges, 14558 markings/sec, 470 secs
lola: sara is running 475 secs || 7003368 markings, 7820145 edges, 14370 markings/sec, 475 secs
lola: sara is running 480 secs || 7074669 markings, 7899730 edges, 14260 markings/sec, 480 secs
lola: sara is running 485 secs || 7146075 markings, 7979556 edges, 14281 markings/sec, 485 secs
lola: sara is running 490 secs || 7217219 markings, 8059064 edges, 14229 markings/sec, 490 secs
lola: sara is running 495 secs || 7288528 markings, 8138627 edges, 14262 markings/sec, 495 secs
lola: sara is running 500 secs || 7360117 markings, 8218588 edges, 14318 markings/sec, 500 secs
lola: sara is running 505 secs || 7431549 markings, 8298466 edges, 14286 markings/sec, 505 secs
lola: sara is running 510 secs || 7502714 markings, 8377906 edges, 14233 markings/sec, 510 secs
lola: sara is running 515 secs || 7573985 markings, 8457458 edges, 14254 markings/sec, 515 secs
lola: sara is running 520 secs || 7645523 markings, 8537410 edges, 14308 markings/sec, 520 secs
lola: sara is running 525 secs || 7716386 markings, 8616575 edges, 14173 markings/sec, 525 secs
lola: sara is running 530 secs || 7787652 markings, 8696113 edges, 14253 markings/sec, 530 secs
lola: sara is running 535 secs || 7859371 markings, 8776331 edges, 14344 markings/sec, 535 secs
lola: sara is running 540 secs || 7930741 markings, 8856062 edges, 14274 markings/sec, 540 secs
lola: sara is running 545 secs || 8002560 markings, 8936234 edges, 14364 markings/sec, 545 secs
lola: sara is running 550 secs || 8073890 markings, 9015880 edges, 14266 markings/sec, 550 secs
lola: sara is running 555 secs || 8144979 markings, 9095390 edges, 14218 markings/sec, 555 secs
lola: sara is running 560 secs || 8215706 markings, 9174317 edges, 14145 markings/sec, 560 secs
lola: sara is running 565 secs || 8286663 markings, 9253533 edges, 14191 markings/sec, 565 secs
lola: sara is running 570 secs || 8357791 markings, 9333017 edges, 14226 markings/sec, 570 secs
lola: sara is running 575 secs || 8428522 markings, 9412095 edges, 14146 markings/sec, 575 secs
lola: sara is running 580 secs || 8498789 markings, 9490466 edges, 14053 markings/sec, 580 secs
lola: sara is running 585 secs || 8569716 markings, 9569780 edges, 14185 markings/sec, 585 secs
lola: sara is running 590 secs || 8639601 markings, 9647865 edges, 13977 markings/sec, 590 secs
lola: sara is running 595 secs || 8709815 markings, 9726231 edges, 14043 markings/sec, 595 secs
lola: sara is running 600 secs || 8780243 markings, 9804891 edges, 14086 markings/sec, 600 secs
lola: sara is running 605 secs || 8852019 markings, 9885180 edges, 14355 markings/sec, 605 secs
lola: sara is running 610 secs || 8923783 markings, 9965248 edges, 14353 markings/sec, 610 secs
lola: sara is running 615 secs || 8995960 markings, 10045877 edges, 14435 markings/sec, 615 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9046037 markings, 10101829 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown yes yes yes yes no yes yes yes yes yes no yes yes
FORMULA DLCround-PT-11b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-15 TRUE 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="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityFireability"
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/DLCround-PT-11b.tgz
mv DLCround-PT-11b 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 DLCround-PT-11b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r067-smll-152649739600126"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;