About the Execution of ITS-LoLa for Philosophers-PT-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.700 | 3600000.00 | 11587.00 | 50.80 | FFFTFFFTFTFFFFFF | 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.r176-tajo-158987871400116.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 itslola
Input is Philosophers-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871400116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 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 Philosophers-PT-000010-CTLFireability-00
FORMULA_NAME Philosophers-PT-000010-CTLFireability-01
FORMULA_NAME Philosophers-PT-000010-CTLFireability-02
FORMULA_NAME Philosophers-PT-000010-CTLFireability-03
FORMULA_NAME Philosophers-PT-000010-CTLFireability-04
FORMULA_NAME Philosophers-PT-000010-CTLFireability-05
FORMULA_NAME Philosophers-PT-000010-CTLFireability-06
FORMULA_NAME Philosophers-PT-000010-CTLFireability-07
FORMULA_NAME Philosophers-PT-000010-CTLFireability-08
FORMULA_NAME Philosophers-PT-000010-CTLFireability-09
FORMULA_NAME Philosophers-PT-000010-CTLFireability-10
FORMULA_NAME Philosophers-PT-000010-CTLFireability-11
FORMULA_NAME Philosophers-PT-000010-CTLFireability-12
FORMULA_NAME Philosophers-PT-000010-CTLFireability-13
FORMULA_NAME Philosophers-PT-000010-CTLFireability-14
FORMULA_NAME Philosophers-PT-000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591128803234
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:13:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:13:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:13:24] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-06-02 20:13:24] [INFO ] Transformed 50 places.
[2020-06-02 20:13:24] [INFO ] Transformed 50 transitions.
[2020-06-02 20:13:24] [INFO ] Parsed PT model containing 50 places and 50 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Finished random walk after 284 steps, including 3 resets, run visited all 31 properties in 7 ms. (steps per millisecond=40 )
[2020-06-02 20:13:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 20:13:25] [INFO ] Flatten gal took : 33 ms
[2020-06-02 20:13:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 20:13:25] [INFO ] Flatten gal took : 9 ms
FORMULA Philosophers-PT-000010-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:13:25] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-02 20:13:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Philosophers-PT-000010 @ 3570 seconds
FORMULA Philosophers-PT-000010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for CTLFireability @ Philosophers-PT-000010
{
"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": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:13:25 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p1) AND (1 <= p10)) OR ((1 <= p11) AND (1 <= p30)))",
"processed_size": 60,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EF((((1 <= p48) AND (1 <= p3) AND (1 <= p12) AND (1 <= p41)) AND EX(((1 <= p5) AND (1 <= p16)))))",
"processed_size": 97,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 459270,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p11 <= 0) OR (p22 <= 0))",
"processed_size": 27,
"rewrites": 20
},
"result":
{
"edges": 433844,
"markings": 59049,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p1 <= 0) OR (p10 <= 0))",
"processed_size": 26,
"rewrites": 20
},
"result":
{
"edges": 432764,
"markings": 59049,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p3 <= 0) OR (p14 <= 0))",
"processed_size": 26,
"rewrites": 18
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EX((((1 <= p16) AND (1 <= p26) AND ((p2 <= 0) OR (p11 <= 0))) AND AF(((1 <= p5) AND (1 <= p13)))))",
"processed_size": 99,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"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 ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14)))))",
"processed_size": 315,
"rewrites": 18
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p48 <= 0) AND ((p14 <= 0) OR (p36 <= 0)))",
"processed_size": 44,
"rewrites": 19
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p49 <= 0) AND (p48 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))",
"processed_size": 147,
"rewrites": 19
},
"result":
{
"edges": 16997,
"markings": 3680,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p49 <= 0) AND (p48 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))",
"processed_size": 147,
"rewrites": 19
},
"result":
{
"edges": 16997,
"markings": 3680,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG((EF(((p14 <= 0) OR (p24 <= 0))) OR ((p6 <= 0) OR (p15 <= 0))))",
"processed_size": 66,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 524892,
"markings": 59049,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 8,
"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": 7,
"visible_transitions": 0
},
"processed": "E(((p41 <= 0) OR ((p45 <= 0) AND ((p17 <= 0) OR (p37 <= 0)))) U AG(((1 <= p7) AND (1 <= p15) AND (1 <= p8) AND (1 <= p17))))",
"processed_size": 126,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 510381,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 8,
"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": "E((((p15 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p14 <= 0) OR (p13 <= 0) OR (p33 <= 0))) U AG(((1 <= p6) AND (1 <= p16))))",
"processed_size": 126,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 457979,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))",
"processed_size": 155,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 125,
"markings": 64,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EF(AG(AF(((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))",
"processed_size": 159,
"rewrites": 19
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 758702,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 11,
"adisj": 11,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "EG(E((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)))))",
"processed_size": 624,
"rewrites": 18
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 748,
"markings": 329,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 11,
"aneg": 2,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)))) OR (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)))))",
"processed_size": 628,
"rewrites": 26
},
"result":
{
"edges": 99654,
"markings": 39185,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14)))))",
"processed_size": 625,
"rewrites": 18
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 65716,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(G(A(F(**)))))) : A(F(**)) : A(F(**)) : E(F((E(G(**)) AND **))) : A(F(E(G(**)))) : (A((* R *)) AND A(G(**))) : A(G(**)) : E(G(E((** U **)))) : (E(F((** AND E(X(**))))) AND **) : A(G((E(F(*)) OR (** OR **)))) : E((** U A(G(**)))) : (E(F(A(G(**)))) AND (E(F(A(G(**)))) OR E(X(**)))) : E((** U A(G(**)))) : A(F(**)) : (E(X((** AND A(F(**))))) AND E(X(E(F(*)))))"
},
"net":
{
"arcs": 160,
"conflict_clusters": 11,
"places": 50,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 50
},
"result":
{
"preliminary_value": "no no no yes no no no yes no yes no no no no no ",
"value": "no no no yes no no no yes no yes 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: 100/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 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 CTLFireability.xml
lola: E (F (A (G (A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))))) : A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))) : A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))) : E (F ((E (G ((((p7 <= 0) OR (p18 <= 0)) AND ((p5 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p14 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0))))) AND (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14)))))) : A (F (E (G (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))) : (NOT(E (((((1 <= p15) AND (1 <= p25)) OR ((1 <= p11) AND (1 <= p22)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p21))) U ((((1 <= p15) AND (1 <= p25)) OR ((1 <= p11) AND (1 <= p22)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p31)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p10) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p21))) AND (((1 <= p12) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p29)) OR ((1 <= p16) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p40)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p15) AND (1 <= p39))))))) AND A (G (A (G ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14)))))))) : A (G (A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14))))))) : E (G (E (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0))))))) : (E (F ((((1 <= p48) AND (1 <= p3) AND (1 <= p12) AND (1 <= p41)) AND E (X (((1 <= p5) AND (1 <= p16))))))) AND (((1 <= p1) AND (1 <= p10)) OR ((1 <= p11) AND (1 <= p30)))) : A (G (((NOT(A (G (((1 <= p14) AND (1 <= p24))))) OR (p6 <= 0)) OR (p15 <= 0)))) : E ((((p41 <= 0) OR ((p45 <= 0) AND ((p17 <= 0) OR (p37 <= 0)))) U A (G (((1 <= p7) AND (1 <= p15) AND (1 <= p8) AND (1 <= p17)))))) : (E (F (A (G (((1 <= p1) AND (1 <= p10)))))) AND (E (F (A (G (((1 <= p11) AND (1 <= p22)))))) OR E (X ((((p13 <= 0) OR (p23 <= 0)) AND (1 <= p12) AND (1 <= p21)))))) : E (((((p15 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p14 <= 0) OR (p13 <= 0) OR (p33 <= 0))) U A (G (((1 <= p6) AND (1 <= p16)))))) : A ((((1 <= p5) AND (1 <= p16)) U A (F (((1 <= p48) OR ((1 <= p14) AND (1 <= p36))))))) : (E (X ((((1 <= p16) AND (1 <= p26) AND ((p2 <= 0) OR (p11 <= 0))) AND A (F (((1 <= p5) AND (1 <= p13))))))) AND NOT(A (X (A (G (((1 <= p3) AND (1 <= p14))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p48) AND (1 <= p3) AND (1 <= p12) AND (1 <= p41)) AND E (X (((1 <= p5) AND (1 <= p16))))))) AND (((1 <= p1) AND (1 <= p10)) OR ((1 <= p11) AND (1 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1) AND (1 <= p10)) OR ((1 <= p11) AND (1 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p1) AND (1 <= p10)) OR ((1 <= p11) AND (1 <= p30)))
lola: processed formula length: 60
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p48) AND (1 <= p3) AND (1 <= p12) AND (1 <= p41)) AND E (X (((1 <= p5) AND (1 <= p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p48) AND (1 <= p3) AND (1 <= p12) AND (1 <= p41)) AND EX(((1 <= p5) AND (1 <= p16)))))
lola: processed formula length: 97
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 459270 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p1) AND (1 <= p10)))))) AND (E (F (A (G (((1 <= p11) AND (1 <= p22)))))) OR E (X ((((p13 <= 0) OR (p23 <= 0)) AND (1 <= p12) AND (1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p11) AND (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p11 <= 0) OR (p22 <= 0))
lola: processed formula length: 27
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p22))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: formula 1: ((p11 <= 0) OR (p22 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
sara: try reading problem file CTLFireability-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 59049 markings, 433844 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p1) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 0) OR (p10 <= 0))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1) AND (1 <= p10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p1 <= 0) OR (p10 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: try reading problem file CTLFireability-2-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 59049 markings, 432764 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= p16) AND (1 <= p26) AND ((p2 <= 0) OR (p11 <= 0))) AND A (F (((1 <= p5) AND (1 <= p13))))))) AND E (X (E (F (((p3 <= 0) OR (p14 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((p3 <= 0) OR (p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((p3 <= 0) OR (p14 <= 0))
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 <= 0) OR (p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((1 <= p16) AND (1 <= p26) AND ((p2 <= 0) OR (p11 <= 0))) AND A (F (((1 <= p5) AND (1 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((1 <= p16) AND (1 <= p26) AND ((p2 <= 0) OR (p11 <= 0))) AND AF(((1 <= p5) AND (1 <= p13)))))
lola: processed formula length: 99
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p14)))))
lola: processed formula length: 315
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)))
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p48) OR ((1 <= p14) AND (1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p48 <= 0) AND ((p14 <= 0) OR (p36 <= 0)))
lola: processed formula length: 44
lola: 19 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p48) OR ((1 <= p14) AND (1 <= p36)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p49 <= 0) AND (p48 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))
lola: processed formula length: 147
lola: 19 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3680 markings, 16997 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p49 <= 0) AND (p48 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))
lola: processed formula length: 147
lola: 19 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3680 markings, 16997 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (((p14 <= 0) OR (p24 <= 0)))) OR ((p6 <= 0) OR (p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF(((p14 <= 0) OR (p24 <= 0))) OR ((p6 <= 0) OR (p15 <= 0))))
lola: processed formula length: 66
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 59049 markings, 524892 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p41 <= 0) OR ((p45 <= 0) AND ((p17 <= 0) OR (p37 <= 0)))) U A (G (((1 <= p7) AND (1 <= p15) AND (1 <= p8) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p41 <= 0) OR ((p45 <= 0) AND ((p17 <= 0) OR (p37 <= 0)))) U AG(((1 <= p7) AND (1 <= p15) AND (1 <= p8) AND (1 <= p17))))
lola: processed formula length: 126
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 510381 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p15 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p14 <= 0) OR (p13 <= 0) OR (p33 <= 0))) U A (G (((1 <= p6) AND (1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((p15 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p14 <= 0) OR (p13 <= 0) OR (p33 <= 0))) U AG(((1 <= p6) AND (1 <= p16))))
lola: processed formula length: 126
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 457979 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))
lola: processed formula length: 155
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 64 markings, 125 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(AF(((1 <= p49) OR (1 <= p48) OR (1 <= p38) OR (1 <= p41) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))
lola: processed formula length: 159
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 758702 edges
lola: ========================================
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p10 <=... (shortened)
lola: processed formula length: 624
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 329 markings, 748 edges
lola: ========================================
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((((p7 <= 0) OR (p18 <= 0)) AND ((p5 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p14 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0))))) AND (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)))) OR (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p1... (shortened)
lola: processed formula length: 628
lola: 26 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 39185 markings, 99654 edges
lola: ========================================
lola: subprocess 14 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p15 <= 0) OR (p25 <= 0)) AND ((p11 <= 0) OR (p22 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p20 <= 0) OR (p31 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p21 <= 0))) R ((((p15 <= 0) OR (p25 <= 0)) AND ((p11 <= 0) OR (p22 <= 0)) AND ((p13 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p7) AND (1 <= p18)) OR ((1 <= p5) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p14)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= ... (shortened)
lola: processed formula length: 625
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p7 <= 0) OR (p18 <= 0)) AND ((p5 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p14 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)))
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no yes no yes no no no no no
lola:
preliminary result: no no no yes no no no yes no yes no no no no no
lola: memory consumption: 65716 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
--------------------
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="Philosophers-PT-000010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is Philosophers-PT-000010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871400116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;