## About the Execution of LoLA for Dekker-PT-015

Execution Summary | |||||

Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |

4264.140 | 28230.00 | 5848.00 | 20.00 | FTTTFFFFFTTTTTTT | normal |

## Execution Chart

We display below the execution chart for this examination (boot time has been removed).

## Trace from the execution

Formatting '/data/fko/mcc2019-input.r049-oct2-155234405800864.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16

Waiting for the VM to be ready (probing ssh)

.................

=====================================================================

Generated by BenchKit 2-3954

Executing tool lola

Input is Dekker-PT-015, examination is ReachabilityFireability

Time confinement is 3600 seconds

Memory confinement is 16384 MBytes

Number of cores is 4

Run identifier is r049-oct2-155234405800864

=====================================================================

--------------------

preparation of the directory to be used:

/home/mcc/execution

total 308K

-rw-r--r-- 1 mcc users 3.3K Feb 10 20:40 CTLCardinality.txt

-rw-r--r-- 1 mcc users 19K Feb 10 20:40 CTLCardinality.xml

-rw-r--r-- 1 mcc users 3.2K Feb 6 16:47 CTLFireability.txt

-rw-r--r-- 1 mcc users 19K Feb 6 16:47 CTLFireability.xml

-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml

-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml

-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt

-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml

-rw-r--r-- 1 mcc users 2.3K Feb 4 23:28 LTLCardinality.txt

-rw-r--r-- 1 mcc users 11K Feb 4 23:28 LTLCardinality.xml

-rw-r--r-- 1 mcc users 2.0K Feb 4 22:34 LTLFireability.txt

-rw-r--r-- 1 mcc users 8.6K Feb 4 22:34 LTLFireability.xml

-rw-r--r-- 1 mcc users 3.3K Feb 3 06:52 ReachabilityCardinality.txt

-rw-r--r-- 1 mcc users 17K Feb 3 06:52 ReachabilityCardinality.xml

-rw-r--r-- 1 mcc users 3.5K Jan 30 23:21 ReachabilityFireability.txt

-rw-r--r-- 1 mcc users 20K Jan 30 23:21 ReachabilityFireability.xml

-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt

-rw-r--r-- 1 mcc users 3.6K Feb 4 22:19 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col

-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored

-rw-r--r-- 1 mcc users 139K Mar 10 17:31 model.pnml

--------------------

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 Dekker-PT-015-ReachabilityFireability-00

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-01

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-02

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-03

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-04

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-05

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-06

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-07

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-08

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-09

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-10

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-11

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-12

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-13

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-14

FORMULA_NAME Dekker-PT-015-ReachabilityFireability-15

=== Now, execution of the tool begins

**BK_START 1552491769976
**

info: Time: 3600 - MCC

vrfy: Checking ReachabilityFireability @ Dekker-PT-015 @ 3569 seconds

**FORMULA Dekker-PT-015-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

**FORMULA Dekker-PT-015-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
**

vrfy: finished

info: timeLeft: 3540

rslt: Output for ReachabilityFireability @ Dekker-PT-015

{

"build":

{

"architecture": 64,

"assertions": false,

"build_hostname": "mcc2019",

"build_system": "x86_64-unknown-linux-gnu",

"optimizations": true,

"package_version": "2.0",

"svn_version": "3189M"

},

"call":

{

"exec_host": "mcc2019",

"markinglimit": null,

"parameters":

[

"--pnmlnet",

"model.pnml",

"--xmlformula",

"--formula=ReachabilityFireability.xml",

"--mcc",

"--donotcomputecapacities",

"--encoder=simplecompressed",

"--safe",

"--check=modelchecking",

"--stubborn=tarjan",

"--stateequation=par",

"--timelimit=3569",

"--localtimelimit=0",

"--json=ReachabilityFireability.json",

"--jsoninclude=formula,formulastat,net"

],

"starttime": "Wed Mar 13 15:42:50 2019

",

"timelimit": 3569

},

"child":

[

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 222

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 0,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 2,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 2,

"unfir": 0,

"visible_places": 0,

"visible_transitions": 2

},

"processed": "E (F ((FIREABLE(withdraw_11_4) AND FIREABLE(withdraw_5_14))))",

"processed_size": 61,

"rewrites": 1

},

"result":

{

"edges": 4,

"markings": 5,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 0,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 6,

"problems": 6

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 237

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 1,

"E": 0,

"F": 0,

"G": 1,

"U": 0,

"X": 0,

"aconj": 0,

"adisj": 1,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 0,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 2,

"unfir": 2,

"visible_places": 0,

"visible_transitions": 2

},

"processed": "A (G ((NOT FIREABLE(withdraw_4_10) OR NOT FIREABLE(exit_13))))",

"processed_size": 63,

"rewrites": 2

},

"result":

{

"edges": 7813,

"markings": 1507,

"produced_by": "state space",

"value": false

},

"task":

{

"compoundnumber": 1,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 5,

"problems": 5

},

"type": "invariance",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 254

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 0,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 3,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 3,

"unfir": 0,

"visible_places": 0,

"visible_transitions": 3

},

"processed": "E (F ((FIREABLE(withdraw_3_1) AND FIREABLE(withdraw_8_13) AND FIREABLE(try_2))))",

"processed_size": 80,

"rewrites": 1

},

"result":

{

"edges": 4,

"markings": 5,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 2,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 8,

"problems": 8

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 274

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 1,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 3,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 3,

"unfir": 0,

"visible_places": 0,

"visible_transitions": 3

},

"processed": "E (F ((FIREABLE(withdraw_12_1) AND (FIREABLE(exit_8) OR FIREABLE(enter_8)))))",

"processed_size": 78,

"rewrites": 1

},

"result":

{

"edges": 141,

"markings": 61,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 3,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 23,

"problems": 2

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 297

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 1,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 3,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 3,

"unfir": 0,

"visible_places": 0,

"visible_transitions": 3

},

"processed": "E (F ((FIREABLE(withdraw_11_4) AND (FIREABLE(withdraw_0_10) OR FIREABLE(enter_3)))))",

"processed_size": 85,

"rewrites": 1

},

"result":

{

"edges": 4,

"markings": 5,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 4,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 24,

"problems": 2

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 324

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 0,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 3,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 4,

"unfir": 1,

"visible_places": 0,

"visible_transitions": 4

},

"processed": "E (F ((FIREABLE(withdraw_0_3) AND FIREABLE(withdraw_12_14) AND NOT FIREABLE(withdraw_0_2) AND FIREABLE(withdraw_2_8))))",

"processed_size": 119,

"rewrites": 1

},

"result":

{

"produced_by": "state equation",

"value": false

},

"task":

{

"compoundnumber": 5,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 0,

"problems": 0

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 356

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 0,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 3,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 4,

"unfir": 1,

"visible_places": 0,

"visible_transitions": 4

},

"processed": "E (F ((FIREABLE(try_3) AND FIREABLE(exit_6) AND FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_11_8))))",

"processed_size": 107,

"rewrites": 1

},

"result":

{

"edges": 11,

"markings": 9,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 6,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 16,

"problems": 2

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 396

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 1,

"E": 0,

"F": 0,

"G": 1,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 3,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 0,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 5,

"unfir": 5,

"visible_places": 0,

"visible_transitions": 5

},

"processed": "A (G ((NOT FIREABLE(enter_12) OR ((NOT FIREABLE(withdraw_1_13) OR NOT FIREABLE(try_14)) AND (NOT FIREABLE(withdraw_9_6) OR NOT FIREABLE(withdraw_5_6))))))",

"processed_size": 157,

"rewrites": 2

},

"result":

{

"produced_by": "state equation",

"value": true

},

"task":

{

"compoundnumber": 7,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 41,

"problems": 2

},

"type": "invariance",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 445

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 1,

"E": 0,

"F": 0,

"G": 1,

"U": 0,

"X": 0,

"aconj": 0,

"adisj": 1,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 1,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 5,

"unfir": 4,

"visible_places": 0,

"visible_transitions": 5

},

"processed": "A (G ((NOT FIREABLE(withdraw_0_3) OR NOT FIREABLE(try_5) OR NOT FIREABLE(withdraw_2_11) OR NOT FIREABLE(exit_11) OR FIREABLE(withdraw_13_3))))",

"processed_size": 146,

"rewrites": 2

},

"result":

{

"produced_by": "state equation",

"value": false

},

"task":

{

"compoundnumber": 8,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 22,

"problems": 2

},

"type": "invariance",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 509

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 1,

"E": 0,

"F": 0,

"G": 1,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 2,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 0,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 5,

"unfir": 5,

"visible_places": 0,

"visible_transitions": 5

},

"processed": "A (G ((NOT FIREABLE(withdraw_5_14) OR NOT FIREABLE(withdraw_5_1) OR (NOT FIREABLE(withdraw_7_3) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(try_12))))))",

"processed_size": 161,

"rewrites": 2

},

"result":

{

"edges": 5,

"markings": 6,

"produced_by": "state space",

"value": false

},

"task":

{

"compoundnumber": 9,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 20,

"problems": 2

},

"type": "invariance",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 594

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 3,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 5,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 7,

"unfir": 2,

"visible_places": 0,

"visible_transitions": 7

},

"processed": "E (F (((FIREABLE(withdraw_12_7) OR FIREABLE(withdraw_13_9)) AND (FIREABLE(withdraw_2_1) OR FIREABLE(withdraw_12_10)) AND (NOT FIREABLE(withdraw_9_13) OR NOT FIREABLE(withdraw_8_13)) AND FIREABLE(withdraw_0_3))))",

"processed_size": 214,

"rewrites": 1

},

"result":

{

"edges": 6,

"markings": 7,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 10,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 180,

"problems": 18

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 713

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 2,

"adisj": 1,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 6,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 8,

"unfir": 2,

"visible_places": 0,

"visible_transitions": 8

},

"processed": "E (F ((FIREABLE(withdraw_11_5) AND FIREABLE(withdraw_7_13) AND NOT FIREABLE(withdraw_9_6) AND FIREABLE(withdraw_1_9) AND ((FIREABLE(exit_8) AND FIREABLE(withdraw_1_8)) OR NOT FIREABLE(withdraw_0_8) OR FIREABLE(withdraw_8_6)))))",

"processed_size": 229,

"rewrites": 1

},

"result":

{

"edges": 6,

"markings": 7,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 11,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 109,

"problems": 9

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 891

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 1,

"E": 0,

"F": 0,

"G": 1,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 2,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 5,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 8,

"unfir": 3,

"visible_places": 0,

"visible_transitions": 8

},

"processed": "A (G ((FIREABLE(try_9) OR FIREABLE(withdraw_14_3) OR NOT FIREABLE(withdraw_4_1) OR NOT FIREABLE(withdraw_3_8) OR ((FIREABLE(withdraw_4_3) OR FIREABLE(exit_12) OR NOT FIREABLE(withdraw_10_8)) AND FIREABLE(exit_10)))))",

"processed_size": 222,

"rewrites": 2

},

"result":

{

"edges": 5,

"markings": 6,

"produced_by": "state space",

"value": false

},

"task":

{

"compoundnumber": 12,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"type": "invariance",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 1188

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 1,

"E": 0,

"F": 0,

"G": 1,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 2,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 5,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 9,

"unfir": 4,

"visible_places": 0,

"visible_transitions": 9

},

"processed": "A (G ((NOT FIREABLE(withdraw_9_7) OR NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(try_14) OR NOT FIREABLE(withdraw_2_11) OR (FIREABLE(withdraw_8_3) AND (FIREABLE(exit_1) OR FIREABLE(withdraw_3_11) OR FIREABLE(enter_8) OR FIREABLE(exit_13))))))",

"processed_size": 249,

"rewrites": 2

},

"result":

{

"edges": 5,

"markings": 6,

"produced_by": "state space",

"value": false

},

"task":

{

"compoundnumber": 13,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"type": "invariance",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 1782

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 2,

"adisj": 4,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 9,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 9,

"unfir": 0,

"visible_places": 0,

"visible_transitions": 9

},

"processed": "E (F (((FIREABLE(enter_7) AND (FIREABLE(withdraw_1_13) OR FIREABLE(withdraw_11_5))) OR ((FIREABLE(withdraw_9_3) OR FIREABLE(try_3)) AND (FIREABLE(withdraw_10_4) OR FIREABLE(withdraw_2_0)) AND FIREABLE(withdraw_4_11) AND FIREABLE(withdraw_10_5)))))",

"processed_size": 251,

"rewrites": 1

},

"result":

{

"edges": 28,

"markings": 13,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 14,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 82,

"problems": 6

},

"type": "reachability",

"workflow": "stateequation||search"

}

},

{

"call":

{

"dynamic_timelimit": true,

"localtimelimit": 3565

},

"exit":

{

"localtimelimitreached": false

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 4,

"adisj": 3,

"aneg": 0,

"comp": 0,

"cont": 0,

"dl": 0,

"fir": 12,

"nodl": 0,

"place_references": 0,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 13,

"unfir": 1,

"visible_places": 0,

"visible_transitions": 12

},

"processed": "E (F ((FIREABLE(withdraw_11_2) AND FIREABLE(withdraw_13_7) AND (FIREABLE(withdraw_8_14) OR FIREABLE(withdraw_7_12)) AND ((FIREABLE(withdraw_1_8) AND FIREABLE(withdraw_9_2)) OR FIREABLE(withdraw_11_4)) AND ((FIREABLE(try_2) AND FIREABLE(withdraw_10_3)) OR FIREABLE(withdraw_1_10) OR (FIREABLE(withdraw_1_2) AND FIREABLE(withdraw_8_9) AND NOT FIREABLE(withdraw_11_4))))))",

"processed_size": 373,

"rewrites": 1

},

"result":

{

"edges": 8,

"markings": 9,

"produced_by": "state space",

"value": true

},

"task":

{

"compoundnumber": 15,

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 184,

"problems": 10

},

"type": "reachability",

"workflow": "stateequation||search"

}

}

],

"exit":

{

"error": null,

"memory": 16768,

"runtime": 4.000000,

"signal": null,

"timelimitreached": false

},

"files":

{

"formula": "ReachabilityFireability.xml",

"net": "model.pnml"

},

"formula":

{

"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**))"

},

"net":

{

"arcs": 1830,

"conflict_clusters": 1,

"places": 75,

"places_significant": 30,

"singleton_clusters": 0,

"transitions": 255

},

"result":

{

"preliminary_value": "no yes yes yes no no no no no yes yes yes yes yes yes yes ",

"value": "no yes yes yes no no no no no yes yes yes yes yes yes yes "

},

"task":

{

"type": "compound"

}

}

lola: LoLA will run for 3569 seconds at most (--timelimit)

lola: NET

lola: input: PNML file (--pnml)

lola: reading net from model.pnml

lola: reading pnml

lola: PNML file contains place/transition net

lola: finished parsing

lola: closed net file model.pnml

lola: 330/268435456 symbol table entries, 0 collisions

lola: preprocessing...

lola: Size of bit vector: 75

lola: finding significant places

lola: 75 places, 255 transitions, 30 significant places

lola: compute conflict clusters

lola: computed conflict clusters

lola: Computing conflicting sets

lola: Computing back conflicting sets

lola: TASK

lola: Reading formula in XML format (--xmlformula)

lola: reading pnml

lola: reading formula from ReachabilityFireability.xml

lola: A (G ((NOT FIREABLE(withdraw_5_14) OR NOT FIREABLE(withdraw_5_1) OR (NOT FIREABLE(withdraw_7_3) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(try_12)))))) : E (F (((FIREABLE(enter_7) AND (FIREABLE(withdraw_1_13) OR FIREABLE(withdraw_11_5))) OR ((FIREABLE(withdraw_9_3) OR FIREABLE(try_3)) AND (FIREABLE(withdraw_10_4) OR FIREABLE(withdraw_2_0)) AND FIREABLE(withdraw_4_11) AND FIREABLE(withdraw_10_5))))) : E (F ((FIREABLE(withdraw_11_2) AND FIREABLE(withdraw_13_7) AND (FIREABLE(withdraw_8_14) OR FIREABLE(withdraw_7_12)) AND ((FIREABLE(withdraw_1_8) AND FIREABLE(withdraw_9_2)) OR FIREABLE(withdraw_11_4)) AND ((FIREABLE(try_2) AND FIREABLE(withdraw_10_3)) OR FIREABLE(withdraw_1_10) OR (FIREABLE(withdraw_1_2) AND FIREABLE(withdraw_8_9) AND NOT FIREABLE(withdraw_11_4)))))) : E (F ((FIREABLE(withdraw_11_4) AND FIREABLE(withdraw_5_14)))) : A (G ((NOT FIREABLE(withdraw_4_10) OR NOT FIREABLE(exit_13)))) : A (G ((FIREABLE(try_9) OR FIREABLE(withdraw_14_3) OR NOT FIREABLE(withdraw_4_1) OR NOT FIREABLE(withdraw_3_8) OR ((FIREABLE(withdraw_4_3) OR FIREABLE(exit_12) OR NOT FIREABLE(withdraw_10_8)) AND FIREABLE(exit_10))))) : A (G ((NOT FIREABLE(withdraw_0_3) OR NOT FIREABLE(try_5) OR NOT FIREABLE(withdraw_2_11) OR NOT FIREABLE(exit_11) OR FIREABLE(withdraw_13_3)))) : E (F ((FIREABLE(withdraw_0_3) AND FIREABLE(withdraw_12_14) AND NOT FIREABLE(withdraw_0_2) AND FIREABLE(withdraw_2_8)))) : A (G ((NOT FIREABLE(withdraw_9_7) OR NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(try_14) OR NOT FIREABLE(withdraw_2_11) OR (FIREABLE(withdraw_8_3) AND (FIREABLE(exit_1) OR FIREABLE(withdraw_3_11) OR FIREABLE(enter_8) OR FIREABLE(exit_13)))))) : E (F ((FIREABLE(withdraw_3_1) AND FIREABLE(withdraw_8_13) AND FIREABLE(try_2)))) : E (F ((FIREABLE(withdraw_11_5) AND FIREABLE(withdraw_7_13) AND NOT FIREABLE(withdraw_9_6) AND FIREABLE(withdraw_1_9) AND ((FIREABLE(exit_8) AND FIREABLE(withdraw_1_8)) OR NOT FIREABLE(withdraw_0_8) OR FIREABLE(withdraw_8_6))))) : E (F (((FIREABLE(withdraw_12_7) OR FIREABLE(withdraw_13_9)) AND (FIREABLE(withdraw_2_1) OR FIREABLE(withdraw_12_10)) AND (NOT FIREABLE(withdraw_9_13) OR NOT FIREABLE(withdraw_8_13)) AND FIREABLE(withdraw_0_3)))) : E (F ((FIREABLE(withdraw_12_1) AND (FIREABLE(exit_8) OR FIREABLE(enter_8))))) : A (G ((NOT FIREABLE(enter_12) OR ((NOT FIREABLE(withdraw_1_13) OR NOT FIREABLE(try_14)) AND (NOT FIREABLE(withdraw_9_6) OR NOT FIREABLE(withdraw_5_6)))))) : E (F ((FIREABLE(withdraw_11_4) AND (FIREABLE(withdraw_0_10) OR FIREABLE(enter_3))))) : E (F ((FIREABLE(try_3) AND FIREABLE(exit_6) AND FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_11_8))))

lola: computing a collection of formulas

lola: RUNNING

lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_11_4) AND FIREABLE(withdraw_5_14))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_11_4) AND FIREABLE(withdraw_5_14))))

lola: processed formula length: 61

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_11_4) AND FIREABLE(withdraw_5_14))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 5 markings, 4 edges

lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_4_10) OR NOT FIREABLE(exit_13))))

lola: ========================================

lola: SUBTASK

lola: checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: processed formula: A (G ((NOT FIREABLE(withdraw_4_10) OR NOT FIREABLE(exit_13))))

lola: processed formula length: 63

lola: 2 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_4_10) AND FIREABLE(exit_13))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas

lola: ========================================

lola: state equation: write sara problem file to ReachabilityFireability-0.sara

lola: state equation: calling and running sara

sara: try reading problem file ReachabilityFireability-0.sara.

lola: SUBRESULT

lola: result: no

lola: produced by: state space

lola: The predicate is not invariant.

lola: 1507 markings, 7813 edges

lola: ========================================

lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_3_1) AND FIREABLE(withdraw_8_13) AND FIREABLE(try_2))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_3_1) AND FIREABLE(withdraw_8_13) AND FIREABLE(try_2))))

lola: processed formula length: 80

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_3_1) AND FIREABLE(withdraw_8_13) AND FIREABLE(try_2))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 5 markings, 4 edges

lola: ========================================

lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_12_1) AND (FIREABLE(exit_8) OR FIREABLE(enter_8)))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_12_1) AND (FIREABLE(exit_8) OR FIREABLE(enter_8)))))

lola: processed formula length: 78

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_12_1) AND (FIREABLE(exit_8) OR FIREABLE(enter_8)))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 23 literals and 2 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 61 markings, 141 edges

lola: ========================================

lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_11_4) AND (FIREABLE(withdraw_0_10) OR FIREABLE(enter_3)))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_11_4) AND (FIREABLE(withdraw_0_10) OR FIREABLE(enter_3)))))

lola: processed formula length: 85

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_11_4) AND (FIREABLE(withdraw_0_10) OR FIREABLE(enter_3)))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 5 markings, 4 edges

lola: ========================================

lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_0_3) AND FIREABLE(withdraw_12_14) AND NOT FIREABLE(withdraw_0_2) AND FIREABLE(withdraw_2_8))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_0_3) AND FIREABLE(withdraw_12_14) AND NOT FIREABLE(withdraw_0_2) AND FIREABLE(withdraw_2_8))))

lola: processed formula length: 119

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_0_3) AND FIREABLE(withdraw_12_14) AND NOT FIREABLE(withdraw_0_2) AND FIREABLE(withdraw_2_8))

lola: state equation task get result unparse finished id 0

lola: state equation: State predicate is contradiction.

lola: SUBRESULT

lola: result: no

lola: produced by: state equation

lola: The predicate is unreachable.

lola: ========================================

lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(try_3) AND FIREABLE(exit_6) AND FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_11_8))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(try_3) AND FIREABLE(exit_6) AND FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_11_8))))

lola: processed formula length: 107

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(try_3) AND FIREABLE(exit_6) AND FIREABLE(withdraw_13_11) AND NOT FIREABLE(withdraw_11_8))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 9 markings, 11 edges

lola: ========================================

lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: A (G ((NOT FIREABLE(enter_12) OR ((NOT FIREABLE(withdraw_1_13) OR NOT FIREABLE(try_14)) AND (NOT FIREABLE(withdraw_9_6) OR NOT FIREABLE(withdraw_5_6))))))

lola: ========================================

lola: SUBTASK

lola: checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: processed formula: A (G ((NOT FIREABLE(enter_12) OR ((NOT FIREABLE(withdraw_1_13) OR NOT FIREABLE(try_14)) AND (NOT FIREABLE(withdraw_9_6) OR NOT FIREABLE(withdraw_5_6))))))

lola: processed formula length: 157

lola: 2 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(enter_12) AND ((FIREABLE(withdraw_1_13) AND FIREABLE(try_14)) OR (FIREABLE(withdraw_9_6) AND FIREABLE(withdraw_5_6))))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 41 literals and 2 conjunctive subformulas

lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara

lola: state equation: calling and running sara

sara: try reading problem file ReachabilityFireability-7-0.sara.

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible

lola: SUBRESULT

lola: result: yes

lola: produced by: state equation

lola: The predicate is invariant.

lola: ========================================

lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_0_3) OR NOT FIREABLE(try_5) OR NOT FIREABLE(withdraw_2_11) OR NOT FIREABLE(exit_11) OR FIREABLE(withdraw_13_3))))

lola: ========================================

lola: SUBTASK

lola: checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: processed formula: A (G ((NOT FIREABLE(withdraw_0_3) OR NOT FIREABLE(try_5) OR NOT FIREABLE(withdraw_2_11) OR NOT FIREABLE(exit_11) OR FIREABLE(withdraw_13_3))))

lola: processed formula length: 146

lola: 2 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_0_3) AND FIREABLE(try_5) AND FIREABLE(withdraw_2_11) AND FIREABLE(exit_11) AND NOT FIREABLE(withdraw_13_3))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 22 literals and 2 conjunctive subformulas

lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara

lola: state equation: calling and running sara

sara: try reading problem file ReachabilityFireability-8-0.sara.

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced

lola: SUBRESULT

lola: result: no

lola: produced by: state equation

lola: The predicate is not invariant.

lola: ========================================

lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_5_14) OR NOT FIREABLE(withdraw_5_1) OR (NOT FIREABLE(withdraw_7_3) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(try_12))))))

lola: ========================================

lola: SUBTASK

lola: checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: processed formula: A (G ((NOT FIREABLE(withdraw_5_14) OR NOT FIREABLE(withdraw_5_1) OR (NOT FIREABLE(withdraw_7_3) AND (NOT FIREABLE(withdraw_13_11) OR NOT FIREABLE(try_12))))))

lola: processed formula length: 161

lola: 2 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: SUBRESULT

lola: result: no

lola: produced by: state space

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: state equation task get result rewrite finished id 0

lola: The predicate is not invariant.

lola: 6 markings, 5 edges

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_5_14) AND FIREABLE(withdraw_5_1) AND (FIREABLE(withdraw_7_3) OR (FIREABLE(withdraw_13_11) AND FIREABLE(try_12))))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas

lola: ========================================

lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F (((FIREABLE(withdraw_12_7) OR FIREABLE(withdraw_13_9)) AND (FIREABLE(withdraw_2_1) OR FIREABLE(withdraw_12_10)) AND (NOT FIREABLE(withdraw_9_13) OR NOT FIREABLE(withdraw_8_13)) AND FIREABLE(withdraw_0_3))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F (((FIREABLE(withdraw_12_7) OR FIREABLE(withdraw_13_9)) AND (FIREABLE(withdraw_2_1) OR FIREABLE(withdraw_12_10)) AND (NOT FIREABLE(withdraw_9_13) OR NOT FIREABLE(withdraw_8_13)) AND FIREABLE(withdraw_0_3))))

lola: processed formula length: 214

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: ((FIREABLE(withdraw_12_7) OR FIREABLE(withdraw_13_9)) AND (FIREABLE(withdraw_2_1) OR FIREABLE(withdraw_12_10)) AND (NOT FIREABLE(withdraw_9_13) OR NOT FIREABLE(withdraw_8_13)) AND FIREABLE(withdraw_0_3))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 180 literals and 18 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 7 markings, 6 edges

lola: ========================================

lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_11_5) AND FIREABLE(withdraw_7_13) AND NOT FIREABLE(withdraw_9_6) AND FIREABLE(withdraw_1_9) AND ((FIREABLE(exit_8) AND FIREABLE(withdraw_1_8)) OR NOT FIREABLE(withdraw_0_8) OR FIREABLE(withdraw_8_6)))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_11_5) AND FIREABLE(withdraw_7_13) AND NOT FIREABLE(withdraw_9_6) AND FIREABLE(withdraw_1_9) AND ((FIREABLE(exit_8) AND FIREABLE(withdraw_1_8)) OR NOT FIREABLE(withdraw_0_8) OR FIREABLE(withdraw_8_6)))))

lola: processed formula length: 229

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_11_5) AND FIREABLE(withdraw_7_13) AND NOT FIREABLE(withdraw_9_6) AND FIREABLE(withdraw_1_9) AND ((FIREABLE(exit_8) AND FIREABLE(withdraw_1_8)) OR NOT FIREABLE(withdraw_0_8) OR FIREABLE(withdraw_8_6)))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 109 literals and 9 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 7 markings, 6 edges

lola: ========================================

lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: A (G ((FIREABLE(try_9) OR FIREABLE(withdraw_14_3) OR NOT FIREABLE(withdraw_4_1) OR NOT FIREABLE(withdraw_3_8) OR ((FIREABLE(withdraw_4_3) OR FIREABLE(exit_12) OR NOT FIREABLE(withdraw_10_8)) AND FIREABLE(exit_10)))))

lola: ========================================

lola: SUBTASK

lola: checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: processed formula: A (G ((FIREABLE(try_9) OR FIREABLE(withdraw_14_3) OR NOT FIREABLE(withdraw_4_1) OR NOT FIREABLE(withdraw_3_8) OR ((FIREABLE(withdraw_4_3) OR FIREABLE(exit_12) OR NOT FIREABLE(withdraw_10_8)) AND FIREABLE(exit_10)))))

lola: processed formula length: 222

lola: 2 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: SUBRESULT

lola: result: no

lola: produced by: state space

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: state equation task get result rewrite finished id 0

lola: The predicate is not invariant.

lola: 6 markings, 5 edges

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (NOT FIREABLE(try_9) AND NOT FIREABLE(withdraw_14_3) AND FIREABLE(withdraw_4_1) AND FIREABLE(withdraw_3_8) AND ((NOT FIREABLE(withdraw_4_3) AND NOT FIREABLE(exit_12) AND FIREABLE(withdraw_10_8)) OR NOT FIREABLE(exit_10)))

lola: ========================================

lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_9_7) OR NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(try_14) OR NOT FIREABLE(withdraw_2_11) OR (FIREABLE(withdraw_8_3) AND (FIREABLE(exit_1) OR FIREABLE(withdraw_3_11) OR FIREABLE(enter_8) OR FIREABLE(exit_13))))))

lola: ========================================

lola: SUBTASK

lola: checking invariance

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: processed formula: A (G ((NOT FIREABLE(withdraw_9_7) OR NOT FIREABLE(withdraw_2_13) OR NOT FIREABLE(try_14) OR NOT FIREABLE(withdraw_2_11) OR (FIREABLE(withdraw_8_3) AND (FIREABLE(exit_1) OR FIREABLE(withdraw_3_11) OR FIREABLE(enter_8) OR FIREABLE(exit_13))))))

lola: processed formula length: 249

lola: 2 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:721

lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: SUBRESULT

lola: result: no

lola: produced by: state space

lola: formula 0: (FIREABLE(withdraw_9_7) AND FIREABLE(withdraw_2_13) AND FIREABLE(try_14) AND FIREABLE(withdraw_2_11) AND (NOT FIREABLE(withdraw_8_3) OR (NOT FIREABLE(exit_1) AND NOT FIREABLE(withdraw_3_11) AND NOT FIREABLE(enter_8) AND NOT FIREABLE(exit_13))))

lola: The predicate is not invariant.

lola: 6 markings, 5 edges

lola: ========================================

lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F (((FIREABLE(enter_7) AND (FIREABLE(withdraw_1_13) OR FIREABLE(withdraw_11_5))) OR ((FIREABLE(withdraw_9_3) OR FIREABLE(try_3)) AND (FIREABLE(withdraw_10_4) OR FIREABLE(withdraw_2_0)) AND FIREABLE(withdraw_4_11) AND FIREABLE(withdraw_10_5)))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F (((FIREABLE(enter_7) AND (FIREABLE(withdraw_1_13) OR FIREABLE(withdraw_11_5))) OR ((FIREABLE(withdraw_9_3) OR FIREABLE(try_3)) AND (FIREABLE(withdraw_10_4) OR FIREABLE(withdraw_2_0)) AND FIREABLE(withdraw_4_11) AND FIREABLE(withdraw_10_5)))))

lola: processed formula length: 251

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: ((FIREABLE(enter_7) AND (FIREABLE(withdraw_1_13) OR FIREABLE(withdraw_11_5))) OR ((FIREABLE(withdraw_9_3) OR FIREABLE(try_3)) AND (FIREABLE(withdraw_10_4) OR FIREABLE(withdraw_2_0)) AND FIREABLE(withdraw_4_11) AND FIREABLE(withdraw_10_5)))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 82 literals and 6 conjunctive subformulas

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 13 markings, 28 edges

lola: ========================================

lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)

lola: ========================================

lola: ...considering subproblem: E (F ((FIREABLE(withdraw_11_2) AND FIREABLE(withdraw_13_7) AND (FIREABLE(withdraw_8_14) OR FIREABLE(withdraw_7_12)) AND ((FIREABLE(withdraw_1_8) AND FIREABLE(withdraw_9_2)) OR FIREABLE(withdraw_11_4)) AND ((FIREABLE(try_2) AND FIREABLE(withdraw_10_3)) OR FIREABLE(withdraw_1_10) OR (FIREABLE(withdraw_1_2) AND FIREABLE(withdraw_8_9) AND NOT FIREABLE(withdraw_11_4))))))

lola: ========================================

lola: SUBTASK

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F ((FIREABLE(withdraw_11_2) AND FIREABLE(withdraw_13_7) AND (FIREABLE(withdraw_8_14) OR FIREABLE(withdraw_7_12)) AND ((FIREABLE(withdraw_1_8) AND FIREABLE(withdraw_9_2)) OR FIREABLE(withdraw_11_4)) AND ((FIREABLE(try_2) AND FIREABLE(withdraw_10_3)) OR FIREABLE(withdraw_1_10) OR (FIREABLE(withdraw_1_2) AND FIREABLE(withdraw_8_9) AND NOT FIREABLE(withdraw_11_4))))))

lola: processed formula length: 373

lola: 1 rewrites

lola: closed formula file ReachabilityFireability.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

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: built state equation task

lola: RUNNING

lola: state equation task get result started, id 0

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: (FIREABLE(withdraw_11_2) AND FIREABLE(withdraw_13_7) AND (FIREABLE(withdraw_8_14) OR FIREABLE(withdraw_7_12)) AND ((FIREABLE(withdraw_1_8) AND FIREABLE(withdraw_9_2)) OR FIREABLE(withdraw_11_4)) AND ((FIREABLE(try_2) AND FIREABLE(withdraw_10_3)) OR FIREABLE(withdraw_1_10) OR (FIREABLE(withdraw_1_2) AND FIREABLE(withdraw_8_9) AND NOT FIREABLE(withdraw_11_4))))

lola: SUBRESULT

lola: result: yes

lola: produced by: state space

lola: The predicate is reachable.

lola: 9 markings, 8 edges

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 184 literals and 10 conjunctive subformulas

lola: ========================================

lola: RESULT

lola:

SUMMARY: no yes yes yes no no no no no yes yes yes yes yes yes yes

lola:

preliminary result: no yes yes yes no no no no no yes yes yes yes yes yes yes

lola: memory consumption: 16768 KB

lola: time consumption: 4 seconds

lola: print data as JSON (--json)

lola: writing JSON to ReachabilityFireability.json

lola: closed JSON file ReachabilityFireability.json

rslt: finished

**BK_STOP 1552491798206
**

--------------------

content from 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="Dekker-PT-015"

export BK_EXAMINATION="ReachabilityFireability"

export BK_TOOL="lola"

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

# this is for BenchKit: explicit launching of the test

echo "====================================================================="

echo " Generated by BenchKit 2-3954"

echo " Executing tool lola"

echo " Input is Dekker-PT-015, 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 r049-oct2-155234405800864"

echo "====================================================================="

echo

echo "--------------------"

echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz

mv Dekker-PT-015 execution

cd execution

if [ "ReachabilityFireability" = "GlobalProperties" ] ; then

rm -f GenericPropertiesVerdict.xml

fi

if [ "ReachabilityFireability" = "UpperBounds" ] ; then

rm -f GenericPropertiesVerdict.xml

fi

pwd

ls -lh

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 '

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 ;