About the Execution of LoLA for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4266.500 | 28672.00 | 6289.00 | 19.90 | TTTFFFFFTFTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r126-oct2-155274853400270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is QuasiCertifProtocol-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-oct2-155274853400270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.8K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.7K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 153K 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 QuasiCertifProtocol-PT-06-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553897441456
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ QuasiCertifProtocol-PT-06 @ 3570 seconds
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3541
rslt: Output for ReachabilityFireability @ QuasiCertifProtocol-PT-06
{
"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": "Fri Mar 29 22:10:41 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(Sperform_1)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(Sperform_1)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 19,
"markings": 20,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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(CgenCertif_6) OR NOT FIREABLE(malC1_3))))",
"processed_size": 62,
"rewrites": 2
},
"result":
{
"edges": 54,
"markings": 55,
"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": 10,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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(malA5) AND FIREABLE(malA3))))",
"processed_size": 45,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(malS4_6) AND NOT FIREABLE(SgetTS_1))))",
"processed_size": 58,
"rewrites": 2
},
"result":
{
"edges": 20,
"markings": 21,
"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": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(AendCS) AND (FIREABLE(malA2) OR FIREABLE(AstartCS)))))",
"processed_size": 71,
"rewrites": 1
},
"result":
{
"edges": 51381,
"markings": 16811,
"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": 18,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((((FIREABLE(SgetTS_5) AND FIREABLE(malS5_5)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(SgetTS_1))) AND FIREABLE(ScertCS_4))))",
"processed_size": 159,
"rewrites": 1
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 37,
"problems": 10
},
"type": "reachability",
"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": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(SackCS_3) AND (((FIREABLE(AgetTS) OR FIREABLE(CsendTS1_4)) AND NOT FIREABLE(malS1_5)) OR ((FIREABLE(CgenCertif_6) OR FIREABLE(malC1_3)) AND FIREABLE(CgenCertif_2))))))",
"processed_size": 186,
"rewrites": 1
},
"result":
{
"edges": 37237,
"markings": 13295,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 74,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": 7,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2))))",
"processed_size": 173,
"rewrites": 1
},
"result":
{
"edges": 41,
"markings": 42,
"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": 7,
"problems": 7
},
"type": "reachability",
"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": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(malS3_4) AND NOT FIREABLE(malS3_3) AND NOT FIREABLE(malS3_6) AND NOT FIREABLE(malS3_5) AND NOT FIREABLE(malS3_0) AND NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2))))",
"processed_size": 187,
"rewrites": 2
},
"result":
{
"edges": 11,
"markings": 12,
"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": 14,
"problems": 7
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_5) OR NOT FIREABLE(malS4_5) OR FIREABLE(SgetTS_3) OR NOT FIREABLE(malS3_3) OR (NOT FIREABLE(malC1_3) AND NOT FIREABLE(malS1_6)))))",
"processed_size": 180,
"rewrites": 2
},
"result":
{
"edges": 108175,
"markings": 52344,
"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": 9216,
"problems": 1024
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((NOT FIREABLE(malS6_3) AND (FIREABLE(ScertCS_0) OR FIREABLE(SsendTS_2)) AND (FIREABLE(malS3_6) OR FIREABLE(Sperform_0) OR NOT FIREABLE(malS4_5)) AND (FIREABLE(malS3_0) OR FIREABLE(CsendTS1_2)))))",
"processed_size": 205,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 204,
"problems": 20
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 14,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 15,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (G ((((FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3)) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6))) OR NOT FIREABLE(malA5))))",
"processed_size": 364,
"rewrites": 2
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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": 15,
"unfir": 8,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR NOT FIREABLE(AgetTS) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)))))",
"processed_size": 368,
"rewrites": 2
},
"result":
{
"edges": 25501,
"markings": 8237,
"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": 119,
"problems": 7
},
"type": "invariance",
"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": 1,
"adisj": 1,
"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": 16,
"unfir": 8,
"visible_places": 0,
"visible_transitions": 16
},
"processed": "A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(AgetTS) OR (NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(AstartCS)))))",
"processed_size": 398,
"rewrites": 2
},
"result":
{
"edges": 11,
"markings": 12,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 21,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 21,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 21
},
"processed": "E (F ((FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3))))))",
"processed_size": 487,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 210,
"problems": 56
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 16232,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "yes yes yes no no no no no yes no yes no yes no no yes ",
"value": "yes yes yes no no no no no yes no yes no yes no no 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: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3)))))) : A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR NOT FIREABLE(AgetTS) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6))))) : E (F ((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2)))) : E (F ((FIREABLE(malA5) AND FIREABLE(malA3)))) : A (G ((NOT FIREABLE(malS3_4) AND NOT FIREABLE(malS3_3) AND NOT FIREABLE(malS3_6) AND NOT FIREABLE(malS3_5) AND NOT FIREABLE(malS3_0) AND NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2)))) : A (G ((((FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3)) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6))) OR NOT FIREABLE(malA5)))) : A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(AgetTS) OR (NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(AstartCS))))) : E (F ((FIREABLE(AendCS) AND (FIREABLE(malA2) OR FIREABLE(AstartCS))))) : E (F (FIREABLE(Sperform_1))) : A (G ((NOT FIREABLE(CgenCertif_6) OR NOT FIREABLE(malC1_3)))) : E (F ((((FIREABLE(SgetTS_5) AND FIREABLE(malS5_5)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(SgetTS_1))) AND FIREABLE(ScertCS_4)))) : E (F ((FIREABLE(SackCS_3) AND (((FIREABLE(AgetTS) OR FIREABLE(CsendTS1_4)) AND NOT FIREABLE(malS1_5)) OR ((FIREABLE(CgenCertif_6) OR FIREABLE(malC1_3)) AND FIREABLE(CgenCertif_2)))))) : E (F (FIREABLE(Sperform_1))) : E (F ((NOT FIREABLE(malS6_3) AND (FIREABLE(ScertCS_0) OR FIREABLE(SsendTS_2)) AND (FIREABLE(malS3_6) OR FIREABLE(Sperform_0) OR NOT FIREABLE(malS4_5)) AND (FIREABLE(malS3_0) OR FIREABLE(CsendTS1_2))))) : A (G ((NOT FIREABLE(malS4_6) AND NOT FIREABLE(SgetTS_1)))) : A (G ((FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_5) OR NOT FIREABLE(malS4_5) OR FIREABLE(SgetTS_3) OR NOT FIREABLE(malS3_3) OR (NOT FIREABLE(malC1_3) AND NOT FIREABLE(malS1_6)))))
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(Sperform_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(Sperform_1)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(Sperform_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Sperform_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(Sperform_1)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(Sperform_1)
lola: state equation: calling and running sara
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(CgenCertif_6) OR NOT FIREABLE(malC1_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(CgenCertif_6) OR NOT FIREABLE(malC1_3))))
lola: processed formula length: 62
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: ========================================
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(CgenCertif_6) AND FIREABLE(malC1_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: sara: The predicate is not invariant.try reading problem file ReachabilityFireability-0.sara.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malA5) AND FIREABLE(malA3))))
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(malA5) AND FIREABLE(malA3))))
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(malA5) AND FIREABLE(malA3))
sara: place or transition ordering is non-deterministic
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 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.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malS4_6) AND NOT FIREABLE(SgetTS_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((NOT FIREABLE(malS4_6) AND NOT FIREABLE(SgetTS_1))))
lola: processed formula length: 58
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(malS4_6) OR FIREABLE(SgetTS_1))
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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(AendCS) AND (FIREABLE(malA2) OR FIREABLE(AstartCS)))))
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(AendCS) AND (FIREABLE(malA2) OR FIREABLE(AstartCS)))))
lola: processed formula length: 71
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(AendCS) AND (FIREABLE(malA2) OR FIREABLE(AstartCS)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 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.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 16811 markings, 51381 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(SgetTS_5) AND FIREABLE(malS5_5)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(SgetTS_1))) AND FIREABLE(ScertCS_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((FIREABLE(SgetTS_5) AND FIREABLE(malS5_5)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(SgetTS_1))) AND FIREABLE(ScertCS_4))))
lola: processed formula length: 159
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(SgetTS_5) AND FIREABLE(malS5_5)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(SgetTS_1))) AND FIREABLE(ScertCS_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 37 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SackCS_3) AND (((FIREABLE(AgetTS) OR FIREABLE(CsendTS1_4)) AND NOT FIREABLE(malS1_5)) OR ((FIREABLE(CgenCertif_6) OR FIREABLE(malC1_3)) AND FIREABLE(CgenCertif_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(SackCS_3) AND (((FIREABLE(AgetTS) OR FIREABLE(CsendTS1_4)) AND NOT FIREABLE(malS1_5)) OR ((FIREABLE(CgenCertif_6) OR FIREABLE(malC1_3)) AND FIREABLE(CgenCertif_2))))))
lola: processed formula length: 186
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(SackCS_3) AND (((FIREABLE(AgetTS) OR FIREABLE(CsendTS1_4)) AND NOT FIREABLE(malS1_5)) OR ((FIREABLE(CgenCertif_6) OR FIREABLE(malC1_3)) AND FIREABLE(CgenCertif_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 74 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 13295 markings, 37237 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_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(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2))))
lola: processed formula length: 173
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(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malS3_4) AND NOT FIREABLE(malS3_3) AND NOT FIREABLE(malS3_6) AND NOT FIREABLE(malS3_5) AND NOT FIREABLE(malS3_0) AND NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((NOT FIREABLE(malS3_4) AND NOT FIREABLE(malS3_3) AND NOT FIREABLE(malS3_6) AND NOT FIREABLE(malS3_5) AND NOT FIREABLE(malS3_0) AND NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2))))
lola: processed formula length: 187
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(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_5) OR NOT FIREABLE(malS4_5) OR FIREABLE(SgetTS_3) OR NOT FIREABLE(malS3_3) OR (NOT FIREABLE(malC1_3) AND NOT FIREABLE(malS1_6)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_5) OR NOT FIREABLE(malS4_5) OR FIREABLE(SgetTS_3) OR NOT FIREABLE(malS3_3) OR (NOT FIREABLE(malC1_3) AND NOT FIREABLE(malS1_6)))))
lola: processed formula length: 180
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(SgetTS_2) AND NOT FIREABLE(SgetTS_5) AND FIREABLE(malS4_5) AND NOT FIREABLE(SgetTS_3) AND FIREABLE(malS3_3) AND (FIREABLE(malC1_3) OR FIREABLE(malS1_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9216 literals and 1024 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.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 52344 markings, 108175 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(malS6_3) AND (FIREABLE(ScertCS_0) OR FIREABLE(SsendTS_2)) AND (FIREABLE(malS3_6) OR FIREABLE(Sperform_0) OR NOT FIREABLE(malS4_5)) AND (FIREABLE(malS3_0) OR FIREABLE(CsendTS1_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 ((NOT FIREABLE(malS6_3) AND (FIREABLE(ScertCS_0) OR FIREABLE(SsendTS_2)) AND (FIREABLE(malS3_6) OR FIREABLE(Sperform_0) OR NOT FIREABLE(malS4_5)) AND (FIREABLE(malS3_0) OR FIREABLE(CsendTS1_2)))))
lola: processed formula length: 205
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(malS6_3) AND (FIREABLE(ScertCS_0) OR FIREABLE(SsendTS_2)) AND (FIREABLE(malS3_6) OR FIREABLE(Sperform_0) OR NOT FIREABLE(malS4_5)) AND (FIREABLE(malS3_0) OR FIREABLE(CsendTS1_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 204 literals and 20 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.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3)) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6))) OR NOT FIREABLE(malA5))))
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(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3)) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6))) OR NOT FIREABLE(malA5))))
lola: processed formula length: 364
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(SsendTS_2) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_3)) OR (NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6))) AND FIREABLE(malA5))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR NOT FIREABLE(AgetTS) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR NOT FIREABLE(AgetTS) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_6)))))
lola: processed formula length: 368
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(malS6_3) AND NOT FIREABLE(malS6_2) AND NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS6_6) AND NOT FIREABLE(malS6_5) AND NOT FIREABLE(malS6_4) AND FIREABLE(AgetTS) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 119 literals and 7 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.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8237 markings, 25501 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(AgetTS) OR (NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(AstartCS)))))
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(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_5) OR FIREABLE(malS6_4) OR FIREABLE(AgetTS) OR (NOT FIREABLE(SackCS_3) AND NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0) AND NOT FIREABLE(SackCS_4) AND NOT FIREABLE(SackCS_5) AND NOT FIREABLE(SackCS_6) AND NOT FIREABLE(AstartCS)))))
lola: processed formula length: 398
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(malS6_3) AND NOT FIREABLE(malS6_2) AND NOT FIREABLE(malS6_1) AND NOT FIREABLE(malS6_0) AND NOT FIREABLE(malS6_6) AND NOT FIREABLE(malS6_5) AND NOT FIREABLE(malS6_4) AND NOT FIREABLE(AgetTS) AND (FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(AstartCS)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(... (shortened)
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(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(... (shortened)
lola: processed formula length: 487
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(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR ((FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_6)) AND (FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 210 literals and 56 conjunctive subformulas
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no yes no yes no yes no no yes
lola:
preliminary result: yes yes yes no no no no no yes no yes no yes no no yes
lola: memory consumption: 16232 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553897470128
--------------------
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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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 r126-oct2-155274853400270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 ;