About the Execution of 2019-Gold for QuasiCertifProtocol-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4288.880 | 10005.00 | 10607.00 | 12.60 | TTFFFTTFTTFFFFFF | 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/mcc2020-input.r135-tajo-158961409100201.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961409100201
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 26K Apr 12 06:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 06:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 07:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 10 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 9 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 686K Mar 24 05:37 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-18-00
FORMULA_NAME QuasiCertifProtocol-PT-18-01
FORMULA_NAME QuasiCertifProtocol-PT-18-02
FORMULA_NAME QuasiCertifProtocol-PT-18-03
FORMULA_NAME QuasiCertifProtocol-PT-18-04
FORMULA_NAME QuasiCertifProtocol-PT-18-05
FORMULA_NAME QuasiCertifProtocol-PT-18-06
FORMULA_NAME QuasiCertifProtocol-PT-18-07
FORMULA_NAME QuasiCertifProtocol-PT-18-08
FORMULA_NAME QuasiCertifProtocol-PT-18-09
FORMULA_NAME QuasiCertifProtocol-PT-18-10
FORMULA_NAME QuasiCertifProtocol-PT-18-11
FORMULA_NAME QuasiCertifProtocol-PT-18-12
FORMULA_NAME QuasiCertifProtocol-PT-18-13
FORMULA_NAME QuasiCertifProtocol-PT-18-14
FORMULA_NAME QuasiCertifProtocol-PT-18-15
=== Now, execution of the tool begins
BK_START 1590281270105
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-18 @ 3570 seconds
FORMULA QuasiCertifProtocol-PT-18-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-18-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for LTLCardinality @ QuasiCertifProtocol-PT-18
{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 24 00:47:50 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(AstopAbort <= Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10)",
"processed_size": 231,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 <= a3))))",
"processed_size": 159,
"rewrites": 125
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 77,
"visible_transitions": 0
},
"processed": "A ((X ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + 1 <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 + s3_9 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10)) OR (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18) AND F ((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18))) U (Astart <= s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_18 + s2_17 + s2_16 + s2_15 + s2_14 + s2_13 + s2_12 + s2_11 + s2_10 + s2_9))))",
"processed_size": 761,
"rewrites": 125
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 125
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + 1 <= a5)))",
"processed_size": 159,
"rewrites": 127
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= a1)",
"processed_size": 242,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (X ((a1 + 1 <= SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18)))",
"processed_size": 254,
"rewrites": 125
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(n7_4_18 <= 0)",
"processed_size": 14,
"rewrites": 127
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((n6_5 + 1 <= a3) R (F ((1 <= a4)) AND (G (((n6_11 <= 0) AND X ((a3 <= n6_5)))) R (n6_5 + 1 <= a3)))))",
"processed_size": 105,
"rewrites": 125
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 38,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 38,
"visible_transitions": 0
},
"processed": "(c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + 1 <= n2_18 + n2_17 + n2_16 + n2_15 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9)",
"processed_size": 288,
"rewrites": 127
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 77
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((SstopAbort + 1 <= a2))))",
"processed_size": 34,
"rewrites": 125
},
"result":
{
"edges": 45,
"markings": 44,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (F ((F (((AstopAbort + 1 <= c1_1) R (s4_17 + 1 <= s6_17))) AND ((s4_9 + 1 <= a5) R (s4_17 + 1 <= s6_17)))))",
"processed_size": 109,
"rewrites": 125
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(Cstart_1 + 1 <= n8_10_15)",
"processed_size": 26,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 36164,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "** : A(X(TRUE)) : FALSE : (A(X(((* AND X(*)) OR G(*)))) AND A(G(*))) : (** AND A(X(*))) : A(F(**)) : A(X(F(**))) : A((X(**) OR ((** AND F(**)) U **))) : TRUE : TRUE : A(F(G(*))) : A(F((F((* R *)) AND (* R *)))) : FALSE : (A(F(**)) AND A(X(X(G(**))))) : A((* R (F(**) AND (G((* AND X(*))) R *)))) : (** AND A(G(((** U **) OR (G(**) AND F(**))))))"
},
"net":
{
"arcs": 3119,
"conflict_clusters": 68,
"places": 1398,
"places_significant": 295,
"singleton_clusters": 0,
"transitions": 296
},
"result":
{
"preliminary_value": "yes yes no no no yes yes no yes yes no no no no no no ",
"value": "yes yes no no no yes yes no yes yes no no no no no no "
},
"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: 1694/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44736
lola: finding significant places
lola: 1398 places, 296 transitions, 295 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 LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= a4)
lola: LP says that atomic proposition is always false: (2 <= a1)
lola: LP says that atomic proposition is always false: (2 <= a1)
lola: LP says that atomic proposition is always false: (3 <= n5_11)
lola: LP says that atomic proposition is always false: (2 <= a3)
lola: LP says that atomic proposition is always false: (3 <= Cstart_16)
lola: LP says that atomic proposition is always false: (3 <= Cstart_16)
lola: LP says that atomic proposition is always false: (2 <= s2_7)
lola: LP says that atomic proposition is always false: (3 <= Cstart_16)
lola: LP says that atomic proposition is always false: (3 <= SstopOK_16)
lola: LP says that atomic proposition is always false: (3 <= SstopOK_16)
lola: LP says that atomic proposition is always false: (2 <= Cstart_16)
lola: A (((AstopAbort <= Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10) OR G ((2 <= a4)))) : A ((((SstopAbort <= AstopAbort) U G ((0 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18))) U G (F (X ((0 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18)))))) : A (X (F ((NOT(X ((0 <= c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18))) AND ((1 <= n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0) U X (((Cstart_10 + Cstart_11 + Cstart_12 + Cstart_13 + Cstart_14 + Cstart_15 + Cstart_16 + Cstart_17 + Cstart_18 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18) OR G ((c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18))))))))) : A (NOT((X ((((3 <= n9_2_10 + n9_2_11 + n9_2_12 + n9_2_13 + n9_2_14 + n9_2_15 + n9_2_16 + n9_2_17 + n9_2_18 + n9_14_0 + n9_15_10 + n9_13_0 + n9_16_10 + n9_12_10 + n9_17_10 + n9_18_10 + n9_1_10 + n9_11_10 + n9_10_10 + n9_0_0 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_0_10 + n9_0_11 + n9_0_12 + n9_0_13 + n9_0_14 + n9_0_15 + n9_0_16 + n9_0_17 + n9_0_18 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_0_9 + n9_0_8 + n9_0_7 + n9_0_6 + n9_0_5 + n9_0_4 + n9_0_3 + n9_0_2 + n9_0_1 + n9_11_18 + n9_11_17 + n9_10_11 + n9_10_12 + n9_10_13 + n9_10_14 + n9_10_15 + n9_10_16 + n9_10_17 + n9_10_18 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_11_16 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_11_15 + n9_11_14 + n9_11_13 + n9_11_12 + n9_11_11 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_9_10 + n9_9_11 + n9_9_12 + n9_9_13 + n9_9_14 + n9_9_15 + n9_9_16 + n9_9_17 + n9_9_18 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_1_18 + n9_1_17 + n9_1_16 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_1_15 + n9_1_14 + n9_1_13 + n9_1_12 + n9_1_11 + n9_8_10 + n9_8_11 + n9_8_12 + n9_8_13 + n9_8_14 + n9_8_15 + n9_8_16 + n9_8_17 + n9_8_18 + n9_18_11 + n9_18_12 + n9_18_13 + n9_18_14 + n9_18_15 + n9_18_16 + n9_18_17 + n9_18_18 + n9_12_18 + n9_12_17 + n9_7_10 + n9_7_11 + n9_7_12 + n9_7_13 + n9_7_14 + n9_7_15 + n9_7_16 + n9_7_17 + n9_7_18 + n9_12_16 + n9_12_15 + n9_17_11 + n9_17_12 + n9_17_13 + n9_17_14 + n9_17_15 + n9_17_16 + n9_17_17 + n9_17_18 + n9_12_14 + n9_6_10 + n9_6_11 + n9_6_12 + n9_6_13 + n9_6_14 + n9_6_15 + n9_6_16 + n9_6_17 + n9_6_18 + n9_10_0 + n9_10_1 + n9_10_2 + n9_10_3 + n9_10_4 + n9_10_5 + n9_10_6 + n9_10_7 + n9_10_8 + n9_10_9 + n9_12_13 + n9_12_12 + n9_12_11 + n9_16_11 + n9_16_12 + n9_16_13 + n9_16_14 + n9_16_15 + n9_16_16 + n9_16_17 + n9_16_18 + n9_11_0 + n9_11_1 + n9_11_2 + n9_11_3 + n9_11_4 + n9_11_5 + n9_11_6 + n9_11_7 + n9_11_8 + n9_11_9 + n9_12_0 + n9_12_1 + n9_12_2 + n9_12_3 + n9_12_4 + n9_12_5 + n9_12_6 + n9_12_7 + n9_12_8 + n9_12_9 + n9_5_10 + n9_5_11 + n9_5_12 + n9_5_13 + n9_5_14 + n9_5_15 + n9_5_16 + n9_5_17 + n9_5_18 + n9_13_1 + n9_13_2 + n9_13_3 + n9_13_4 + n9_13_5 + n9_13_6 + n9_13_7 + n9_13_8 + n9_13_9 + n9_15_11 + n9_15_12 + n9_15_13 + n9_15_14 + n9_15_15 + n9_15_16 + n9_15_17 + n9_15_18 + n9_14_1 + n9_14_2 + n9_14_3 + n9_14_4 + n9_14_5 + n9_14_6 + n9_14_7 + n9_14_8 + n9_14_9 + n9_15_0 + n9_15_1 + n9_15_2 + n9_15_3 + n9_15_4 + n9_15_5 + n9_15_6 + n9_15_7 + n9_15_8 + n9_15_9 + n9_4_10 + n9_4_11 + n9_4_12 + n9_4_13 + n9_4_14 + n9_4_15 + n9_4_16 + n9_4_17 + n9_4_18 + n9_16_0 + n9_16_1 + n9_16_2 + n9_16_3 + n9_16_4 + n9_16_5 + n9_16_6 + n9_16_7 + n9_16_8 + n9_16_9 + n9_14_10 + n9_14_11 + n9_14_12 + n9_14_13 + n9_14_14 + n9_14_15 + n9_14_16 + n9_14_17 + n9_14_18 + n9_17_0 + n9_17_1 + n9_17_2 + n9_17_3 + n9_17_4 + n9_17_5 + n9_17_6 + n9_17_7 + n9_17_8 + n9_17_9 + n9_18_0 + n9_18_1 + n9_18_2 + n9_18_3 + n9_18_4 + n9_18_5 + n9_18_6 + n9_18_7 + n9_18_8 + n9_18_9 + n9_3_10 + n9_3_11 + n9_3_12 + n9_3_13 + n9_3_14 + n9_3_15 + n9_3_16 + n9_3_17 + n9_3_18 + n9_13_10 + n9_13_11 + n9_13_12 + n9_13_13 + n9_13_14 + n9_13_15 + n9_13_16 + n9_13_17 + n9_13_18) OR X ((SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 + s3_9 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10))) AND F ((SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 + s3_9 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10)))) OR F ((a5 <= c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18))))) : A (((SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= a1) AND NOT(X (((SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= a1) AND X (F (((2 <= a1) U ((2 <= a1) U X ((0 <= a1))))))))))) : A (F ((n2_18 + n2_17 + n2_16 + n2_15 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18))) : A (NOT(X (NOT(((n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= a1) U F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 <= a3))))))) : A ((X ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + 1 <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 + s3_9 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10)) OR (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18) AND F ((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18))) U (Astart <= s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_18 + s2_17 + s2_16 + s2_15 + s2_14 + s2_13 + s2_12 + s2_11 + s2_10 + s2_9)))) : A (G (NOT(G ((((Cstart_15 <= AstopAbort) AND G ((3 <= n5_11))) AND G (X (NOT(X (G ((2 <= a3))))))))))) : A (NOT(((3 <= Cstart_16) U G (X (((3 <= Cstart_16) U (F (G ((2 <= s2_7))) U (3 <= Cstart_16)))))))) : A (NOT(G (F ((a2 <= SstopAbort))))) : A (F ((F (NOT(((c1_1 <= AstopAbort) U (s6_17 <= s4_17)))) AND NOT(((a5 <= s4_9) U (s6_17 <= s4_17)))))) : A ((NOT((X ((Cstart_16 + 1 <= n9_14_16)) U (SstopOK_16 <= 2))) U ())) : A (((F (X ((0 <= n8_11_8))) U F ((1 <= n7_4_18))) AND X (X (G ((Astart <= AstopOK)))))) : A (NOT(((a3 <= n6_5) U (NOT(F ((1 <= a4))) OR (F (((1 <= n6_11) OR X ((n6_5 + 1 <= a3)))) U (a3 <= n6_5)))))) : A (((Cstart_1 + 1 <= n8_10_15) AND G ((((2 <= Cstart_16) OR G ((n8_10_15 <= Cstart_1))) U ((n8_10_15 <= Cstart_1) U (SstopAbort <= 2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AstopAbort <= Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (AstopAbort <= Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10)
lola: processed formula length: 231
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 <= a3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 <= a3))))
lola: processed formula length: 159
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + 1 <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 + s3_9 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10)) OR (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + 1 <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 + s3_9 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10)) OR (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + s6_11 + s6_12 ... (shortened)
lola: processed formula length: 761
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((n9_2_10 + n9_2_11 + n9_2_12 + n9_2_13 + n9_2_14 + n9_2_15 + n9_2_16 + n9_2_17 + n9_2_18 + n9_14_0 + n9_15_10 + n9_13_0 + n9_16_10 + n9_12_10 + n9_17_10 + n9_18_10 + n9_1_10 + n9_11_10 + n9_10_10 + n9_0_0 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_0_10 + n9_0_11 + n9_0_12 + n9_0_13 + n9_0_14 + n9_0_15 + n9_0_16 + n9_0_17 + n9_0_18 + n9_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + 1 <= a5)))
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:788
lola: processed formula: A (G ((c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + 1 <= a5)))
lola: processed formula length: 159
lola: 127 rewrites
lola: closed formula file LTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (a5 <= c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= a1) AND A (X ((a1 + 1 <= SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + Ss... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= a1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 <= a1)
lola: processed formula length: 242
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((a1 + 1 <= SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((a1 + 1 <= SstopOK_9 + SstopOK_8 + SstopOK_7 + SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18)))
lola: processed formula length: 254
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= n7_4_18))) AND A (X (X (G ((Astart <= AstopOK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= n7_4_18)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (n7_4_18 <= 0)
lola: processed formula length: 14
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 30 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((n6_5 + 1 <= a3) R (F ((1 <= a4)) AND (G (((n6_11 <= 0) AND X ((a3 <= n6_5)))) R (n6_5 + 1 <= a3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((n6_5 + 1 <= a3) R (F ((1 <= a4)) AND (G (((n6_11 <= 0) AND X ((a3 <= n6_5)))) R (n6_5 + 1 <= a3)))))
lola: processed formula length: 105
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((n2_18 + n2_17 + n2_16 + n2_15 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9 + c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + 1 <= n2_18 + n2_17 + n2_16 + n2_15 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9)
lola: processed formula length: 288
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((SstopAbort + 1 <= a2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((SstopAbort + 1 <= a2))))
lola: processed formula length: 34
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 44 markings, 45 edges
lola: ========================================
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F (((AstopAbort + 1 <= c1_1) R (s4_17 + 1 <= s6_17))) AND ((s4_9 + 1 <= a5) R (s4_17 + 1 <= s6_17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (((AstopAbort + 1 <= c1_1) R (s4_17 + 1 <= s6_17))) AND ((s4_9 + 1 <= a5) R (s4_17 + 1 <= s6_17)))))
lola: processed formula length: 109
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 29 edges
lola: ========================================
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Cstart_1 + 1 <= n8_10_15) AND A (G ((((n8_10_15 <= Cstart_1) U (SstopAbort <= 2)) OR (G ((n8_10_15 <= Cstart_1)) AND F ((SstopAbort <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Cstart_1 + 1 <= n8_10_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Cstart_1 + 1 <= n8_10_15)
lola: processed formula length: 26
lola: 125 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes yes no yes yes no no no no no no
lola:
preliminary result: yes yes no no no yes yes no yes yes no no no no no no
lola: memory consumption: 36164 KB
lola: time consumption: 10 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590281280110
--------------------
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-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is QuasiCertifProtocol-PT-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tajo-158961409100201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;