fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution%20of%20r060-ebro-155234654600081
Last Updated
Apr 15, 2019

About the Execution of LoLA for Diffusion2D-PT-D10N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4267.690 6366.00 6315.00 15.20 TTTTTFFFFTTTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234654600081.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Diffusion2D-PT-D10N010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654600081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 3.3K Feb 10 21:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 10 21:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 6 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 6 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 07:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 07:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jan 30 23:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 30 23:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 255K 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 Diffusion2D-PT-D10N010-ReachabilityFireability-00
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-01
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-02
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-03
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-04
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-05
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-06
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-07
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-08
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-09
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1552556035861

info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D10N010 @ 3570 seconds

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for ReachabilityFireability @ Diffusion2D-PT-D10N010

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 09:33:55 2019
",
"timelimit": 3570
},
"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": 0,
"adisj": 0,
"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": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(t1_1_10_1_9)))",
"processed_size": 29,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 1,
"problems": 1
},
"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": 0,
"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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(t1_4_1_5_1)))",
"processed_size": 32,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"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": 1,
"problems": 1
},
"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": 0,
"adisj": 0,
"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": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(t1_8_1_8_2)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(t1_9_1_8_2)))",
"processed_size": 32,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(t1_1_7_1_8)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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(t1_2_9_3_8) AND FIREABLE(t1_7_10_8_10))))",
"processed_size": 57,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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(t1_8_1_9_1) OR NOT FIREABLE(t1_2_1_1_2))))",
"processed_size": 63,
"rewrites": 2
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": 5,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F (((NOT FIREABLE(t1_4_6_3_7) OR FIREABLE(t1_10_4_10_5)) AND (NOT FIREABLE(t1_6_8_7_7) OR NOT FIREABLE(t1_7_5_8_5)) AND FIREABLE(t1_5_1_4_1))))",
"processed_size": 148,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"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": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((((FIREABLE(t1_1_3_2_3) AND FIREABLE(t1_2_5_2_6)) OR (FIREABLE(t1_6_5_5_4) AND FIREABLE(t1_6_8_5_7)) OR FIREABLE(t1_4_10_5_9)) AND FIREABLE(t1_8_8_9_7))))",
"processed_size": 162,
"rewrites": 1
},
"result":
{
"edges": 20,
"markings": 15,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"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": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t1_3_8_4_9) AND (FIREABLE(t1_7_10_6_9) OR ((FIREABLE(t1_10_10_9_9) OR FIREABLE(t1_7_5_7_6)) AND (FIREABLE(t1_1_10_1_9) OR FIREABLE(t1_2_2_2_3)))))))",
"processed_size": 167,
"rewrites": 1
},
"result":
{
"edges": 59,
"markings": 34,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": 7,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(t1_9_5_10_5) OR NOT FIREABLE(t1_5_10_4_10) OR NOT FIREABLE(t1_8_2_7_2) OR FIREABLE(t1_10_5_9_6) OR (FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_6_6_7_5) AND NOT FIREABLE(t1_1_8_1_9)))))",
"processed_size": 202,
"rewrites": 2
},
"result":
{
"edges": 51,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"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": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((((FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_1_6_1_5)) AND FIREABLE(t1_7_5_7_6) AND (FIREABLE(t1_6_1_5_2) OR FIREABLE(t1_3_9_4_9) OR NOT FIREABLE(t1_2_6_2_5))) OR FIREABLE(t1_1_7_2_8))))",
"processed_size": 190,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 8,
"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": 16,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 7,
"unfir": 6,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(t1_8_5_8_4) OR NOT FIREABLE(t1_8_7_9_6) OR NOT FIREABLE(t1_4_1_3_2) OR NOT FIREABLE(t1_3_5_4_6) OR (NOT FIREABLE(t1_7_2_6_3) AND NOT FIREABLE(t1_9_9_9_8) AND FIREABLE(t1_5_3_4_2)))))",
"processed_size": 206,
"rewrites": 2
},
"result":
{
"edges": 12,
"markings": 13,
"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"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": 7,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(t1_6_6_5_5) AND FIREABLE(t1_1_9_1_10) AND NOT FIREABLE(t1_5_9_6_8) AND (NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_4_9_5_8)) AND (FIREABLE(t1_2_2_2_1) OR NOT FIREABLE(t1_9_5_10_6)))))",
"processed_size": 202,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((NOT FIREABLE(t1_3_4_2_5) AND FIREABLE(t1_10_7_9_6) AND FIREABLE(t1_3_8_4_9) AND FIREABLE(t1_9_5_8_4) AND NOT FIREABLE(t1_2_6_1_7) AND ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_1_6_1_7)) OR (FIREABLE(t1_2_3_1_2) AND FIREABLE(t1_4_10_3_9))))))",
"processed_size": 246,
"rewrites": 1
},
"result":
{
"edges": 61,
"markings": 35,
"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": 14,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "E (F ((FIREABLE(t1_6_6_5_6) AND FIREABLE(t1_2_3_2_2) AND FIREABLE(t1_6_8_7_7) AND NOT FIREABLE(t1_9_1_9_2) AND (FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_4_6_4_5)) AND NOT FIREABLE(t1_10_7_9_7) AND (FIREABLE(t1_6_6_6_5) OR (FIREABLE(t1_7_9_7_10) AND FIREABLE(t1_4_3_5_4))))))",
"processed_size": 271,
"rewrites": 1
},
"result":
{
"edges": 66,
"markings": 35,
"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": 30,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 16876,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1368,
"conflict_clusters": 100,
"places": 100,
"places_significant": 99,
"singleton_clusters": 0,
"transitions": 684
},
"result":
{
"preliminary_value": "yes yes yes yes yes no no no no yes yes yes yes no yes yes ",
"value": "yes yes yes yes yes no no no no yes yes yes yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 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: 784/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 684 transitions, 99 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: E (F ((FIREABLE(t1_6_6_5_5) AND FIREABLE(t1_1_9_1_10) AND NOT FIREABLE(t1_5_9_6_8) AND (NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_4_9_5_8)) AND (FIREABLE(t1_2_2_2_1) OR NOT FIREABLE(t1_9_5_10_6))))) : E (F (FIREABLE(t1_1_10_1_9))) : E (F (((NOT FIREABLE(t1_4_6_3_7) OR FIREABLE(t1_10_4_10_5)) AND (NOT FIREABLE(t1_6_8_7_7) OR NOT FIREABLE(t1_7_5_8_5)) AND FIREABLE(t1_5_1_4_1)))) : E (F ((FIREABLE(t1_2_9_3_8) AND FIREABLE(t1_7_10_8_10)))) : E (F ((((FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_1_6_1_5)) AND FIREABLE(t1_7_5_7_6) AND (FIREABLE(t1_6_1_5_2) OR FIREABLE(t1_3_9_4_9) OR NOT FIREABLE(t1_2_6_2_5))) OR FIREABLE(t1_1_7_2_8)))) : A (G ((NOT FIREABLE(t1_8_1_9_1) OR NOT FIREABLE(t1_2_1_1_2)))) : A (G ((NOT FIREABLE(t1_9_5_10_5) OR NOT FIREABLE(t1_5_10_4_10) OR NOT FIREABLE(t1_8_2_7_2) OR FIREABLE(t1_10_5_9_6) OR (FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_6_6_7_5) AND NOT FIREABLE(t1_1_8_1_9))))) : A (G (NOT FIREABLE(t1_4_1_5_1))) : A (G ((NOT FIREABLE(t1_8_5_8_4) OR NOT FIREABLE(t1_8_7_9_6) OR NOT FIREABLE(t1_4_1_3_2) OR NOT FIREABLE(t1_3_5_4_6) OR (NOT FIREABLE(t1_7_2_6_3) AND NOT FIREABLE(t1_9_9_9_8) AND FIREABLE(t1_5_3_4_2))))) : E (F ((NOT FIREABLE(t1_3_4_2_5) AND FIREABLE(t1_10_7_9_6) AND FIREABLE(t1_3_8_4_9) AND FIREABLE(t1_9_5_8_4) AND NOT FIREABLE(t1_2_6_1_7) AND ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_1_6_1_7)) OR (FIREABLE(t1_2_3_1_2) AND FIREABLE(t1_4_10_3_9)))))) : E (F ((((FIREABLE(t1_1_3_2_3) AND FIREABLE(t1_2_5_2_6)) OR (FIREABLE(t1_6_5_5_4) AND FIREABLE(t1_6_8_5_7)) OR FIREABLE(t1_4_10_5_9)) AND FIREABLE(t1_8_8_9_7)))) : E (F (FIREABLE(t1_8_1_8_2))) : E (F ((FIREABLE(t1_3_8_4_9) AND (FIREABLE(t1_7_10_6_9) OR ((FIREABLE(t1_10_10_9_9) OR FIREABLE(t1_7_5_7_6)) AND (FIREABLE(t1_1_10_1_9) OR FIREABLE(t1_2_2_2_3))))))) : A (G (NOT FIREABLE(t1_9_1_8_2))) : E (F (FIREABLE(t1_1_7_1_8))) : E (F ((FIREABLE(t1_6_6_5_6) AND FIREABLE(t1_2_3_2_2) AND FIREABLE(t1_6_8_7_7) AND NOT FIREABLE(t1_9_1_9_2) AND (FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_4_6_4_5)) AND NOT FIREABLE(t1_10_7_9_7) AND (FIREABLE(t1_6_6_6_5) OR (FIREABLE(t1_7_9_7_10) AND FIREABLE(t1_4_3_5_4))))))
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(t1_1_10_1_9)))
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(t1_1_10_1_9)))
lola: processed formula length: 29
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(t1_1_10_1_9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_4_1_5_1)))
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(t1_4_1_5_1)))
lola: processed formula length: 32
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(t1_4_1_5_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_8_1_8_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(t1_8_1_8_2)))
lola: processed formula length: 28
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(t1_8_1_8_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_9_1_8_2)))
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(t1_9_1_8_2)))
lola: processed formula length: 32
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(t1_9_1_8_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_1_7_1_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(t1_1_7_1_8)))
lola: processed formula length: 28
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(t1_1_7_1_8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_2_9_3_8) AND FIREABLE(t1_7_10_8_10))))
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(t1_2_9_3_8) AND FIREABLE(t1_7_10_8_10))))
lola: processed formula length: 57
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(t1_2_9_3_8) AND FIREABLE(t1_7_10_8_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_8_1_9_1) OR NOT FIREABLE(t1_2_1_1_2))))
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(t1_8_1_9_1) OR NOT FIREABLE(t1_2_1_1_2))))
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(t1_8_1_9_1) AND FIREABLE(t1_2_1_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1_4_6_3_7) OR FIREABLE(t1_10_4_10_5)) AND (NOT FIREABLE(t1_6_8_7_7) OR NOT FIREABLE(t1_7_5_8_5)) AND FIREABLE(t1_5_1_4_1))))
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 (((NOT FIREABLE(t1_4_6_3_7) OR FIREABLE(t1_10_4_10_5)) AND (NOT FIREABLE(t1_6_8_7_7) OR NOT FIREABLE(t1_7_5_8_5)) AND FIREABLE(t1_5_1_4_1))))
lola: processed formula length: 148
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: ((NOT FIREABLE(t1_4_6_3_7) OR FIREABLE(t1_10_4_10_5)) AND (NOT FIREABLE(t1_6_8_7_7) OR NOT FIREABLE(t1_7_5_8_5)) AND FIREABLE(t1_5_1_4_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1_1_3_2_3) AND FIREABLE(t1_2_5_2_6)) OR (FIREABLE(t1_6_5_5_4) AND FIREABLE(t1_6_8_5_7)) OR FIREABLE(t1_4_10_5_9)) AND FIREABLE(t1_8_8_9_7))))
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(t1_1_3_2_3) AND FIREABLE(t1_2_5_2_6)) OR (FIREABLE(t1_6_5_5_4) AND FIREABLE(t1_6_8_5_7)) OR FIREABLE(t1_4_10_5_9)) AND FIREABLE(t1_8_8_9_7))))
lola: processed formula length: 162
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(t1_1_3_2_3) AND FIREABLE(t1_2_5_2_6)) OR (FIREABLE(t1_6_5_5_4) AND FIREABLE(t1_6_8_5_7)) OR FIREABLE(t1_4_10_5_9)) AND FIREABLE(t1_8_8_9_7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 20 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_3_8_4_9) AND (FIREABLE(t1_7_10_6_9) OR ((FIREABLE(t1_10_10_9_9) OR FIREABLE(t1_7_5_7_6)) AND (FIREABLE(t1_1_10_1_9) OR FIREABLE(t1_2_2_2_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(t1_3_8_4_9) AND (FIREABLE(t1_7_10_6_9) OR ((FIREABLE(t1_10_10_9_9) OR FIREABLE(t1_7_5_7_6)) AND (FIREABLE(t1_1_10_1_9) OR FIREABLE(t1_2_2_2_3)))))))
lola: processed formula length: 167
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(t1_3_8_4_9) AND (FIREABLE(t1_7_10_6_9) OR ((FIREABLE(t1_10_10_9_9) OR FIREABLE(t1_7_5_7_6)) AND (FIREABLE(t1_1_10_1_9) OR FIREABLE(t1_2_2_2_3)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 59 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_9_5_10_5) OR NOT FIREABLE(t1_5_10_4_10) OR NOT FIREABLE(t1_8_2_7_2) OR FIREABLE(t1_10_5_9_6) OR (FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_6_6_7_5) AND NOT FIREABLE(t1_1_8_1_9)))))
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(t1_9_5_10_5) OR NOT FIREABLE(t1_5_10_4_10) OR NOT FIREABLE(t1_8_2_7_2) OR FIREABLE(t1_10_5_9_6) OR (FIREABLE(t1_3_4_2_4) AND FIREABLE(t1_6_6_7_5) AND NOT FIREABLE(t1_1_8_1_9)))))
lola: processed formula length: 202
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(t1_9_5_10_5) AND FIREABLE(t1_5_10_4_10) AND FIREABLE(t1_8_2_7_2) AND NOT FIREABLE(t1_10_5_9_6) AND (NOT FIREABLE(t1_3_4_2_4) OR NOT FIREABLE(t1_6_6_7_5) OR FIREABLE(t1_1_8_1_9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 51 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_1_6_1_5)) AND FIREABLE(t1_7_5_7_6) AND (FIREABLE(t1_6_1_5_2) OR FIREABLE(t1_3_9_4_9) OR NOT FIREABLE(t1_2_6_2_5))) OR FIREABLE(t1_1_7_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(t1_2_6_2_7) OR FIREABLE(t1_1_6_1_5)) AND FIREABLE(t1_7_5_7_6) AND (FIREABLE(t1_6_1_5_2) OR FIREABLE(t1_3_9_4_9) OR NOT FIREABLE(t1_2_6_2_5))) OR FIREABLE(t1_1_7_2_8))))
lola: processed formula length: 190
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(t1_2_6_2_7) OR FIREABLE(t1_1_6_1_5)) AND FIREABLE(t1_7_5_7_6) AND (FIREABLE(t1_6_1_5_2) OR FIREABLE(t1_3_9_4_9) OR NOT FIREABLE(t1_2_6_2_5))) OR FIREABLE(t1_1_7_2_8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_8_5_8_4) OR NOT FIREABLE(t1_8_7_9_6) OR NOT FIREABLE(t1_4_1_3_2) OR NOT FIREABLE(t1_3_5_4_6) OR (NOT FIREABLE(t1_7_2_6_3) AND NOT FIREABLE(t1_9_9_9_8) AND FIREABLE(t1_5_3_4_2)))))
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(t1_8_5_8_4) OR NOT FIREABLE(t1_8_7_9_6) OR NOT FIREABLE(t1_4_1_3_2) OR NOT FIREABLE(t1_3_5_4_6) OR (NOT FIREABLE(t1_7_2_6_3) AND NOT FIREABLE(t1_9_9_9_8) AND FIREABLE(t1_5_3_4_2)))))
lola: processed formula length: 206
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(t1_8_5_8_4) AND FIREABLE(t1_8_7_9_6) AND FIREABLE(t1_4_1_3_2) AND FIREABLE(t1_3_5_4_6) AND (FIREABLE(t1_7_2_6_3) OR FIREABLE(t1_9_9_9_8) OR NOT FIREABLE(t1_5_3_4_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_6_6_5_5) AND FIREABLE(t1_1_9_1_10) AND NOT FIREABLE(t1_5_9_6_8) AND (NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_4_9_5_8)) AND (FIREABLE(t1_2_2_2_1) OR NOT FIREABLE(t1_9_5_10_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(t1_6_6_5_5) AND FIREABLE(t1_1_9_1_10) AND NOT FIREABLE(t1_5_9_6_8) AND (NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_4_9_5_8)) AND (FIREABLE(t1_2_2_2_1) OR NOT FIREABLE(t1_9_5_10_6)))))
lola: processed formula length: 202
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(t1_6_6_5_5) AND FIREABLE(t1_1_9_1_10) AND NOT FIREABLE(t1_5_9_6_8) AND (NOT FIREABLE(t1_8_9_9_9) OR NOT FIREABLE(t1_4_9_5_8)) AND (FIREABLE(t1_2_2_2_1) OR NOT FIREABLE(t1_9_5_10_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_3_4_2_5) AND FIREABLE(t1_10_7_9_6) AND FIREABLE(t1_3_8_4_9) AND FIREABLE(t1_9_5_8_4) AND NOT FIREABLE(t1_2_6_1_7) AND ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_1_6_1_7)) OR (FIREABLE(t1_2_3_1_2) AND FIREABLE(t1_4_10_3_9))))))
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 ((NOT FIREABLE(t1_3_4_2_5) AND FIREABLE(t1_10_7_9_6) AND FIREABLE(t1_3_8_4_9) AND FIREABLE(t1_9_5_8_4) AND NOT FIREABLE(t1_2_6_1_7) AND ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_1_6_1_7)) OR (FIREABLE(t1_2_3_1_2) AND FIREABLE(t1_4_10_3_9))))))
lola: processed formula length: 246
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: (NOT FIREABLE(t1_3_4_2_5) AND FIREABLE(t1_10_7_9_6) AND FIREABLE(t1_3_8_4_9) AND FIREABLE(t1_9_5_8_4) AND NOT FIREABLE(t1_2_6_1_7) AND ((FIREABLE(t1_5_7_4_6) AND FIREABLE(t1_1_6_1_7)) OR (FIREABLE(t1_2_3_1_2) AND FIREABLE(t1_4_10_3_9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_6_6_5_6) AND FIREABLE(t1_2_3_2_2) AND FIREABLE(t1_6_8_7_7) AND NOT FIREABLE(t1_9_1_9_2) AND (FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_4_6_4_5)) AND NOT FIREABLE(t1_10_7_9_7) AND (FIREABLE(t1_6_6_6_5) OR (FIREABLE(t1_7_9_7_10) AND FIREABLE(t1_4_3_5_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(t1_6_6_5_6) AND FIREABLE(t1_2_3_2_2) AND FIREABLE(t1_6_8_7_7) AND NOT FIREABLE(t1_9_1_9_2) AND (FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_4_6_4_5)) AND NOT FIREABLE(t1_10_7_9_7) AND (FIREABLE(t1_6_6_6_5) OR (FIREABLE(t1_7_9_7_10) AND FIREABLE(t1_4_3_5_4))))))
lola: processed formula length: 271
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(t1_6_6_5_6) AND FIREABLE(t1_2_3_2_2) AND FIREABLE(t1_6_8_7_7) AND NOT FIREABLE(t1_9_1_9_2) AND (FIREABLE(t1_2_6_2_7) OR FIREABLE(t1_4_6_4_5)) AND NOT FIREABLE(t1_10_7_9_7) AND (FIREABLE(t1_6_6_6_5) OR (FIREABLE(t1_7_9_7_10) AND FIREABLE(t1_4_3_5_4))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 66 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no no yes yes yes yes no yes yes
lola:
preliminary result: yes yes yes yes yes no no no no yes yes yes yes no yes yes
lola: memory consumption: 16876 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

BK_STOP 1552556042227

--------------------
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="Diffusion2D-PT-D10N010"
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 Diffusion2D-PT-D10N010, 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 r060-ebro-155234654600081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D10N010.tgz
mv Diffusion2D-PT-D10N010 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;