About the Execution of LoLA for RwMutex-PT-r0010w2000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4405.220 | 264608.00 | 524850.00 | 130.10 | TFFFTFFFTTTFFTTT | 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.r148-ebro-155286404000324.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 RwMutex-PT-r0010w2000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-ebro-155286404000324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 4.0K Feb 12 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 12 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 17:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 01:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 11 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 RwMutex-PT-r0010w2000-ReachabilityFireability-00
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-01
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-02
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-03
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-04
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-05
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-06
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-07
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-08
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-09
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-10
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-11
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-12
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-13
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-14
FORMULA_NAME RwMutex-PT-r0010w2000-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553000003124
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ RwMutex-PT-r0010w2000 @ 3570 seconds
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w2000-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3306
rslt: Output for ReachabilityFireability @ RwMutex-PT-r0010w2000
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Mar 19 12:53:23 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": 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(t3194) AND FIREABLE(t1760))))",
"processed_size": 45,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 12,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"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(t2445) OR NOT FIREABLE(t1908))))",
"processed_size": 53,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 12,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(t353) AND (FIREABLE(t373) OR FIREABLE(t837)))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"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": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (G ((FIREABLE(t314) OR FIREABLE(t3391) OR NOT FIREABLE(t501))))",
"processed_size": 67,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 13,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"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": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(t937) AND FIREABLE(t3384) AND NOT FIREABLE(t3294))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 13,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 316
},
"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(t308) OR FIREABLE(t3374)) AND FIREABLE(t1791) AND FIREABLE(t3318) AND NOT FIREABLE(t1616))))",
"processed_size": 110,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 38,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 346
},
"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(t2449) AND NOT FIREABLE(t3199) AND (FIREABLE(t232) OR FIREABLE(t1054)) AND FIREABLE(t3297))))",
"processed_size": 110,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 28,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"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": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(t2118) OR NOT FIREABLE(t2285) OR (NOT FIREABLE(t3613) AND NOT FIREABLE(t2922)) OR FIREABLE(t1023))))",
"processed_size": 123,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 88,
"problems": 22
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(t2488) OR NOT FIREABLE(t3369) OR (NOT FIREABLE(t3713) AND NOT FIREABLE(t162)) OR NOT FIREABLE(t1347))))",
"processed_size": 126,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 38,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 488
},
"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": 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": "A (G (((FIREABLE(t1617) AND FIREABLE(t2662)) OR FIREABLE(t3129) OR NOT FIREABLE(t2802) OR FIREABLE(t1487) OR NOT FIREABLE(t1805))))",
"processed_size": 135,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 30,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((NOT FIREABLE(t876) AND NOT FIREABLE(t3529) AND FIREABLE(t1584) AND (FIREABLE(t1864) OR (NOT FIREABLE(t2646) AND NOT FIREABLE(t235))))))",
"processed_size": 143,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 39,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 677
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(t96) OR NOT FIREABLE(t1559) OR (NOT FIREABLE(t1597) AND NOT FIREABLE(t2100)) OR NOT FIREABLE(t3267) OR NOT FIREABLE(t2016) OR NOT FIREABLE(t1024))))",
"processed_size": 173,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 82,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 842
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F (((((FIREABLE(t2386) OR FIREABLE(t3118)) AND NOT FIREABLE(t2810)) OR ((FIREABLE(t2748) OR FIREABLE(t539)) AND NOT FIREABLE(t380))) AND FIREABLE(t3061))))",
"processed_size": 161,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 52,
"problems": 14
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1117
},
"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": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G ((NOT FIREABLE(t1209) OR (FIREABLE(t309) AND FIREABLE(t3658)) OR FIREABLE(t3940) OR (FIREABLE(t794) AND FIREABLE(t630)) OR FIREABLE(t18) OR FIREABLE(t2491))))",
"processed_size": 168,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 64,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 8,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G ((NOT FIREABLE(t3186) OR NOT FIREABLE(t3348) OR (NOT FIREABLE(t1634) AND NOT FIREABLE(t2827)) OR ((NOT FIREABLE(t104) OR NOT FIREABLE(t3460)) AND (NOT FIREABLE(t3087) OR NOT FIREABLE(t771))))))",
"processed_size": 203,
"rewrites": 2
},
"result":
{
"edges": 4020,
"markings": 2011,
"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": 80,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3322
},
"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": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F (((NOT FIREABLE(t854) OR FIREABLE(t2068)) AND (FIREABLE(t2940) OR FIREABLE(t3429) OR FIREABLE(t2779) OR FIREABLE(t1165)) AND (FIREABLE(t1353) OR FIREABLE(t2927) OR FIREABLE(t91)))))",
"processed_size": 192,
"rewrites": 1
},
"result":
{
"edges": 4020,
"markings": 2011,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 382,
"problems": 54
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 152920,
"runtime": 264.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 48060,
"conflict_clusters": 2011,
"places": 4030,
"places_significant": 2010,
"singleton_clusters": 0,
"transitions": 4020
},
"result":
{
"preliminary_value": "yes no no no yes no no no yes yes yes no no yes yes yes ",
"value": "yes no no no yes no no no yes yes yes no no yes 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: 8050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4030
lola: finding significant places
lola: 4030 places, 4020 transitions, 2010 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: A (G ((NOT FIREABLE(t96) OR NOT FIREABLE(t1559) OR (NOT FIREABLE(t1597) AND NOT FIREABLE(t2100)) OR NOT FIREABLE(t3267) OR NOT FIREABLE(t2016) OR NOT FIREABLE(t1024)))) : E (F ((NOT FIREABLE(t353) AND (FIREABLE(t373) OR FIREABLE(t837))))) : E (F ((FIREABLE(t2449) AND NOT FIREABLE(t3199) AND (FIREABLE(t232) OR FIREABLE(t1054)) AND FIREABLE(t3297)))) : E (F ((NOT FIREABLE(t876) AND NOT FIREABLE(t3529) AND FIREABLE(t1584) AND (FIREABLE(t1864) OR (NOT FIREABLE(t2646) AND NOT FIREABLE(t235)))))) : A (G (((FIREABLE(t1617) AND FIREABLE(t2662)) OR FIREABLE(t3129) OR NOT FIREABLE(t2802) OR FIREABLE(t1487) OR NOT FIREABLE(t1805)))) : E (F ((FIREABLE(t3194) AND FIREABLE(t1760)))) : E (F (((NOT FIREABLE(t854) OR FIREABLE(t2068)) AND (FIREABLE(t2940) OR FIREABLE(t3429) OR FIREABLE(t2779) OR FIREABLE(t1165)) AND (FIREABLE(t1353) OR FIREABLE(t2927) OR FIREABLE(t91))))) : E (F (((((FIREABLE(t2386) OR FIREABLE(t3118)) AND NOT FIREABLE(t2810)) OR ((FIREABLE(t2748) OR FIREABLE(t539)) AND NOT FIREABLE(t380))) AND FIREABLE(t3061)))) : A (G ((NOT FIREABLE(t2445) OR NOT FIREABLE(t1908)))) : A (G ((FIREABLE(t314) OR FIREABLE(t3391) OR NOT FIREABLE(t501)))) : A (G ((NOT FIREABLE(t3186) OR NOT FIREABLE(t3348) OR (NOT FIREABLE(t1634) AND NOT FIREABLE(t2827)) OR ((NOT FIREABLE(t104) OR NOT FIREABLE(t3460)) AND (NOT FIREABLE(t3087) OR NOT FIREABLE(t771)))))) : E (F (((FIREABLE(t308) OR FIREABLE(t3374)) AND FIREABLE(t1791) AND FIREABLE(t3318) AND NOT FIREABLE(t1616)))) : E (F ((FIREABLE(t937) AND FIREABLE(t3384) AND NOT FIREABLE(t3294)))) : A (G ((NOT FIREABLE(t2118) OR NOT FIREABLE(t2285) OR (NOT FIREABLE(t3613) AND NOT FIREABLE(t2922)) OR FIREABLE(t1023)))) : A (G ((NOT FIREABLE(t1209) OR (FIREABLE(t309) AND FIREABLE(t3658)) OR FIREABLE(t3940) OR (FIREABLE(t794) AND FIREABLE(t630)) OR FIREABLE(t18) OR FIREABLE(t2491)))) : A (G ((NOT FIREABLE(t2488) OR NOT FIREABLE(t3369) OR (NOT FIREABLE(t3713) AND NOT FIREABLE(t162)) OR NOT FIREABLE(t1347))))
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(t3194) AND FIREABLE(t1760))))
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(t3194) AND FIREABLE(t1760))))
lola: processed formula length: 45
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(t3194) AND FIREABLE(t1760))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 621 markings, 1239 edges, 124 markings/sec, 0 secs
lola: sara is running 5 secs || 1254 markings, 2505 edges, 127 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1893 markings, 3783 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2445) OR NOT FIREABLE(t1908))))
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(t2445) OR NOT FIREABLE(t1908))))
lola: processed formula length: 53
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(t2445) AND FIREABLE(t1908))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 637 markings, 1271 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1275 markings, 2547 edges, 128 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1915 markings, 3827 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t353) AND (FIREABLE(t373) OR FIREABLE(t837)))))
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(t353) AND (FIREABLE(t373) OR FIREABLE(t837)))))
lola: processed formula length: 68
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(t353) AND (FIREABLE(t373) OR FIREABLE(t837)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
lola: sara is running 0 secs || 628 markings, 1253 edges, 126 markings/sec, 0 secs
lola: sara is running 5 secs || 1248 markings, 2493 edges, 124 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1883 markings, 3763 edges, 127 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t314) OR FIREABLE(t3391) OR NOT FIREABLE(t501))))
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(t314) OR FIREABLE(t3391) OR NOT FIREABLE(t501))))
lola: processed formula length: 67
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(t314) AND NOT FIREABLE(t3391) AND FIREABLE(t501))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
lola: sara is running 0 secs || 635 markings, 1267 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1273 markings, 2543 edges, 128 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1905 markings, 3807 edges, 126 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t937) AND FIREABLE(t3384) AND NOT FIREABLE(t3294))))
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(t937) AND FIREABLE(t3384) AND NOT FIREABLE(t3294))))
lola: processed formula length: 68
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(t937) AND FIREABLE(t3384) AND NOT FIREABLE(t3294))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
lola: sara is running 0 secs || 629 markings, 1255 edges, 126 markings/sec, 0 secs
lola: sara is running 5 secs || 1257 markings, 2511 edges, 126 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1896 markings, 3789 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t308) OR FIREABLE(t3374)) AND FIREABLE(t1791) AND FIREABLE(t3318) AND NOT FIREABLE(t1616))))
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(t308) OR FIREABLE(t3374)) AND FIREABLE(t1791) AND FIREABLE(t3318) AND NOT FIREABLE(t1616))))
lola: processed formula length: 110
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(t308) OR FIREABLE(t3374)) AND FIREABLE(t1791) AND FIREABLE(t3318) AND NOT FIREABLE(t1616))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 38 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
lola: sara is running 0 secs || 624 markings, 1245 edges, 125 markings/sec, 0 secs
lola: sara is running 5 secs || 1260 markings, 2517 edges, 127 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1887 markings, 3771 edges, 125 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2449) AND NOT FIREABLE(t3199) AND (FIREABLE(t232) OR FIREABLE(t1054)) AND FIREABLE(t3297))))
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(t2449) AND NOT FIREABLE(t3199) AND (FIREABLE(t232) OR FIREABLE(t1054)) AND FIREABLE(t3297))))
lola: processed formula length: 110
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(t2449) AND NOT FIREABLE(t3199) AND (FIREABLE(t232) OR FIREABLE(t1054)) AND FIREABLE(t3297))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 28 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
lola: sara is running 0 secs || 628 markings, 1253 edges, 126 markings/sec, 0 secs
lola: sara is running 5 secs || 1264 markings, 2525 edges, 127 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1902 markings, 3801 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2118) OR NOT FIREABLE(t2285) OR (NOT FIREABLE(t3613) AND NOT FIREABLE(t2922)) OR FIREABLE(t1023))))
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(t2118) OR NOT FIREABLE(t2285) OR (NOT FIREABLE(t3613) AND NOT FIREABLE(t2922)) OR FIREABLE(t1023))))
lola: processed formula length: 123
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(t2118) AND FIREABLE(t2285) AND (FIREABLE(t3613) OR FIREABLE(t2922)) AND NOT FIREABLE(t1023))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 88 literals and 22 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-0.sara.
lola: sara is running 0 secs || 636 markings, 1269 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1266 markings, 2529 edges, 126 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1904 markings, 3805 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2488) OR NOT FIREABLE(t3369) OR (NOT FIREABLE(t3713) AND NOT FIREABLE(t162)) OR NOT FIREABLE(t1347))))
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(t2488) OR NOT FIREABLE(t3369) OR (NOT FIREABLE(t3713) AND NOT FIREABLE(t162)) OR NOT FIREABLE(t1347))))
lola: processed formula length: 126
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(t2488) AND FIREABLE(t3369) AND (FIREABLE(t3713) OR FIREABLE(t162)) AND FIREABLE(t1347))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 38 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
lola: sara is running 0 secs || 626 markings, 1249 edges, 125 markings/sec, 0 secs
lola: sara is running 5 secs || 1241 markings, 2479 edges, 123 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1879 markings, 3755 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1617) AND FIREABLE(t2662)) OR FIREABLE(t3129) OR NOT FIREABLE(t2802) OR FIREABLE(t1487) OR NOT FIREABLE(t1805))))
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(t1617) AND FIREABLE(t2662)) OR FIREABLE(t3129) OR NOT FIREABLE(t2802) OR FIREABLE(t1487) OR NOT FIREABLE(t1805))))
lola: processed formula length: 135
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(t1617) OR NOT FIREABLE(t2662)) AND NOT FIREABLE(t3129) AND FIREABLE(t2802) AND NOT FIREABLE(t1487) AND FIREABLE(t1805))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-9-0.sara.
lola: sara is running 0 secs || 604 markings, 1205 edges, 121 markings/sec, 0 secs
lola: sara is running 5 secs || 1234 markings, 2465 edges, 126 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1862 markings, 3721 edges, 126 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t876) AND NOT FIREABLE(t3529) AND FIREABLE(t1584) AND (FIREABLE(t1864) OR (NOT FIREABLE(t2646) AND NOT FIREABLE(t235))))))
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(t876) AND NOT FIREABLE(t3529) AND FIREABLE(t1584) AND (FIREABLE(t1864) OR (NOT FIREABLE(t2646) AND NOT FIREABLE(t235))))))
lola: processed formula length: 143
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(t876) AND NOT FIREABLE(t3529) AND FIREABLE(t1584) AND (FIREABLE(t1864) OR (NOT FIREABLE(t2646) AND NOT FIREABLE(t235))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 39 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-10-0.sara.
lola: sara is running 0 secs || 630 markings, 1257 edges, 126 markings/sec, 0 secs
lola: sara is running 5 secs || 1245 markings, 2487 edges, 123 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1879 markings, 3755 edges, 127 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t96) OR NOT FIREABLE(t1559) OR (NOT FIREABLE(t1597) AND NOT FIREABLE(t2100)) OR NOT FIREABLE(t3267) OR NOT FIREABLE(t2016) OR NOT FIREABLE(t1024))))
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(t96) OR NOT FIREABLE(t1559) OR (NOT FIREABLE(t1597) AND NOT FIREABLE(t2100)) OR NOT FIREABLE(t3267) OR NOT FIREABLE(t2016) OR NOT FIREABLE(t1024))))
lola: processed formula length: 173
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(t96) AND FIREABLE(t1559) AND (FIREABLE(t1597) OR FIREABLE(t2100)) AND FIREABLE(t3267) AND FIREABLE(t2016) AND FIREABLE(t1024))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 82 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-11-0.sara.
lola: sara is running 0 secs || 636 markings, 1269 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1275 markings, 2547 edges, 128 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1904 markings, 3805 edges, 126 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 12 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(t2386) OR FIREABLE(t3118)) AND NOT FIREABLE(t2810)) OR ((FIREABLE(t2748) OR FIREABLE(t539)) AND NOT FIREABLE(t380))) AND FIREABLE(t3061))))
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(t2386) OR FIREABLE(t3118)) AND NOT FIREABLE(t2810)) OR ((FIREABLE(t2748) OR FIREABLE(t539)) AND NOT FIREABLE(t380))) AND FIREABLE(t3061))))
lola: processed formula length: 161
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(t2386) OR FIREABLE(t3118)) AND NOT FIREABLE(t2810)) OR ((FIREABLE(t2748) OR FIREABLE(t539)) AND NOT FIREABLE(t380))) AND FIREABLE(t3061))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 52 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-12-0.sara.
lola: sara is running 0 secs || 634 markings, 1265 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1266 markings, 2529 edges, 126 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1906 markings, 3809 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1209) OR (FIREABLE(t309) AND FIREABLE(t3658)) OR FIREABLE(t3940) OR (FIREABLE(t794) AND FIREABLE(t630)) OR FIREABLE(t18) OR FIREABLE(t2491))))
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(t1209) OR (FIREABLE(t309) AND FIREABLE(t3658)) OR FIREABLE(t3940) OR (FIREABLE(t794) AND FIREABLE(t630)) OR FIREABLE(t18) OR FIREABLE(t2491))))
lola: processed formula length: 168
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(t1209) AND (NOT FIREABLE(t309) OR NOT FIREABLE(t3658)) AND NOT FIREABLE(t3940) AND (NOT FIREABLE(t794) OR NOT FIREABLE(t630)) AND NOT FIREABLE(t18) AND NOT FIREABLE(t2491))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 64 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-13-0.sara.
lola: sara is running 0 secs || 637 markings, 1271 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1262 markings, 2521 edges, 125 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1903 markings, 3803 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 14 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3186) OR NOT FIREABLE(t3348) OR (NOT FIREABLE(t1634) AND NOT FIREABLE(t2827)) OR ((NOT FIREABLE(t104) OR NOT FIREABLE(t3460)) AND (NOT FIREABLE(t3087) OR NOT FIREABLE(t771))))))
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(t3186) OR NOT FIREABLE(t3348) OR (NOT FIREABLE(t1634) AND NOT FIREABLE(t2827)) OR ((NOT FIREABLE(t104) OR NOT FIREABLE(t3460)) AND (NOT FIREABLE(t3087) OR NOT FIREABLE(t771))))))
lola: processed formula length: 203
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(t3186) AND FIREABLE(t3348) AND (FIREABLE(t1634) OR FIREABLE(t2827)) AND ((FIREABLE(t104) AND FIREABLE(t3460)) OR (FIREABLE(t3087) AND FIREABLE(t771))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 80 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-14-0.sara.
lola: sara is running 0 secs || 637 markings, 1271 edges, 127 markings/sec, 0 secs
lola: sara is running 5 secs || 1276 markings, 2549 edges, 128 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1916 markings, 3829 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: subprocess 15 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t854) OR FIREABLE(t2068)) AND (FIREABLE(t2940) OR FIREABLE(t3429) OR FIREABLE(t2779) OR FIREABLE(t1165)) AND (FIREABLE(t1353) OR FIREABLE(t2927) OR FIREABLE(t91)))))
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(t854) OR FIREABLE(t2068)) AND (FIREABLE(t2940) OR FIREABLE(t3429) OR FIREABLE(t2779) OR FIREABLE(t1165)) AND (FIREABLE(t1353) OR FIREABLE(t2927) OR FIREABLE(t91)))))
lola: processed formula length: 192
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(t854) OR FIREABLE(t2068)) AND (FIREABLE(t2940) OR FIREABLE(t3429) OR FIREABLE(t2779) OR FIREABLE(t1165)) AND (FIREABLE(t1353) OR FIREABLE(t2927) OR FIREABLE(t91)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 382 literals and 54 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-15-0.sara.
lola: sara is running 0 secs || 641 markings, 1279 edges, 128 markings/sec, 0 secs
lola: sara is running 5 secs || 1284 markings, 2565 edges, 129 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1926 markings, 3849 edges, 128 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2011 markings, 4020 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no no yes yes yes no no yes yes yes
lola:
preliminary result: yes no no no yes no no no yes yes yes no no yes yes yes
lola: memory consumption: 152920 KB
lola: time consumption: 264 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553000267732
--------------------
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="RwMutex-PT-r0010w2000"
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 RwMutex-PT-r0010w2000, 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 r148-ebro-155286404000324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w2000.tgz
mv RwMutex-PT-r0010w2000 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 ;