fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r228-oct2-159033547400324
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Sudoku-PT-AN02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.010 3600000.00 7331.00 30.70 FTFTFFFFFFFFFTFT 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-159033547400324.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-AN02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547400324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.7K Jun 3 09:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Jun 3 09:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jun 3 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 3 09:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.0K Jun 3 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Jun 3 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jun 3 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 6.0K 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-AN02-CTLFireability-00
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-01
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-02
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-03
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-04
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-05
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-06
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-07
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-08
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-09
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-10
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-11
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-12
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-13
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-14
FORMULA_NAME Sudoku-PT-AN02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591395647430

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): 20 ms
[2020-06-05 22:20:48] [INFO ] Transformed 20 places.
[2020-06-05 22:20:48] [INFO ] Transformed 8 transitions.
[2020-06-05 22:20:48] [INFO ] Parsed PT model containing 20 places and 8 transitions in 51 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Finished random walk after 7 steps, including 1 resets, run visited all 27 properties in 2 ms. (steps per millisecond=3 )
[2020-06-05 22:20:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 22:20:49] [INFO ] Flatten gal took : 30 ms
[2020-06-05 22:20:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 22:20:49] [INFO ] Flatten gal took : 5 ms
FORMULA Sudoku-PT-AN02-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 22:20:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-05 22:20:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Sudoku-PT-AN02 @ 3570 seconds

FORMULA Sudoku-PT-AN02-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ Sudoku-PT-AN02

{
"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:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 1,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(A(AF(((1 <= p2) AND (1 <= p15) AND (1 <= p18))) U ((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p14) AND (1 <= p16) AND (1 <= p3) AND (1 <= p17))) AND AF(EX(((1 <= p1) AND (1 <= p12) AND (1 <= p17) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18)))))",
"processed_size": 251,
"rewrites": 37
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"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": "((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0) OR (p1 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (((p3 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p16 <= 0))))",
"processed_size": 149,
"rewrites": 36
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"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": "AX(EG(AF(((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))",
"processed_size": 53,
"rewrites": 36
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "CTL model checker",
"value": false
},
"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": 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": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)))",
"processed_size": 87,
"rewrites": 36
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF((EX(((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p1) AND (1 <= p13) AND (1 <= p19))) AND (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19))))))",
"processed_size": 237,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 5,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF((AG(((1 <= p1) AND (1 <= p12) AND (1 <= p17))) AND ((1 <= p2) AND ((1 <= p15) AND ((1 <= p18) AND (EX(((1 <= p2) AND (1 <= p14) AND (1 <= p16))) AND (((1 <= p3) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)))))))))",
"processed_size": 247,
"rewrites": 36
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 11,
"markings": 5,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "AX((AG(((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16))) OR (AF(((1 <= p3) AND (1 <= p15) AND (1 <= p19))) OR (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))))",
"processed_size": 239,
"rewrites": 36
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "AX(((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))",
"processed_size": 45,
"rewrites": 34
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))",
"processed_size": 89,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"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": "EX(((1 <= p0) AND (1 <= p13) AND (1 <= p18)))",
"processed_size": 45,
"rewrites": 34
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR (p3 <= 0) OR (p15 <= 0) OR (p19 <= 0) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18)))",
"processed_size": 221,
"rewrites": 36
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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": 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(((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0))))",
"processed_size": 49,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 40,
"markings": 29,
"produced_by": "CTL model checker",
"value": true
},
"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": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "AF(EG(((1 <= p1) AND (1 <= p13) AND (1 <= p19))))",
"processed_size": 49,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 40,
"markings": 30,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E(EG(((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0))) R EF(((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))))",
"processed_size": 96,
"rewrites": 36
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EG((AF(((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR (((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))))",
"processed_size": 190,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 119,
"markings": 35,
"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": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "EG(AF(((1 <= p2) AND (1 <= p14) AND (1 <= p16))))",
"processed_size": 49,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 74,
"markings": 31,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 14,
"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": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "EG(AF(((1 <= p2) AND (1 <= p14) AND (1 <= p16))))",
"processed_size": 49,
"rewrites": 35
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 74,
"markings": 31,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)))))",
"processed_size": 97,
"rewrites": 35
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 42008,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A((A(F(**)) U **)) AND A(F(E(X(**))))) : E((E(G(*)) R E(F(*)))) : A(F(*)) : E(G(A(F(**)))) : E(G((A(F(**)) OR (** OR (** OR **))))) : A(F(E(G(*)))) : A(X(A(F(**)))) : (A(G(**)) OR E(G(A(F(**))))) : A(X(E(G(A(F(**)))))) : (E(X(**)) AND A(F(**))) : A(F((E(X(**)) AND (** AND **)))) : A(F((A(G(**)) AND (** AND (** AND (** AND (E(X(**)) AND **))))))) : A(X((A(G(**)) OR (A(F(**)) OR **)))) : (A(X(E(G(**)))) AND (A(X(A(X(**)))) AND A(X(**)))) : (E(X(**)) AND A(F(**)))"
},
"net":
{
"arcs": 32,
"conflict_clusters": 9,
"places": 20,
"places_significant": 8,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no yes no yes no no no no no no no no no no yes ",
"value": "no yes no yes no no no no no no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 28/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 640
lola: finding significant places
lola: 20 places, 8 transitions, 8 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 ((A (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18)))) U ((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p14) AND (1 <= p16) AND (1 <= p3) AND (1 <= p17)))) AND A (F (E (X (((1 <= p1) AND (1 <= p12) AND (1 <= p17) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18))))))) : NOT(A ((A (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) U A (G (((1 <= p1) AND (1 <= p12) AND (1 <= p17))))))) : NOT(E (G ((((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR (p3 <= 0) OR (p15 <= 0) OR (p19 <= 0) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18)))))) : E (G (A (F (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))))) : E (G ((((A (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16))) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))) : A (F (NOT(A (F (((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0))))))) : A (X (A (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p1) AND (1 <= p12) AND (1 <= p17) AND (((1 <= p3) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p16)))))))) : (A (G (A (G ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19))))))) OR E (G (A (F (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))) : A (X (E (G (A (F (((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))))) : (E (X (((1 <= p2) AND (1 <= p15) AND (1 <= p18)))) AND A (F (((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)))))) : A (F (((E (X (((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p1) AND (1 <= p13) AND (1 <= p19)))) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0))) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))) : A (F ((((((A (G (((1 <= p1) AND (1 <= p12) AND (1 <= p17)))) AND (1 <= p2)) AND (1 <= p15)) AND (1 <= p18)) AND E (X (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))) AND (((1 <= p3) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)))))) : A (X (((A (G (((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16)))) OR A (F (((1 <= p3) AND (1 <= p15) AND (1 <= p19))))) OR (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))))) : A (X (((E (G (((1 <= p3) AND (1 <= p15) AND (1 <= p19)))) AND A (X (((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p2) AND (1 <= p14) AND (1 <= p16))))) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))) : (E (X (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) AND A (F ((((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((A (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18)))) U ((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p14) AND (1 <= p16) AND (1 <= p3) AND (1 <= p17)))) AND A (F (E (X (((1 <= p1) AND (1 <= p12) AND (1 <= p17) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (A(AF(((1 <= p2) AND (1 <= p15) AND (1 <= p18))) U ((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p14) AND (1 <= p16) AND (1 <= p3) AND (1 <= p17))) AND AF(EX(((1 <= p1) AND (1 <= p12) AND (1 <= p17) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18)))))
lola: processed formula length: 251
lola: 37 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p1) AND (1 <= p12) AND (1 <= p17) AND (((1 <= p3) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p16))))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0) OR (p1 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (((p3 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p16 <= 0))))
lola: processed formula length: 149
lola: 36 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (A (F (((1 <= p3) AND (1 <= p14) AND (1 <= p17))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(AF(((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))
lola: processed formula length: 53
lola: 36 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= p2) AND (1 <= p15) AND (1 <= p18)))) AND A (F (((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 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: ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR ((1 <= p2) AND (1 <= p14) AND (1 <= p16)))
lola: processed formula length: 87
lola: 36 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 <= p0) AND (1 <= p12) AND (1 <= p16) AND ((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p1) AND (1 <= p13) AND (1 <= p19)))) AND (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX(((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p1) AND (1 <= p13) AND (1 <= p19))) AND (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)) AND (((1 <= p0) AND (1 <= p13) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p19))))))
lola: processed formula length: 237
lola: 35 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((1 <= p1) AND (1 <= p12) AND (1 <= p17)))) AND ((1 <= p2) AND ((1 <= p15) AND ((1 <= p18) AND (E (X (((1 <= p2) AND (1 <= p14) AND (1 <= p16)))) AND (((1 <= p3) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((1 <= p1) AND (1 <= p12) AND (1 <= p17))) AND ((1 <= p2) AND ((1 <= p15) AND ((1 <= p18) AND (EX(((1 <= p2) AND (1 <= p14) AND (1 <= p16))) AND (((1 <= p3) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16)))))))))
lola: processed formula length: 247
lola: 36 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: 5 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G (((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16)))) OR (A (F (((1 <= p3) AND (1 <= p15) AND (1 <= p19)))) OR (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AG(((1 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16))) OR (AF(((1 <= p3) AND (1 <= p15) AND (1 <= p19))) OR (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))))
lola: processed formula length: 239
lola: 36 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G (((1 <= p3) AND (1 <= p15) AND (1 <= p19)))))) AND (A (X (A (X (((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p2) AND (1 <= p14) AND (1 <= p16)))))) AND A (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0)))
lola: processed formula length: 45
lola: 34 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 0 significant temporal operators and needs 0 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 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) AND A (F ((((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)))))
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: (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))
lola: processed formula length: 89
lola: 36 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
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: The predicate eventually occurs.
lola: state equation task get result unparse finished++ id 0
lola: 1 markings, 0 edges
lola: formula 0: (((1 <= p1) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p15) AND (1 <= p18)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p0) AND (1 <= p13) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p0) AND (1 <= p13) AND (1 <= p18)))
lola: processed formula length: 45
lola: 34 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0) OR (p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND (1 <= p3) AND (1 <= p15) AND (1 <= p19) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p2 <= 0) OR (p15 <= 0) OR (p18 <= 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 <= p2) AND (1 <= p15) AND (1 <= p18) AND (1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR (p3 <= 0) OR (p15 <= 0) OR (p19 <= 0) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p2) AND (1 <= p15) AND (1 <= p18)))
lola: processed formula length: 221
lola: 36 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: 5 markings, 4 edges
lola: formula 0: (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0) OR (p0 <= 0) OR (p12 <= 0) OR (p16 <= 0)) AND (1 <= p3) AND (1 <= p15) AND (1 <= p19) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p2 <= 0) OR (p15 <= 0) OR (p18 <= 0)))
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p2 <= 0) OR (p15 <= 0) OR (p18 <= 0))))
lola: processed formula length: 49
lola: 35 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: 29 markings, 40 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p1) AND (1 <= p13) AND (1 <= p19))))))
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 <= p1) AND (1 <= p13) AND (1 <= p19))))
lola: processed formula length: 49
lola: 35 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: 30 markings, 40 edges
lola: ========================================
lola: subprocess 12 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0)))) R E (F (((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: processed formula: E(EG(((p0 <= 0) OR (p13 <= 0) OR (p18 <= 0))) R EF(((p1 <= 0) OR (p12 <= 0) OR (p17 <= 0))))
lola: processed formula length: 96
lola: 36 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 16 edges
lola: ========================================
lola: subprocess 13 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (((1 <= p0) AND (1 <= p13) AND (1 <= p18)))) OR (((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF(((1 <= p0) AND (1 <= p13) AND (1 <= p18))) OR (((1 <= p3) AND (1 <= p15) AND (1 <= p19)) OR (((1 <= p0) AND (1 <= p12) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17))))))
lola: processed formula length: 190
lola: 35 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: 35 markings, 119 edges
lola: ========================================
lola: subprocess 14 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19))))) OR E (G (A (F (((1 <= p2) AND (1 <= p14) AND (1 <= p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((1 <= p2) AND (1 <= p14) AND (1 <= p16))))
lola: processed formula length: 49
lola: 35 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: 31 markings, 74 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19))))) OR E (G (A (F (((1 <= p2) AND (1 <= p14) AND (1 <= p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((1 <= p2) AND (1 <= p14) AND (1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((1 <= p2) AND (1 <= p14) AND (1 <= p16))))
lola: processed formula length: 49
lola: 35 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: 31 markings, 74 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)))))
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 <= p2) AND (1 <= p14) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19)))))
lola: processed formula length: 97
lola: 35 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: state equation task get result unparse finished++ id 0
lola: 3 markings, 2 edges
lola: formula 0: (((p2 <= 0) OR (p14 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no no no no no no yes
lola:
preliminary result: no yes no yes no no no no no no no no no no yes
lola: memory consumption: 42008 KB
lola: time consumption: 3 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-AN02"
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-AN02, 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-159033547400324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;