About the Execution of LoLA for Diffusion2D-PT-D05N200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4265.710 | 6719.00 | 6510.00 | 15.00 | FFFTFFFFFTTTTFTT | 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-155234654500045.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-D05N200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654500045
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Feb 10 21:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 21:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 6 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 6 17:47 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.8K Feb 4 23:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 3 07:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 07:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Jan 30 23:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 30 23:43 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 55K 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-D05N200-ReachabilityFireability-00
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-01
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-02
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-03
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-04
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-05
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-06
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-07
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-08
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-09
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D05N200-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552549820970
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D05N200 @ 3570 seconds
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N200-ReachabilityFireability-00 FALSE 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-D05N200
{
"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 07:50:21 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((FIREABLE(t1_3_3_4_3) OR NOT FIREABLE(t1_4_5_4_4))))",
"processed_size": 59,
"rewrites": 2
},
"result":
{
"edges": 204,
"markings": 204,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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(t1_3_1_2_2) AND FIREABLE(t1_1_4_2_3) AND FIREABLE(t1_1_2_1_3))))",
"processed_size": 80,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"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(t1_4_4_3_3) AND FIREABLE(t1_2_5_1_5) AND FIREABLE(t1_1_2_1_3))))",
"processed_size": 80,
"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": 3,
"problems": 3
},
"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": 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": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(t1_2_5_1_4) OR NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_3_1_4_1) OR FIREABLE(t1_2_4_3_4))))",
"processed_size": 117,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"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": 4,
"problems": 1
},
"type": "invariance",
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_2_5_1_5)) AND FIREABLE(t1_5_1_5_2) AND NOT FIREABLE(t1_3_3_2_4))))",
"processed_size": 119,
"rewrites": 1
},
"result":
{
"edges": 201,
"markings": 202,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(t1_2_4_3_5) OR NOT FIREABLE(t1_5_2_5_3) OR FIREABLE(t1_2_4_1_5) OR FIREABLE(t1_3_4_4_4))))",
"processed_size": 113,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"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": "invariance",
"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": 1,
"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": 5
},
"processed": "A (G ((FIREABLE(t1_1_3_2_4) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_3_3_3_4)) OR FIREABLE(t1_3_3_2_2) OR FIREABLE(t1_4_3_5_3))))",
"processed_size": 157,
"rewrites": 2
},
"result":
{
"edges": 200,
"markings": 201,
"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": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F (((FIREABLE(t1_4_2_5_1) OR FIREABLE(t1_4_4_3_5)) AND NOT FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_4_4_5_3) AND FIREABLE(t1_1_4_1_3))))",
"processed_size": 136,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 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(t1_3_2_4_3) OR NOT FIREABLE(t1_2_3_3_4) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_1_3_1_2) OR FIREABLE(t1_5_5_4_4))))",
"processed_size": 146,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 1
},
"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": 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": "A (G ((FIREABLE(t1_4_1_3_1) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_2_1_3) AND FIREABLE(t1_4_4_3_5)) OR FIREABLE(t1_2_4_2_5) OR FIREABLE(t1_2_4_2_3))))",
"processed_size": 157,
"rewrites": 2
},
"result":
{
"edges": 200,
"markings": 201,
"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": 10,
"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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_3_3_3) AND FIREABLE(t1_4_2_3_3) AND (NOT FIREABLE(t1_5_2_5_3) OR NOT FIREABLE(t1_1_3_2_2)))))",
"processed_size": 165,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 6,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G (((FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_1_1_2_1) AND FIREABLE(t1_2_3_3_4)) OR (NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_1_2_2_1)) OR FIREABLE(t1_3_3_3_2))))",
"processed_size": 163,
"rewrites": 2
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((NOT FIREABLE(t1_4_1_5_2) AND NOT FIREABLE(t1_3_1_4_1) AND NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_3_4_3_3) AND NOT FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_3_3_4_3))))",
"processed_size": 175,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 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(t1_4_5_3_5) AND FIREABLE(t1_4_3_5_3) AND NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_3_1_4_2) AND FIREABLE(t1_4_2_4_1) AND NOT FIREABLE(t1_5_4_4_4) AND FIREABLE(t1_3_4_4_3))))",
"processed_size": 188,
"rewrites": 1
},
"result":
{
"edges": 10,
"markings": 10,
"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": 7,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 6,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G ((NOT FIREABLE(t1_4_1_5_1) OR NOT FIREABLE(t1_3_4_2_4) OR (NOT FIREABLE(t1_3_4_2_3) AND NOT FIREABLE(t1_3_2_4_2)) OR NOT FIREABLE(t1_4_4_4_3) OR NOT FIREABLE(t1_2_4_3_5) OR (FIREABLE(t1_1_3_2_2) AND FIREABLE(t1_3_2_2_2)) OR (FIREABLE(t1_2_2_3_3) AND FIREABLE(t1_4_4_3_3)))))",
"processed_size": 285,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 21,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"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": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 12,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 12
},
"processed": "E (F ((FIREABLE(t1_2_3_1_4) AND FIREABLE(t1_4_3_3_2) AND NOT FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_5_2_4_1) AND FIREABLE(t1_1_5_2_5) AND FIREABLE(t1_5_1_4_1) AND FIREABLE(t1_5_3_5_4) AND FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_2_3_3_4) AND (FIREABLE(t1_4_5_3_5) OR FIREABLE(t1_4_3_3_3) OR FIREABLE(t1_4_2_3_2)))))",
"processed_size": 311,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 15372,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "no no no yes no no no no no yes yes yes yes no yes yes ",
"value": "no no no yes no 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: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 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_2_3_1_4) AND FIREABLE(t1_4_3_3_2) AND NOT FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_5_2_4_1) AND FIREABLE(t1_1_5_2_5) AND FIREABLE(t1_5_1_4_1) AND FIREABLE(t1_5_3_5_4) AND FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_2_3_3_4) AND (FIREABLE(t1_4_5_3_5) OR FIREABLE(t1_4_3_3_3) OR FIREABLE(t1_4_2_3_2))))) : A (G ((NOT FIREABLE(t1_4_1_5_1) OR NOT FIREABLE(t1_3_4_2_4) OR (NOT FIREABLE(t1_3_4_2_3) AND NOT FIREABLE(t1_3_2_4_2)) OR NOT FIREABLE(t1_4_4_4_3) OR NOT FIREABLE(t1_2_4_3_5) OR (FIREABLE(t1_1_3_2_2) AND FIREABLE(t1_3_2_2_2)) OR (FIREABLE(t1_2_2_3_3) AND FIREABLE(t1_4_4_3_3))))) : A (G ((NOT FIREABLE(t1_2_5_1_4) OR NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_3_1_4_1) OR FIREABLE(t1_2_4_3_4)))) : E (F ((FIREABLE(t1_3_1_2_2) AND FIREABLE(t1_1_4_2_3) AND FIREABLE(t1_1_2_1_3)))) : A (G ((NOT FIREABLE(t1_3_2_4_3) OR NOT FIREABLE(t1_2_3_3_4) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_1_3_1_2) OR FIREABLE(t1_5_5_4_4)))) : A (G ((FIREABLE(t1_3_3_4_3) OR NOT FIREABLE(t1_4_5_4_4)))) : A (G ((FIREABLE(t1_1_3_2_4) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_3_3_3_4)) OR FIREABLE(t1_3_3_2_2) OR FIREABLE(t1_4_3_5_3)))) : A (G (((FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_1_1_2_1) AND FIREABLE(t1_2_3_3_4)) OR (NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_1_2_2_1)) OR FIREABLE(t1_3_3_3_2)))) : A (G ((FIREABLE(t1_4_1_3_1) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_2_1_3) AND FIREABLE(t1_4_4_3_5)) OR FIREABLE(t1_2_4_2_5) OR FIREABLE(t1_2_4_2_3)))) : E (F ((FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_4_3_5_3) AND NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_3_1_4_2) AND FIREABLE(t1_4_2_4_1) AND NOT FIREABLE(t1_5_4_4_4) AND FIREABLE(t1_3_4_4_3)))) : E (F ((FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_3_3_3) AND FIREABLE(t1_4_2_3_3) AND (NOT FIREABLE(t1_5_2_5_3) OR NOT FIREABLE(t1_1_3_2_2))))) : E (F ((FIREABLE(t1_4_4_3_3) AND FIREABLE(t1_2_5_1_5) AND FIREABLE(t1_1_2_1_3)))) : E (F (((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_2_5_1_5)) AND FIREABLE(t1_5_1_5_2) AND NOT FIREABLE(t1_3_3_2_4)))) : E (F (((FIREABLE(t1_4_2_5_1) OR FIREABLE(t1_4_4_3_5)) AND NOT FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_4_4_5_3) AND FIREABLE(t1_1_4_1_3)))) : A (G ((NOT FIREABLE(t1_2_4_3_5) OR NOT FIREABLE(t1_5_2_5_3) OR FIREABLE(t1_2_4_1_5) OR FIREABLE(t1_3_4_4_4)))) : E (F ((NOT FIREABLE(t1_4_1_5_2) AND NOT FIREABLE(t1_3_1_4_1) AND NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_3_4_3_3) AND NOT FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_3_3_4_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_3_3_4_3) OR NOT FIREABLE(t1_4_5_4_4))))
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(t1_3_3_4_3) OR NOT FIREABLE(t1_4_5_4_4))))
lola: processed formula length: 59
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: (NOT FIREABLE(t1_3_3_4_3) AND FIREABLE(t1_4_5_4_4))
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: 204 markings, 204 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_3_1_2_2) AND FIREABLE(t1_1_4_2_3) AND FIREABLE(t1_1_2_1_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_1_2_2) AND FIREABLE(t1_1_4_2_3) AND FIREABLE(t1_1_2_1_3))))
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(t1_3_1_2_2) AND FIREABLE(t1_1_4_2_3) AND FIREABLE(t1_1_2_1_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_4_4_3_3) AND FIREABLE(t1_2_5_1_5) AND FIREABLE(t1_1_2_1_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_4_4_3_3) AND FIREABLE(t1_2_5_1_5) AND FIREABLE(t1_1_2_1_3))))
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(t1_4_4_3_3) AND FIREABLE(t1_2_5_1_5) AND FIREABLE(t1_1_2_1_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 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_2_5_1_4) OR NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_3_1_4_1) OR FIREABLE(t1_2_4_3_4))))
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_2_5_1_4) OR NOT FIREABLE(t1_5_4_4_3) OR NOT FIREABLE(t1_3_1_4_1) OR FIREABLE(t1_2_4_3_4))))
lola: processed formula length: 117
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_2_5_1_4) AND FIREABLE(t1_5_4_4_3) AND FIREABLE(t1_3_1_4_1) AND NOT FIREABLE(t1_2_4_3_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_2_5_1_5)) AND FIREABLE(t1_5_1_5_2) AND NOT FIREABLE(t1_3_3_2_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 (((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_2_5_1_5)) AND FIREABLE(t1_5_1_5_2) AND NOT FIREABLE(t1_3_3_2_4))))
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: ((NOT FIREABLE(t1_4_2_3_3) OR NOT FIREABLE(t1_2_5_1_5)) AND FIREABLE(t1_5_1_5_2) AND NOT FIREABLE(t1_3_3_2_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 202 markings, 201 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_2_4_3_5) OR NOT FIREABLE(t1_5_2_5_3) OR FIREABLE(t1_2_4_1_5) OR FIREABLE(t1_3_4_4_4))))
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_2_4_3_5) OR NOT FIREABLE(t1_5_2_5_3) OR FIREABLE(t1_2_4_1_5) OR FIREABLE(t1_3_4_4_4))))
lola: processed formula length: 113
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_2_4_3_5) AND FIREABLE(t1_5_2_5_3) AND NOT FIREABLE(t1_2_4_1_5) AND NOT FIREABLE(t1_3_4_4_4))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_1_3_2_4) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_3_3_3_4)) OR FIREABLE(t1_3_3_2_2) OR FIREABLE(t1_4_3_5_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 ((FIREABLE(t1_1_3_2_4) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_3_2_4) AND FIREABLE(t1_3_3_3_4)) OR FIREABLE(t1_3_3_2_2) OR FIREABLE(t1_4_3_5_3))))
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: (NOT FIREABLE(t1_1_3_2_4) AND NOT FIREABLE(t1_3_3_2_4) AND (NOT FIREABLE(t1_1_3_2_4) OR NOT FIREABLE(t1_3_3_3_4)) AND NOT FIREABLE(t1_3_3_2_2) AND NOT FIREABLE(t1_4_3_5_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_4_2_5_1) OR FIREABLE(t1_4_4_3_5)) AND NOT FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_4_4_5_3) AND FIREABLE(t1_1_4_1_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_4_2_5_1) OR FIREABLE(t1_4_4_3_5)) AND NOT FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_4_4_5_3) AND FIREABLE(t1_1_4_1_3))))
lola: processed formula length: 136
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_4_2_5_1) OR FIREABLE(t1_4_4_3_5)) AND NOT FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_4_4_5_3) AND FIREABLE(t1_1_4_1_3))
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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_3_2_4_3) OR NOT FIREABLE(t1_2_3_3_4) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_1_3_1_2) OR FIREABLE(t1_5_5_4_4))))
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_3_2_4_3) OR NOT FIREABLE(t1_2_3_3_4) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_1_3_1_2) OR FIREABLE(t1_5_5_4_4))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t1_3_2_4_3) AND FIREABLE(t1_2_3_3_4) AND FIREABLE(t1_2_4_1_5) AND FIREABLE(t1_1_3_1_2) AND NOT FIREABLE(t1_5_5_4_4))
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_4_1_3_1) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_2_1_3) AND FIREABLE(t1_4_4_3_5)) OR FIREABLE(t1_2_4_2_5) OR FIREABLE(t1_2_4_2_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 ((FIREABLE(t1_4_1_3_1) OR FIREABLE(t1_3_3_2_4) OR (FIREABLE(t1_1_2_1_3) AND FIREABLE(t1_4_4_3_5)) OR FIREABLE(t1_2_4_2_5) OR FIREABLE(t1_2_4_2_3))))
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: (NOT FIREABLE(t1_4_1_3_1) AND NOT FIREABLE(t1_3_3_2_4) AND (NOT FIREABLE(t1_1_2_1_3) OR NOT FIREABLE(t1_4_4_3_5)) AND NOT FIREABLE(t1_2_4_2_5) AND NOT FIREABLE(t1_2_4_2_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_3_3_3) AND FIREABLE(t1_4_2_3_3) AND (NOT FIREABLE(t1_5_2_5_3) OR NOT FIREABLE(t1_1_3_2_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_3_4_4_3) AND FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_3_3_3) AND FIREABLE(t1_4_2_3_3) AND (NOT FIREABLE(t1_5_2_5_3) OR NOT FIREABLE(t1_1_3_2_2)))))
lola: processed formula length: 165
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: formula 0: (FIREABLE(t1_3_4_4_3) AND FIREABLE(t1_4_5_3_4) AND FIREABLE(t1_2_3_3_3) AND FIREABLE(t1_4_2_3_3) AND (NOT FIREABLE(t1_5_2_5_3) OR NOT FIREABLE(t1_1_3_2_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_1_1_2_1) AND FIREABLE(t1_2_3_3_4)) OR (NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_1_2_2_1)) OR FIREABLE(t1_3_3_3_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 (((FIREABLE(t1_2_1_3_1) AND FIREABLE(t1_1_1_2_1) AND FIREABLE(t1_2_3_3_4)) OR (NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_1_2_2_1)) OR FIREABLE(t1_3_3_3_2))))
lola: processed formula length: 163
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: ((NOT FIREABLE(t1_2_1_3_1) OR NOT FIREABLE(t1_1_1_2_1) OR NOT FIREABLE(t1_2_3_3_4)) AND (FIREABLE(t1_4_1_3_1) OR NOT FIREABLE(t1_1_2_2_1)) AND NOT FIREABLE(t1_3_3_3_2))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_4_1_5_2) AND NOT FIREABLE(t1_3_1_4_1) AND NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_3_4_3_3) AND NOT FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_3_3_4_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 ((NOT FIREABLE(t1_4_1_5_2) AND NOT FIREABLE(t1_3_1_4_1) AND NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_3_4_3_3) AND NOT FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_3_3_4_3))))
lola: processed formula length: 175
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (NOT FIREABLE(t1_4_1_5_2) AND NOT FIREABLE(t1_3_1_4_1) AND NOT FIREABLE(t1_2_4_2_3) AND NOT FIREABLE(t1_3_4_3_3) AND NOT FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_3_3_4_3))
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_4_5_3_5) AND FIREABLE(t1_4_3_5_3) AND NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_3_1_4_2) AND FIREABLE(t1_4_2_4_1) AND NOT FIREABLE(t1_5_4_4_4) AND FIREABLE(t1_3_4_4_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_4_5_3_5) AND FIREABLE(t1_4_3_5_3) AND NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_3_1_4_2) AND FIREABLE(t1_4_2_4_1) AND NOT FIREABLE(t1_5_4_4_4) AND FIREABLE(t1_3_4_4_3))))
lola: processed formula length: 188
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_4_5_3_5) AND FIREABLE(t1_4_3_5_3) AND NOT FIREABLE(t1_4_1_3_1) AND FIREABLE(t1_3_1_4_2) AND FIREABLE(t1_4_2_4_1) AND NOT FIREABLE(t1_5_4_4_4) AND FIREABLE(t1_3_4_4_3))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_4_1_5_1) OR NOT FIREABLE(t1_3_4_2_4) OR (NOT FIREABLE(t1_3_4_2_3) AND NOT FIREABLE(t1_3_2_4_2)) OR NOT FIREABLE(t1_4_4_4_3) OR NOT FIREABLE(t1_2_4_3_5) OR (FIREABLE(t1_1_3_2_2) AND FIREABLE(t1_3_2_2_2)) OR (FIREABLE(t1_2_2_3_3) AND FIREABLE(t1_4_4_3_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(t1_4_1_5_1) OR NOT FIREABLE(t1_3_4_2_4) OR (NOT FIREABLE(t1_3_4_2_3) AND NOT FIREABLE(t1_3_2_4_2)) OR NOT FIREABLE(t1_4_4_4_3) OR NOT FIREABLE(t1_2_4_3_5) OR (FIREABLE(t1_1_3_2_2) AND FIREABLE(t1_3_2_2_2)) OR (FIREABLE(t1_2_2_3_3) AND FIREABLE(t1_4_4_3_3)))))
lola: processed formula length: 285
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) AND FIREABLE(t1_3_4_2_4) AND (FIREABLE(t1_3_4_2_3) OR FIREABLE(t1_3_2_4_2)) AND FIREABLE(t1_4_4_4_3) AND FIREABLE(t1_2_4_3_5) AND (NOT FIREABLE(t1_1_3_2_2) OR NOT FIREABLE(t1_3_2_2_2)) AND (NOT FIREABLE(t1_2_2_3_3) OR NOT FIREABLE(t1_4_4_3_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 21 literals and 3 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 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_2_3_1_4) AND FIREABLE(t1_4_3_3_2) AND NOT FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_5_2_4_1) AND FIREABLE(t1_1_5_2_5) AND FIREABLE(t1_5_1_4_1) AND FIREABLE(t1_5_3_5_4) AND FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_2_3_3_4) AND (FIREABLE(t1_4_5_3_5) OR FIREABLE(t1_4_3_3_3) OR FIREABLE(t1_4_2_3_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_2_3_1_4) AND FIREABLE(t1_4_3_3_2) AND NOT FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_5_2_4_1) AND FIREABLE(t1_1_5_2_5) AND FIREABLE(t1_5_1_4_1) AND FIREABLE(t1_5_3_5_4) AND FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_2_3_3_4) AND (FIREABLE(t1_4_5_3_5) OR FIREABLE(t1_4_3_3_3) OR FIREABLE(t1_4_2_3_2)))))
lola: processed formula length: 311
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_3_1_4) AND FIREABLE(t1_4_3_3_2) AND NOT FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_5_2_4_1) AND FIREABLE(t1_1_5_2_5) AND FIREABLE(t1_5_1_4_1) AND FIREABLE(t1_5_3_5_4) AND FIREABLE(t1_1_4_2_4) AND FIREABLE(t1_2_3_3_4) AND (FIREABLE(t1_4_5_3_5) OR FIREABLE(t1_4_3_3_3) OR FIREABLE(t1_4_2_3_2)))
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: RESULT
lola:
SUMMARY: no no no yes no no no no no yes yes yes yes no yes yes
lola:
preliminary result: no no no yes no no no no no yes yes yes yes no yes yes
lola: memory consumption: 15372 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552549827689
--------------------
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-D05N200"
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-D05N200, 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-155234654500045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N200.tgz
mv Diffusion2D-PT-D05N200 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 ;