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-158961409100183.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-COL-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961409100183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 07:55 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 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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-COL-06-00
FORMULA_NAME QuasiCertifProtocol-COL-06-01
FORMULA_NAME QuasiCertifProtocol-COL-06-02
FORMULA_NAME QuasiCertifProtocol-COL-06-03
FORMULA_NAME QuasiCertifProtocol-COL-06-04
FORMULA_NAME QuasiCertifProtocol-COL-06-05
FORMULA_NAME QuasiCertifProtocol-COL-06-06
FORMULA_NAME QuasiCertifProtocol-COL-06-07
FORMULA_NAME QuasiCertifProtocol-COL-06-08
FORMULA_NAME QuasiCertifProtocol-COL-06-09
FORMULA_NAME QuasiCertifProtocol-COL-06-10
FORMULA_NAME QuasiCertifProtocol-COL-06-11
FORMULA_NAME QuasiCertifProtocol-COL-06-12
FORMULA_NAME QuasiCertifProtocol-COL-06-13
FORMULA_NAME QuasiCertifProtocol-COL-06-14
FORMULA_NAME QuasiCertifProtocol-COL-06-15

=== Now, execution of the tool begins

BK_START 1590279314203

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-COL-06 @ 3570 seconds

FORMULA QuasiCertifProtocol-COL-06-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3349
rslt: Output for LTLCardinality @ QuasiCertifProtocol-COL-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=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:15:14 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": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 58,
"visible_transitions": 0
},
"processed": "((p57 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p182 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262))",
"processed_size": 412,
"rewrites": 111
},
"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": 110
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 110
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 110
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "A (((F ((1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)) U (2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) U X (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0) AND ((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181) U (1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)))))))",
"processed_size": 303,
"rewrites": 110
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (X (X ((X (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72))) U ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72) U (p159 + 1 <= p182))))))",
"processed_size": 140,
"rewrites": 110
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A ((F ((p80 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72)) U G ((G ((1 <= p184)) OR X (F ((p71 + p70 + p69 + p68 + p67 + p66 + p72 <= p80)))))))",
"processed_size": 146,
"rewrites": 110
},
"result":
{
"edges": 194372654,
"markings": 13823154,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 374
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 374
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(3 <= p138 + p140 + p141 + p142 + p143 + p144 + p139)",
"processed_size": 53,
"rewrites": 110
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 127,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "A (((((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (1 <= p183)) U (3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262)) OR ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) U (p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174))))",
"processed_size": 928,
"rewrites": 110
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 480
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 77,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 63,
"visible_transitions": 0
},
"processed": "A ((X ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) OR (G ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262)) AND X (F ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174))))))",
"processed_size": 576,
"rewrites": 110
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"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": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 480
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A ((G (F ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= 1))) OR (X (TRUE) U (p57 + 1 <= p160))))",
"processed_size": 101,
"rewrites": 110
},
"result":
{
"edges": 13646726,
"markings": 3354841,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"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": 558
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p137)",
"processed_size": 56,
"rewrites": 112
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 670
},
"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": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G (F ((p138 + p140 + p141 + p142 + p143 + p144 + p139 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79))))",
"processed_size": 107,
"rewrites": 110
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 837
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A (F (G (((p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (2 <= p182)))))",
"processed_size": 128,
"rewrites": 110
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 1116
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "A ((((p160 <= 0) AND (p182 + 1 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)) OR G ((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p269 + p268 + p267 + p266 + p265 + p264 + p263))))",
"processed_size": 183,
"rewrites": 110
},
"result":
{
"edges": 465842,
"markings": 93286,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1674
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 47,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "A (F ((((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND G (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151))))) AND (F ((p137 <= 0)) OR G (((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND G (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151))))))))))",
"processed_size": 418,
"rewrites": 110
},
"result":
{
"edges": 168169,
"markings": 27253,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 25
},
"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": 3349
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3349
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167)))",
"processed_size": 61,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 82960,
"runtime": 221.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** AND **) : A((G(F(*)) OR (X(TRUE) U **))) : (** AND A(F((G(**) AND X(**))))) : A((** OR G(**))) : FALSE : A(((F(**) U **) U X(F((** AND (** U **)))))) : A(F(*)) : A(X(X((X(F(**)) U (** U **))))) : A((F(*) U G((G(**) OR X(F(**)))))) : A(G(F(*))) : A(F(G(**))) : FALSE : (A(F(*)) AND A(G(*))) : (A((X(**) OR (G(**) AND X(F(**))))) AND A(((** U **) OR (** U **)))) : FALSE : A(F(((** OR (** AND G(F(*)))) AND (F(*) OR G((** OR (** AND G(F(*)))))))))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "yes yes no no no no no no yes no no no no yes no yes ",
"value": "yes yes no no no no no no yes no no no no yes 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 High-Level net
lola: Places: 270, Transitions: 116
lola: @ trans malA4
lola: @ trans SgetTS
lola: @ trans malA5
lola: @ trans malS3
lola: @ trans AreqCS
lola: @ trans AendCS
lola: @ trans ScertCS
lola: @ trans malA2
lola: @ trans SreqTS
lola: @ trans AackCS
lola: @ trans malS2
lola: @ trans AgetTS
lola: @ trans malA3
lola: @ trans malC1
lola: @ trans AstartCS
lola: @ trans Sperform
lola: @ trans malS1
lola: @ trans SsendTS
lola: @ trans malS4
lola: @ trans AreqTS
lola: @ trans CsendTS1
lola: @ trans malA1
lola: @ trans malS6
lola: @ trans malS5
lola: @ trans SackCS
lola: @ trans CgenCertif
lola: finished unfolding
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 LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p57)
lola: LP says that atomic proposition is always false: (2 <= p137)
lola: LP says that atomic proposition is always false: (3 <= p184)
lola: LP says that atomic proposition is always false: (2 <= p57)
lola: LP says that atomic proposition is always false: (3 <= p183)
lola: LP says that atomic proposition is always false: (3 <= p183)
lola: A (((p57 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND ((p182 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) OR ((2 <= p57) AND G (X (NOT(X (((p57 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) OR (p182 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262)))))))))) : A ((G (NOT(((0 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND G ((2 <= p269 + p268 + p267 + p266 + p265 + p264 + p263))))) OR (X ((0 <= p138 + p140 + p141 + p142 + p143 + p144 + p139)) U (p57 + 1 <= p160)))) : A (((3 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND F ((((0 <= p145 + p146 + p147 + p148 + p149 + p150 + p151) AND G ((p207 + p208 + p209 + p210 + p211 + p212 + p213 + 1 <= p152 + p158 + p157 + p156 + p155 + p154 + p153))) AND X ((p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p71 + p70 + p69 + p68 + p67 + p66 + p72)))))) : A ((((p160 <= 0) AND (p182 + 1 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)) OR G ((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p269 + p268 + p267 + p266 + p265 + p264 + p263)))) : A ((X (X (((2 <= p137) AND G ((0 <= p137))))) OR X (G (())))) : A (((F ((1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)) U (2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) U X (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0) AND ((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181) U (1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186))))))) : A (NOT(G ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p137)))) : A (X (X ((X (((p57 <= 1) U (2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72))) U ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72) U (p159 + 1 <= p182)))))) : A ((NOT(G ((p71 + p70 + p69 + p68 + p67 + p66 + p72 <= p80))) U G ((G ((1 <= p184)) OR F (X ((p71 + p70 + p69 + p68 + p67 + p66 + p72 <= p80))))))) : A (F (X ((G (NOT((G ((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p138 + p140 + p141 + p142 + p143 + p144 + p139)) OR NOT(G ((0 <= p182)))))) AND ((0 <= p182) OR F ((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p138 + p140 + p141 + p142 + p143 + p144 + p139))))))) : A (F (G (F (G (((p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (2 <= p182))))))) : A (X (X (X ((((2 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)) AND G (F (G ((3 <= p183))))))))) : A (NOT((G ((p159 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)) OR ((p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p57) U F ((p161 + p162 + p163 + p164 + p165 + p166 + p167 <= 1)))))) : A (((G ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262)) U X ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174))) AND ((((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (1 <= p183)) U (3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262)) OR ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) U (p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174))))) : A ((((1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) AND (2 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)) AND (((0 <= p206 + p205 + p200 + p201 + p202 + p203 + p204) AND F (X ((p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= 0)))) OR NOT(((p137 <= p269 + p268 + p267 + p266 + p265 + p264 + p263) U (0 <= p206 + p205 + p200 + p201 + p202 + p203 + p204)))))) : A (F (NOT((G ((1 <= p137)) U NOT(((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND NOT(F (G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p152 + p158 + p157 + p156 + p155 + p154 + p153)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:118
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p57 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p182 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p57 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p182 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p... (shortened)
lola: processed formula length: 412
lola: 111 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: 110 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 110 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 3 will run for 274 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: 110 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)) U (2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) U X (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0) AND ((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181) U (1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)) U (2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) U X (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0) AND ((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181) U (1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)))))))
lola: processed formula length: 303
lola: 110 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((X (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72))) U ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72) U (p159 + 1 <= p182))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((X (F ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72))) U ((2 <= p71 + p70 + p69 + p68 + p67 + p66 + p72) U (p159 + 1 <= p182))))))
lola: processed formula length: 140
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p80 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72)) U G ((G ((1 <= p184)) OR X (F ((p71 + p70 + p69 + p68 + p67 + p66 + p72 <= p80)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p80 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72)) U G ((G ((1 <= p184)) OR X (F ((p71 + p70 + p69 + p68 + p67 + p66 + p72 <= p80)))))))
lola: processed formula length: 146
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 820190 markings, 4675729 edges, 164038 markings/sec, 0 secs
lola: 1470841 markings, 9618623 edges, 130130 markings/sec, 5 secs
lola: 1975774 markings, 14661918 edges, 100987 markings/sec, 10 secs
lola: 2377033 markings, 19741434 edges, 80252 markings/sec, 15 secs
lola: 2776094 markings, 24666586 edges, 79812 markings/sec, 20 secs
lola: 3188135 markings, 29653809 edges, 82408 markings/sec, 25 secs
lola: 3543218 markings, 34582816 edges, 71017 markings/sec, 30 secs
lola: 3973056 markings, 39502103 edges, 85968 markings/sec, 35 secs
lola: 4305438 markings, 44422105 edges, 66476 markings/sec, 40 secs
lola: 4746284 markings, 49296199 edges, 88169 markings/sec, 45 secs
lola: 5071947 markings, 54193888 edges, 65133 markings/sec, 50 secs
lola: 5494199 markings, 59041815 edges, 84450 markings/sec, 55 secs
lola: 5819056 markings, 63922966 edges, 64971 markings/sec, 60 secs
lola: 6230925 markings, 68768546 edges, 82374 markings/sec, 65 secs
lola: 6553765 markings, 73617713 edges, 64568 markings/sec, 70 secs
lola: 6952757 markings, 78455142 edges, 79798 markings/sec, 75 secs
lola: 7274892 markings, 83288793 edges, 64427 markings/sec, 80 secs
lola: 7638255 markings, 88197690 edges, 72673 markings/sec, 85 secs
lola: 7972545 markings, 93100612 edges, 66858 markings/sec, 90 secs
lola: 8296562 markings, 98018216 edges, 64803 markings/sec, 95 secs
lola: 8571172 markings, 102864515 edges, 54922 markings/sec, 100 secs
lola: 8831282 markings, 107664563 edges, 52022 markings/sec, 105 secs
lola: 9181368 markings, 112579680 edges, 70017 markings/sec, 110 secs
lola: 9503496 markings, 117470905 edges, 64426 markings/sec, 115 secs
lola: 9801139 markings, 122349223 edges, 59529 markings/sec, 120 secs
lola: 10023821 markings, 127131600 edges, 44536 markings/sec, 125 secs
lola: 10374559 markings, 132071443 edges, 70148 markings/sec, 130 secs
lola: 10682334 markings, 136955752 edges, 61555 markings/sec, 135 secs
lola: 10926581 markings, 141749513 edges, 48849 markings/sec, 140 secs
lola: 11217279 markings, 146614134 edges, 58140 markings/sec, 145 secs
lola: 11516498 markings, 151502921 edges, 59844 markings/sec, 150 secs
lola: 11739575 markings, 156301295 edges, 44615 markings/sec, 155 secs
lola: 12039789 markings, 161172316 edges, 60043 markings/sec, 160 secs
lola: 12257714 markings, 165944572 edges, 43585 markings/sec, 165 secs
lola: 12512206 markings, 170778610 edges, 50898 markings/sec, 170 secs
lola: 12729796 markings, 175542960 edges, 43518 markings/sec, 175 secs
lola: 12924610 markings, 180306043 edges, 38963 markings/sec, 180 secs
lola: 13114231 markings, 184973324 edges, 37924 markings/sec, 185 secs
lola: 13467163 markings, 189933777 edges, 70586 markings/sec, 190 secs
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: 13823154 markings, 194372654 edges
lola: ========================================
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND A (F ((G ((p207 + p208 + p209 + p210 + p211 + p212 + p213 + 1 <= p152 + p158 + p157 + p156 + p155 + p154 + p153)) AND X ((p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p71 + p70 + p69 + p68 + p67 + p66 + p72))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p138 + p140 + p141 + p142 + p143 + p144 + p139)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p138 + p140 + p141 + p142 + p143 + p144 + p139)
lola: processed formula length: 53
lola: 110 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: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((X ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) OR (G ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (1 <= p183)) U (3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (1 <= p183)) U (3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251... (shortened)
lola: processed formula length: 928
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) OR (G ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)) OR (G ((3 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + ... (shortened)
lola: processed formula length: 576
lola: 110 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= 1))) OR (X (TRUE) U (p57 + 1 <= p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((p269 + p268 + p267 + p266 + p265 + p264 + p263 <= 1))) OR (X (TRUE) U (p57 + 1 <= p160))))
lola: processed formula length: 101
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 1067707 markings, 4322982 edges, 213541 markings/sec, 0 secs
lola: 2146765 markings, 8724831 edges, 215812 markings/sec, 5 secs
lola: 3152169 markings, 12830003 edges, 201081 markings/sec, 10 secs
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: 3354841 markings, 13646726 edges
lola: ========================================
lola: subprocess 10 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p137 + 1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p137)
lola: processed formula length: 56
lola: 112 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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 11 will run for 670 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p138 + p140 + p141 + p142 + p143 + p144 + p139 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p138 + p140 + p141 + p142 + p143 + p144 + p139 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79))))
lola: processed formula length: 107
lola: 110 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (2 <= p182)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (2 <= p182)))))
lola: processed formula length: 128
lola: 110 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 1116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p160 <= 0) AND (p182 + 1 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)) OR G ((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p269 + p268 + p267 + p266 + p265 + p264 + p263))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p160 <= 0) AND (p182 + 1 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)) OR G ((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p269 + p268 + p267 + p266 + p265 + p264 + p263))))
lola: processed formula length: 183
lola: 110 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: 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: 93286 markings, 465842 edges
lola: ========================================
lola: subprocess 14 will run for 1674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND G (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151))))) AND (F ((p137 <= 0)) OR G (((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND G (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p145 + p146 + p147 + p148 + p149 + p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND G (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151))))) AND (F ((p137 <= 0)) OR G (((1 <= p137) OR ((p175 + p176 + p177 + p178 + p179 + p180 + p181 <= p65) AND G (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p145 + p146 + p147 + p148 + p149 + p15... (shortened)
lola: processed formula length: 418
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 25 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 27253 markings, 168169 edges
lola: ========================================
lola: subprocess 15 will run for 3349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p81 + p82 + p83 + p84 + p85 + p86 + p87 + 1 <= p159))) AND A (G ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167)))
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 ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167)))
lola: processed formula length: 61
lola: 112 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: state equation task get result unparse finished++ id 0
lola: formula 0: (p161 + p162 + p163 + p164 + p165 + p166 + p167 <= 1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
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: RESULT
lola:
SUMMARY: yes yes no no no no no no yes no no no no yes no yes
lola:
preliminary result: yes yes no no no no no no yes no no no no yes no yes
lola: memory consumption: 82960 KB
lola: time consumption: 221 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590279535471

--------------------
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-COL-06"
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-COL-06, 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-158961409100183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;