About the Execution of ITS-LoLa for Sudoku-PT-AN03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15728.520 | 3600000.00 | 8198.00 | 49.30 | TFFFFTTTFTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r228-oct2-159033547400332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Sudoku-PT-AN03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547400332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 4.1K Jun 3 09:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 3 09:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 3 09:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 3 09:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.9K Jun 3 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Jun 3 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jun 3 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jun 3 09:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 18K May 12 20:42 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 Sudoku-PT-AN03-CTLFireability-00
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-01
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-02
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-03
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-04
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-05
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-06
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-07
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-08
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-09
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-10
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-11
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-12
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-13
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-14
FORMULA_NAME Sudoku-PT-AN03-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591395647106
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 22:20:48] [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-05 22:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 22:20:48] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2020-06-05 22:20:48] [INFO ] Transformed 54 places.
[2020-06-05 22:20:48] [INFO ] Transformed 27 transitions.
[2020-06-05 22:20:48] [INFO ] Parsed PT model containing 54 places and 27 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Finished random walk after 40 steps, including 4 resets, run visited all 48 properties in 3 ms. (steps per millisecond=13 )
[2020-06-05 22:20:48] [INFO ] Flatten gal took : 26 ms
[2020-06-05 22:20:48] [INFO ] Flatten gal took : 10 ms
[2020-06-05 22:20:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 22:20:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Sudoku-PT-AN03 @ 3570 seconds
FORMULA Sudoku-PT-AN03-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN03-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ Sudoku-PT-AN03
{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 22:20:48 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AX((AF(((1 <= p6) AND (1 <= p42) AND (1 <= p45) AND (1 <= p8) AND (1 <= p43) AND (1 <= p50))) OR AX((((1 <= p5) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p2) AND (1 <= p38) AND (1 <= p53))))))",
"processed_size": 192,
"rewrites": 83
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EG((EX(((1 <= p4) AND (1 <= p41) AND (1 <= p52))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR (((1 <= p2) AND (1 <= p37) AND (1 <= p50)) OR (((1 <= p8) AND (1 <= p43) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52)))))))",
"processed_size": 237,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 40911,
"markings": 11692,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG((((p5 <= 0) OR (p41 <= 0) OR (p53 <= 0)) OR EX(((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0)))))",
"processed_size": 96,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 56619,
"markings": 11776,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AF((AX(((p2 <= 0) OR (p38 <= 0) OR (p53 <= 0))) AND (EX(((1 <= p1) AND (1 <= p36) AND (1 <= p46))) OR AF(((1 <= p0) AND (1 <= p38) AND (1 <= p51))))))",
"processed_size": 152,
"rewrites": 84
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 15,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 29,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 29,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p41) AND (1 <= p51)) OR ((1 <= p3) AND (1 <= p40) AND (1 <= p48)) OR ((1 <= p8) AND (1 <= p42) AND (1 <= p47)) OR (((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0))) OR ((1 <= p4) AND (1 <= p40) AND (1 <= p49) AND (1 <= p5) AND (1 <= p41) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p41) AND (1 <= p51) AND ((p0 <= 0) OR (p38 <= 0))))",
"processed_size": 437,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EG((AX(((1 <= p0) AND (1 <= p36) AND (1 <= p45))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p38) AND (1 <= p51) AND (1 <= p7) AND (1 <= p44) AND (1 <= p52)))))",
"processed_size": 187,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "EG(AF(EX(((1 <= p4) AND (1 <= p39) AND (1 <= p46)))))",
"processed_size": 53,
"rewrites": 83
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 27995,
"markings": 8567,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"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": 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": "((1 <= p2) AND (1 <= p38) AND (1 <= p53))",
"processed_size": 41,
"rewrites": 83
},
"result":
{
"edges": 7714,
"markings": 2091,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p37) AND (1 <= p48) AND (1 <= p1) AND (1 <= p49))",
"processed_size": 70,
"rewrites": 83
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((1 <= p5) AND (1 <= p39) AND (1 <= p47)) OR (((p3 <= 0) OR (p39 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p38 <= 0) OR (p52 <= 0))))",
"processed_size": 137,
"rewrites": 83
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 5
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EG(E(((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p0) AND (1 <= p38) AND (1 <= p51)) U ((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0))))",
"processed_size": 136,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 8,
"produced_by": "CTL model checker",
"value": true
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"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": "EG((E(((1 <= p3) AND (1 <= p39) AND (1 <= p45)) U ((1 <= p2) AND (1 <= p36) AND (1 <= p47))) OR ((1 <= p7) AND (1 <= p42) AND (1 <= p46))))",
"processed_size": 139,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 43945,
"markings": 10994,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E(((1 <= p5) AND (1 <= p39) AND (1 <= p47)) U (AG(((1 <= p3) AND (1 <= p39) AND (1 <= p45))) AND ((p0 <= 0) OR (p37 <= 0) OR (p48 <= 0) OR ((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p5) AND (1 <= p40)))))",
"processed_size": 215,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 24101,
"markings": 8274,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EF((((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0) OR (p4 <= 0) OR (p40 <= 0) OR (p49 <= 0)) AND (AG(((1 <= p7) AND (1 <= p43) AND (1 <= p49))) OR ((p2 <= 0) OR ((p38 <= 0) OR (p53 <= 0))))))",
"processed_size": 188,
"rewrites": 82
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "EF((AF(((p1 <= 0) OR (p37 <= 0) OR (p49 <= 0))) AND AG(((1 <= p5) AND (1 <= p40) AND (1 <= p50)))))",
"processed_size": 101,
"rewrites": 83
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 96619,
"markings": 11776,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p4) AND (1 <= p40) AND (1 <= p49))",
"processed_size": 41,
"rewrites": 83
},
"result":
{
"edges": 7712,
"markings": 2089,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "(F ((((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p41) AND (1 <= p52)))) U ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0) OR (p3 <= 0) OR (p39 <= 0) OR (p45 <= 0) OR (((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p2 <= 0) OR (p36 <= 0) OR (p47 <= 0)))))",
"processed_size": 277,
"rewrites": 82
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 50144,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : E(G((E((** U **)) OR **))) : A(X((A(F(**)) OR A(X(**))))) : E(G((E(X(**)) OR (** OR (** OR (** OR **)))))) : A((A(F(**)) U **)) : (A(F(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))) : E(G(E((** U **)))) : A(G((** OR E(X(*))))) : A(F((A(X(*)) AND (E(X(**)) OR A(F(**)))))) : (E(G((A(X(**)) OR (** OR **)))) AND (A(F(*)) OR (E(X(**)) OR (** OR (** OR (** OR (** OR (** OR **)))))))) : A(F(**)) : E(F((A(F(**)) AND A(G(**))))) : A(G(E(F(**)))) : E(F((** AND (A(G(**)) OR (** OR (** OR **)))))) : E((** U (A(G(**)) AND **))) : E(G(A(F(E(X(**))))))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 28,
"places": 54,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 27
},
"result":
{
"preliminary_value": "yes no no no no yes yes yes no yes no no no yes no no ",
"value": "yes no no no no yes yes yes no yes no no no yes 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: 81/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 27 transitions, 27 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: A ((((1 <= p6) AND (1 <= p44) AND (1 <= p51)) U A (F (((p2 <= 0) OR (p38 <= 0) OR (p53 <= 0)))))) : E (G ((E ((((1 <= p3) AND (1 <= p39) AND (1 <= p45)) U ((1 <= p2) AND (1 <= p36) AND (1 <= p47)))) OR ((1 <= p7) AND (1 <= p42) AND (1 <= p46))))) : A (X ((A (F (((1 <= p6) AND (1 <= p42) AND (1 <= p45) AND (1 <= p8) AND (1 <= p43) AND (1 <= p50)))) OR A (X ((((1 <= p5) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p2) AND (1 <= p38) AND (1 <= p53)))))))) : E (G (((((E (X (((1 <= p4) AND (1 <= p41) AND (1 <= p52)))) OR ((1 <= p7) AND (1 <= p43) AND (1 <= p49))) OR ((1 <= p2) AND (1 <= p37) AND (1 <= p50))) OR ((1 <= p8) AND (1 <= p43) AND (1 <= p50))) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52))))) : A ((A (F ((((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p41) AND (1 <= p52))))) U ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0) OR (p3 <= 0) OR (p39 <= 0) OR (p45 <= 0) OR (((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p2 <= 0) OR (p36 <= 0) OR (p47 <= 0)))))) : (((((((((NOT(E (G (((1 <= p4) AND (1 <= p40) AND (1 <= p49))))) OR (p4 <= 0)) OR (p41 <= 0)) OR (p52 <= 0)) OR (p8 <= 0)) OR (p43 <= 0)) OR (p50 <= 0)) OR (p5 <= 0)) OR (p53 <= 0)) OR ((1 <= p4) AND (1 <= p40) AND (1 <= p49) AND ((p5 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p38 <= 0) OR (p52 <= 0)))) : E (G (E ((((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p0) AND (1 <= p38) AND (1 <= p51)) U ((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0)))))) : A (G ((((p5 <= 0) OR (p41 <= 0) OR (p53 <= 0)) OR NOT(A (X (((1 <= p5) AND (1 <= p39) AND (1 <= p47)))))))) : A (F ((NOT(E (X (((1 <= p2) AND (1 <= p38) AND (1 <= p53))))) AND (E (X (((1 <= p1) AND (1 <= p36) AND (1 <= p46)))) OR A (F (((1 <= p0) AND (1 <= p38) AND (1 <= p51)))))))) : (E (G (((A (X (((1 <= p0) AND (1 <= p36) AND (1 <= p45)))) OR ((1 <= p7) AND (1 <= p43) AND (1 <= p49))) OR ((1 <= p0) AND (1 <= p38) AND (1 <= p51) AND (1 <= p7) AND (1 <= p44) AND (1 <= p52))))) AND (((((((NOT(E (G (((1 <= p7) AND (1 <= p43) AND (1 <= p49))))) OR E (X (((1 <= p7) AND (1 <= p44) AND (1 <= p52))))) OR ((1 <= p3) AND (1 <= p41) AND (1 <= p51))) OR ((1 <= p3) AND (1 <= p40) AND (1 <= p48))) OR ((1 <= p8) AND (1 <= p42) AND (1 <= p47))) OR (((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0)))) OR ((1 <= p4) AND (1 <= p40) AND (1 <= p49) AND (1 <= p5) AND (1 <= p41) AND (1 <= p53))) OR ((1 <= p3) AND (1 <= p41) AND (1 <= p51) AND ((p0 <= 0) OR (p38 <= 0))))) : A (F ((((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0)) AND (((1 <= p3) AND (1 <= p39) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52)))))) : E (F ((A (F (((p1 <= 0) OR (p37 <= 0) OR (p49 <= 0)))) AND A (G (((1 <= p5) AND (1 <= p40) AND (1 <= p50))))))) : A (G (E (F (((1 <= p0) AND (1 <= p37) AND (1 <= p48) AND (1 <= p1) AND (1 <= p49)))))) : E (F ((((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0) OR (p4 <= 0) OR (p40 <= 0) OR (p49 <= 0)) AND (((A (G (((1 <= p7) AND (1 <= p43) AND (1 <= p49)))) OR (p2 <= 0)) OR (p38 <= 0)) OR (p53 <= 0))))) : E ((((1 <= p5) AND (1 <= p39) AND (1 <= p47)) U (A (G (((1 <= p3) AND (1 <= p39) AND (1 <= p45)))) AND ((p0 <= 0) OR (p37 <= 0) OR (p48 <= 0) OR ((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p5) AND (1 <= p40)))))) : E (G (A (F (E (X (((1 <= p4) AND (1 <= p39) AND (1 <= p46))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (F (((1 <= p6) AND (1 <= p42) AND (1 <= p45) AND (1 <= p8) AND (1 <= p43) AND (1 <= p50)))) OR A (X ((((1 <= p5) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p2) AND (1 <= p38) AND (1 <= p53))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AF(((1 <= p6) AND (1 <= p42) AND (1 <= p45) AND (1 <= p8) AND (1 <= p43) AND (1 <= p50))) OR AX((((1 <= p5) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p2) AND (1 <= p38) AND (1 <= p53))))))
lola: processed formula length: 192
lola: 83 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X (((1 <= p4) AND (1 <= p41) AND (1 <= p52)))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR (((1 <= p2) AND (1 <= p37) AND (1 <= p50)) OR (((1 <= p8) AND (1 <= p43) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX(((1 <= p4) AND (1 <= p41) AND (1 <= p52))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR (((1 <= p2) AND (1 <= p37) AND (1 <= p50)) OR (((1 <= p8) AND (1 <= p43) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52)))))))
lola: processed formula length: 237
lola: 82 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: 11692 markings, 40911 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p5 <= 0) OR (p41 <= 0) OR (p53 <= 0)) OR E (X (((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p5 <= 0) OR (p41 <= 0) OR (p53 <= 0)) OR EX(((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0)))))
lola: processed formula length: 96
lola: 82 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11776 markings, 56619 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (((p2 <= 0) OR (p38 <= 0) OR (p53 <= 0)))) AND (E (X (((1 <= p1) AND (1 <= p36) AND (1 <= p46)))) OR A (F (((1 <= p0) AND (1 <= p38) AND (1 <= p51))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX(((p2 <= 0) OR (p38 <= 0) OR (p53 <= 0))) AND (EX(((1 <= p1) AND (1 <= p36) AND (1 <= p46))) OR AF(((1 <= p0) AND (1 <= p38) AND (1 <= p51))))))
lola: processed formula length: 152
lola: 84 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: 15 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((A (X (((1 <= p0) AND (1 <= p36) AND (1 <= p45)))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p38) AND (1 <= p51) AND (1 <= p7) AND (1 <= p44) AND (1 <= p52)))))) AND (A (F (((p7 <= 0) OR (p43 <= 0) OR (p49 <= 0)))) OR (E (X (((1 <= p7) AND (1 <= p44) AND (1 <= p52)))) OR (((1 <= p3) AND (1 <= p41) AND (1 <= p51)) OR (((1 <= p3) AND (1 <= p40) AND (1 <= p48)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p41) AND (1 <= p51)) OR (((1 <= p3) AND (1 <= p40) AND (1 <= p48)) OR (((1 <= p8) AND (1 <= p42) AND (1 <= p47)) OR ((((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0))) OR (((1 <= p4) AND (1 <= p40) AND (1 <= p49) AND (1 <= p5) AND (1 <= p41) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p41) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p3) AND (1 <= p41) AND (1 <= p51)) OR ((1 <= p3) AND (1 <= p40) AND (1 <= p48)) OR ((1 <= p8) AND (1 <= p42) AND (1 <= p47)) OR (((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0)) AND ((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0))) OR ((1 <= p4) AND (1 <= p40) AND (1 <= p49) AND (1 <= p5) AND (1 <= p41) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p41) AND (1 <= ... (shortened)
lola: processed formula length: 437
lola: 89 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 29 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X (((1 <= p0) AND (1 <= p36) AND (1 <= p45)))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p38) AND (1 <= p51) AND (1 <= p7) AND (1 <= p44) AND (1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AX(((1 <= p0) AND (1 <= p36) AND (1 <= p45))) OR (((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p38) AND (1 <= p51) AND (1 <= p7) AND (1 <= p44) AND (1 <= p52)))))
lola: processed formula length: 187
lola: 82 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (E (X (((1 <= p4) AND (1 <= p39) AND (1 <= p46))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(EX(((1 <= p4) AND (1 <= p39) AND (1 <= p46)))))
lola: processed formula length: 53
lola: 83 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: 8567 markings, 27995 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p2 <= 0) OR (p38 <= 0) OR (p53 <= 0))))
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: ((1 <= p2) AND (1 <= p38) AND (1 <= p53))
lola: processed formula length: 41
lola: 83 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: ((p2 <= 0) OR (p38 <= 0) OR (p53 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 2091 markings, 7714 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p0) AND (1 <= p37) AND (1 <= p48) AND (1 <= p1) AND (1 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p0) AND (1 <= p37) AND (1 <= p48) AND (1 <= p1) AND (1 <= p49))
lola: processed formula length: 70
lola: 83 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: state equation task get result unparse finished++ id 1
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0)) AND (((1 <= p3) AND (1 <= p39) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52))))))
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: (((1 <= p5) AND (1 <= p39) AND (1 <= p47)) OR (((p3 <= 0) OR (p39 <= 0) OR (p45 <= 0)) AND ((p1 <= 0) OR (p38 <= 0) OR (p52 <= 0))))
lola: processed formula length: 137
lola: 83 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: (((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0)) AND (((1 <= p3) AND (1 <= p39) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p38) AND (1 <= p52))))
lola: SUBRESULT
lola: result: no
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 5 conjunctive subformulas
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p0) AND (1 <= p38) AND (1 <= p51)) U ((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0))))))
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 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p0) AND (1 <= p38) AND (1 <= p51)) U ((p6 <= 0) OR (p44 <= 0) OR (p51 <= 0))))
lola: processed formula length: 136
lola: 82 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: 8 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((((1 <= p3) AND (1 <= p39) AND (1 <= p45)) U ((1 <= p2) AND (1 <= p36) AND (1 <= p47)))) OR ((1 <= p7) AND (1 <= p42) AND (1 <= p46)))))
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 <= p3) AND (1 <= p39) AND (1 <= p45)) U ((1 <= p2) AND (1 <= p36) AND (1 <= p47))) OR ((1 <= p7) AND (1 <= p42) AND (1 <= p46))))
lola: processed formula length: 139
lola: 82 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: 10994 markings, 43945 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p5) AND (1 <= p39) AND (1 <= p47)) U (A (G (((1 <= p3) AND (1 <= p39) AND (1 <= p45)))) AND ((p0 <= 0) OR (p37 <= 0) OR (p48 <= 0) OR ((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p5) AND (1 <= p40))))))
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(((1 <= p5) AND (1 <= p39) AND (1 <= p47)) U (AG(((1 <= p3) AND (1 <= p39) AND (1 <= p45))) AND ((p0 <= 0) OR (p37 <= 0) OR (p48 <= 0) OR ((1 <= p2) AND (1 <= p37) AND (1 <= p50) AND (1 <= p5) AND (1 <= p40)))))
lola: processed formula length: 215
lola: 82 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: 8274 markings, 24101 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0) OR (p4 <= 0) OR (p40 <= 0) OR (p49 <= 0)) AND (A (G (((1 <= p7) AND (1 <= p43) AND (1 <= p49)))) OR ((p2 <= 0) OR ((p38 <= 0) OR (p53 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((p5 <= 0) OR (p39 <= 0) OR (p47 <= 0) OR (p4 <= 0) OR (p40 <= 0) OR (p49 <= 0)) AND (AG(((1 <= p7) AND (1 <= p43) AND (1 <= p49))) OR ((p2 <= 0) OR ((p38 <= 0) OR (p53 <= 0))))))
lola: processed formula length: 188
lola: 82 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (((p1 <= 0) OR (p37 <= 0) OR (p49 <= 0)))) AND A (G (((1 <= p5) AND (1 <= p40) AND (1 <= p50)))))))
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((AF(((p1 <= 0) OR (p37 <= 0) OR (p49 <= 0))) AND AG(((1 <= p5) AND (1 <= p40) AND (1 <= p50)))))
lola: processed formula length: 101
lola: 83 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: 11776 markings, 96619 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p4 <= 0) OR (p40 <= 0) OR (p49 <= 0)))) OR ((p4 <= 0) OR ((p41 <= 0) OR ((p52 <= 0) OR ((p8 <= 0) OR ((p43 <= 0) OR ((p50 <= 0) OR ((p5 <= 0) OR ((p53 <= 0) OR ((1 <= p4) AND (1 <= p40) AND (1 <= p49) AND ((p5 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p38 <= 0) OR (p52 <= 0))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p4 <= 0) OR (p40 <= 0) OR (p49 <= 0))))
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:788
lola: processed formula: ((1 <= p4) AND (1 <= p40) AND (1 <= p49))
lola: processed formula length: 41
lola: 83 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: ((p4 <= 0) OR (p40 <= 0) OR (p49 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 2089 markings, 7712 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p41) AND (1 <= p52))))) U ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0) OR (p3 <= 0) OR (p39 <= 0) OR (p45 <= 0) OR (((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p2 <= 0) OR (p36 <= 0) OR (p47 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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: (F ((((1 <= p7) AND (1 <= p43) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p41) AND (1 <= p52)))) U ((p0 <= 0) OR (p38 <= 0) OR (p51 <= 0) OR (p3 <= 0) OR (p39 <= 0) OR (p45 <= 0) OR (((p1 <= 0) OR (p36 <= 0) OR (p46 <= 0)) AND ((p2 <= 0) OR (p36 <= 0) OR (p47 <= 0)))))
lola: processed formula length: 277
lola: 82 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: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 10 markings, 10 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes yes yes no yes no no no yes no no
lola:
preliminary result: yes no no no no yes yes yes no yes no no no yes no no
lola: memory consumption: 50144 KB
lola: time consumption: 4 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="Sudoku-PT-AN03"
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 Sudoku-PT-AN03, 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 r228-oct2-159033547400332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN03.tgz
mv Sudoku-PT-AN03 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 ;