About the Execution of Irma.full for Railroad-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 734.160 | 546728.00 | 1040648.00 | 1951.50 | TFTFTTFTTFFFTFTF | 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 5.3M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Railroad-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580700201
=====================================================================
--------------------
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 Railroad-PT-100-ReachabilityCardinality-00
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-01
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-02
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-03
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-04
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-05
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-06
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-07
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-08
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-09
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-10
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-11
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-12
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-13
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-14
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527153637370
BK_STOP 1527154184098
--------------------
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 Railroad-PT-100 as instance name.
Using Railroad as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 241642, 'Memory': 316.77, 'Tool': 'lola'}, {'Time': 243125, 'Memory': 250.97, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola Railroad-PT-100...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
Railroad-PT-100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
Railroad-PT-100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ Railroad-PT-100 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 11524/65536 symbol table entries, 3643 collisions
lola: preprocessing...
lola: finding significant places
lola: 1018 places, 10506 transitions, 407 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 612 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-100-ReachabilityCardinality.task
lola: A (G (((pl_P29_42 + 1 <= pl_P459_1) OR ((2 <= pl_P435_32) AND (pl_P387_1 <= pl_P218_57)) OR ((pl_P25_1 <= pl_P218_15) AND ((pl_P218_30 <= pl_P435_85) OR (1 <= pl_P435_45)))))) : A (G (((pl_P218_63 <= pl_P218_96) AND ((pl_P1_1 <= pl_P321_1) OR ((1 <= pl_P349_1) AND (pl_P498_1 <= pl_P401_1)))))) : A (G (((pl_P337_1 <= 2) OR (pl_P218_52 + 1 <= pl_P111_1) OR (1 <= pl_P435_13) OR (pl_P435_79 <= pl_P218_76) OR (2 <= pl_P494_1) OR (3 <= pl_P502_32)))) : E (F ((3 <= pl_P186_1))) : E (F (((pl_P166_1 <= 2) AND ((pl_P335_1 <= pl_P407_1) OR (pl_P29_37 <= pl_P133_1)) AND ((1 <= pl_P502_56) OR (pl_P476_1 <= pl_P179_1)) AND ((1 <= pl_P304_36) OR (2 <= pl_P335_1))))) : A (G ((pl_P502_69 <= pl_P29_96))) : E (F (((2 <= pl_P218_89) AND (3 <= pl_P387_1)))) : E (F ((((pl_P218_6 <= 2) AND (pl_P279_1 + 1 <= pl_P304_46)) OR (1 <= pl_P25_1)))) : E (F (((pl_P435_31 + 1 <= pl_P199_1) AND (pl_P502_3 <= 2) AND ((pl_P218_4 + 1 <= pl_P516_1) OR (pl_P68_1 + 1 <= pl_P486_1))))) : E (F (((2 <= pl_P435_16) AND (pl_P291_1 + 1 <= pl_P56_1)))) : E (F (((2 <= pl_P29_35) AND (3 <= pl_P502_66)))) : E (F ((3 <= pl_P435_23))) : E (F (((pl_P502_23 <= 0) AND (pl_P205_1 + 1 <= pl_P387_1) AND (pl_P15_1 + 1 <= pl_P49_1)))) : E (F (((2 <= pl_P433_1) AND (3 <= pl_P280_1) AND (pl_P502_74 <= 1) AND (pl_P413_1 <= 1)))) : A (G (((pl_P218_82 <= pl_P43_1) OR (pl_P260_1 + 1 <= pl_P308_1) OR ((pl_P190_1 + 1 <= pl_P130_1) AND (pl_P449_1 + 1 <= pl_P96_1))))) : E (F ((2 <= pl_P163_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P29_42 + 1 <= pl_P459_1) OR ((2 <= pl_P435_32) AND (pl_P387_1 <= pl_P218_57)) OR ((pl_P25_1 <= pl_P218_15) AND ((pl_P218_30 <= pl_P435_85) OR (1 <= pl_P435_45))))))
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 1628 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1265 markings, 1475 edges, 253 markings/sec, 0 secs
lola: sara is running 5 secs || 5147 markings, 6228 edges, 776 markings/sec, 5 secs
lola: sara is running 10 secs || 8854 markings, 10793 edges, 741 markings/sec, 10 secs
lola: sara is running 15 secs || 10967 markings, 13417 edges, 423 markings/sec, 15 secs
lola: sara is running 20 secs || 14686 markings, 18157 edges, 744 markings/sec, 20 secs
lola: sara is running 25 secs || 19559 markings, 24408 edges, 975 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 23866 markings, 30002 edges, 861 markings/sec, 30 secs
lola: sara is running 35 secs || 28525 markings, 36077 edges, 932 markings/sec, 35 secs
lola: sara is running 40 secs || 33008 markings, 41953 edges, 897 markings/sec, 40 secs
lola: sara is running 45 secs || 37747 markings, 47993 edges, 948 markings/sec, 45 secs
lola: sara is running 50 secs || 42387 markings, 53962 edges, 928 markings/sec, 50 secs
lola: sara is running 55 secs || 46317 markings, 59144 edges, 786 markings/sec, 55 secs
lola: sara is running 60 secs || 50445 markings, 64518 edges, 826 markings/sec, 60 secs
lola: sara is running 65 secs || 54633 markings, 70024 edges, 838 markings/sec, 65 secs
lola: sara is running 70 secs || 58832 markings, 75468 edges, 840 markings/sec, 70 secs
lola: sara is running 75 secs || 62907 markings, 80804 edges, 815 markings/sec, 75 secs
lola: sara is running 80 secs || 67295 markings, 86546 edges, 878 markings/sec, 80 secs
lola: sara is running 85 secs || 71146 markings, 91492 edges, 770 markings/sec, 85 secs
lola: sara is running 90 secs || 74982 markings, 96455 edges, 767 markings/sec, 90 secs
lola: sara is running 95 secs || 79484 markings, 102383 edges, 900 markings/sec, 95 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P218_63 <= pl_P218_96) AND ((pl_P1_1 <= pl_P321_1) OR ((1 <= pl_P349_1) AND (pl_P498_1 <= pl_P401_1))))))
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 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P337_1 <= 2) OR (pl_P218_52 + 1 <= pl_P111_1) OR (1 <= pl_P435_13) OR (pl_P435_79 <= pl_P218_76) OR (2 <= pl_P494_1) OR (3 <= pl_P502_32))))
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 1628 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 2417 markings, 2896 edges, 483 markings/sec, 0 secs
lola: sara is running 5 secs || 6534 markings, 7969 edges, 823 markings/sec, 5 secs
lola: sara is running 10 secs || 10523 markings, 13125 edges, 798 markings/sec, 10 secs
lola: sara is running 15 secs || 12538 markings, 15694 edges, 403 markings/sec, 15 secs
lola: sara is running 20 secs || 15334 markings, 19267 edges, 559 markings/sec, 20 secs
lola: sara is running 25 secs || 19792 markings, 25011 edges, 892 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 24300 markings, 30932 edges, 902 markings/sec, 30 secs
lola: sara is running 35 secs || 28733 markings, 36737 edges, 887 markings/sec, 35 secs
lola: sara is running 40 secs || 32994 markings, 42270 edges, 852 markings/sec, 40 secs
lola: sara is running 45 secs || 37340 markings, 47906 edges, 869 markings/sec, 45 secs
lola: sara is running 50 secs || 41718 markings, 53611 edges, 876 markings/sec, 50 secs
lola: sara is running 55 secs || 46123 markings, 59356 edges, 881 markings/sec, 55 secs
lola: sara is running 60 secs || 50609 markings, 65126 edges, 897 markings/sec, 60 secs
lola: sara is running 65 secs || 54964 markings, 70785 edges, 871 markings/sec, 65 secs
lola: sara is running 70 secs || 59526 markings, 76657 edges, 912 markings/sec, 70 secs
lola: sara is running 75 secs || 63751 markings, 82165 edges, 845 markings/sec, 75 secs
lola: sara is running 80 secs || 68335 markings, 88078 edges, 917 markings/sec, 80 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P186_1)))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 1035 markings, 1201 edges, 207 markings/sec, 0 secs
lola: sara is running 5 secs || 3876 markings, 4664 edges, 568 markings/sec, 5 secs
lola: sara is running 10 secs || 6943 markings, 8407 edges, 613 markings/sec, 10 secs
lola: sara is running 15 secs || 9009 markings, 10960 edges, 413 markings/sec, 15 secs
lola: sara is running 20 secs || 12710 markings, 15672 edges, 740 markings/sec, 20 secs
lola: sara is running 25 secs || 17683 markings, 22050 edges, 995 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 22362 markings, 28133 edges, 936 markings/sec, 30 secs
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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P166_1 <= 2) AND ((pl_P335_1 <= pl_P407_1) OR (pl_P29_37 <= pl_P133_1)) AND ((1 <= pl_P502_56) OR (pl_P476_1 <= pl_P179_1)) AND ((1 <= pl_P304_36) OR (2 <= pl_P335_1)))))
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 1628 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 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 74 markings, 73 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P502_69 <= pl_P29_96)))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 1462 markings, 1717 edges, 292 markings/sec, 0 secs
lola: sara is running 5 secs || 5162 markings, 6231 edges, 740 markings/sec, 5 secs
lola: sara is running 10 secs || 8505 markings, 10345 edges, 669 markings/sec, 10 secs
lola: sara is running 15 secs || 10704 markings, 13121 edges, 440 markings/sec, 15 secs
lola: sara is running 20 secs || 14204 markings, 17581 edges, 700 markings/sec, 20 secs
lola: sara is running 25 secs || 19158 markings, 23897 edges, 991 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 24185 markings, 30418 edges, 1005 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P218_89) AND (3 <= pl_P387_1))))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pl_P218_6 <= 2) AND (pl_P279_1 + 1 <= pl_P304_46)) OR (1 <= pl_P25_1))))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 94 markings, 93 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P435_31 + 1 <= pl_P199_1) AND (pl_P502_3 <= 2) AND ((pl_P218_4 + 1 <= pl_P516_1) OR (pl_P68_1 + 1 <= pl_P486_1)))))
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 1628 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P435_16) AND (pl_P291_1 + 1 <= pl_P56_1))))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 1248 markings, 1455 edges, 250 markings/sec, 0 secs
lola: sara is running 5 secs || 4846 markings, 5831 edges, 720 markings/sec, 5 secs
lola: sara is running 10 secs || 7501 markings, 9481 edges, 531 markings/sec, 10 secs
lola: sara is running 15 secs || 9784 markings, 12605 edges, 457 markings/sec, 15 secs
lola: sara is running 20 secs || 13819 markings, 18402 edges, 807 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 17834 markings, 24092 edges, 803 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P29_35) AND (3 <= pl_P502_66))))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 1133 markings, 1317 edges, 227 markings/sec, 0 secs
lola: sara is running 5 secs || 4018 markings, 4841 edges, 577 markings/sec, 5 secs
lola: sara is running 10 secs || 7627 markings, 9253 edges, 722 markings/sec, 10 secs
lola: sara is running 15 secs || 9789 markings, 11956 edges, 432 markings/sec, 15 secs
lola: sara is running 20 secs || 12598 markings, 15544 edges, 562 markings/sec, 20 secs
lola: sara is running 25 secs || 17170 markings, 21391 edges, 914 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 21641 markings, 27209 edges, 894 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P435_23)))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 1271 markings, 1480 edges, 254 markings/sec, 0 secs
lola: sara is running 5 secs || 4644 markings, 5610 edges, 675 markings/sec, 5 secs
lola: sara is running 10 secs || 8187 markings, 9952 edges, 709 markings/sec, 10 secs
lola: sara is running 15 secs || 10840 markings, 13297 edges, 531 markings/sec, 15 secs
lola: sara is running 20 secs || 12971 markings, 16019 edges, 426 markings/sec, 20 secs
lola: sara is running 25 secs || 17843 markings, 22266 edges, 974 markings/sec, 25 secs
lola: sara is running 30 secs || 22875 markings, 28804 edges, 1006 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 27625 markings, 35022 edges, 950 markings/sec, 35 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 789 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P502_23 <= 0) AND (pl_P205_1 + 1 <= pl_P387_1) AND (pl_P15_1 + 1 <= pl_P49_1))))
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 1628 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 Railroad-PT-100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1052 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P433_1) AND (3 <= pl_P280_1) AND (pl_P502_74 <= 1) AND (pl_P413_1 <= 1))))
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 1628 bytes per marking, with 0 unused bits
----- Kill lola and sara stderr -----
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 931 markings, 1074 edges, 186 markings/sec, 0 secs
lola: sara is running 5 secs || 4076 markings, 4908 edges, 629 markings/sec, 5 secs
lola: sara is running 10 secs || 7404 markings, 8971 edges, 666 markings/sec, 10 secs
lola: sara is running 15 secs || 9520 markings, 11614 edges, 423 markings/sec, 15 secs
lola: sara is running 20 secs || 13176 markings, 16322 edges, 731 markings/sec, 20 secs
lola: sara is running 25 secs || 17952 markings, 22400 edges, 955 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 22530 markings, 28271 edges, 916 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P218_82 <= pl_P43_1) OR (pl_P260_1 + 1 <= pl_P308_1) OR ((pl_P190_1 + 1 <= pl_P130_1) AND (pl_P449_1 + 1 <= pl_P96_1)))))
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 1628 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 1095 markings, 1272 edges, 219 markings/sec, 0 secs
lola: sara is running 5 secs || 4143 markings, 4989 edges, 610 markings/sec, 5 secs
lola: sara is running 10 secs || 7407 markings, 8970 edges, 653 markings/sec, 10 secs
lola: sara is running 15 secs || 9962 markings, 12116 edges, 511 markings/sec, 15 secs
lola: sara is running 20 secs || 13267 markings, 16303 edges, 661 markings/sec, 20 secs
lola: sara is running 25 secs || 18238 markings, 22720 edges, 994 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 22636 markings, 28386 edges, 880 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 15 will run for 3079 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pl_P163_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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 Railroad-PT-100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 1411 markings, 1658 edges, 282 markings/sec, 0 secs
lola: sara is running 5 secs || 4525 markings, 5459 edges, 623 markings/sec, 5 secs
lola: sara is running 10 secs || 7726 markings, 9375 edges, 640 markings/sec, 10 secs
lola: sara is running 15 secs || 10255 markings, 12546 edges, 506 markings/sec, 15 secs
lola: sara is running 20 secs || 13919 markings, 17240 edges, 733 markings/sec, 20 secs
lola: sara is running 25 secs || 18554 markings, 23178 edges, 927 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 22979 markings, 28945 edges, 885 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes no yes yes no no no yes no yes no
FORMULA Railroad-PT-100-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-15 FALSE 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="Railroad-PT-100"
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/Railroad-PT-100.tgz
mv Railroad-PT-100 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 Railroad-PT-100, 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 r138-qhx2-152673580700201"
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 ;