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.r186-oct2-158987938800292.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 RwMutex-PT-r0010w2000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938800292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 3.4K Apr 12 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 13:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 9 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 24 05:38 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 RwMutex-PT-r0010w2000-CTLFireability-00
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-01
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-02
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-03
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-04
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-05
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-06
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-07
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-08
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-09
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-10
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-11
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-12
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-13
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-14
FORMULA_NAME RwMutex-PT-r0010w2000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591232995813

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:09:58] [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-04 01:09:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:09:58] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2020-06-04 01:09:58] [INFO ] Transformed 4030 places.
[2020-06-04 01:09:58] [INFO ] Transformed 4020 transitions.
[2020-06-04 01:09:58] [INFO ] Parsed PT model containing 4030 places and 4020 transitions in 384 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 48 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 15018 ms. (steps per millisecond=6 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 4020 rows 4030 cols
[2020-06-04 01:10:14] [INFO ] Computed 2020 place invariants in 913 ms
[2020-06-04 01:10:15] [INFO ] [Real]Absence check using 2020 positive place invariants in 296 ms returned unsat
[2020-06-04 01:10:16] [INFO ] [Real]Absence check using 2020 positive place invariants in 180 ms returned unsat
[2020-06-04 01:10:17] [INFO ] [Real]Absence check using 2020 positive place invariants in 1064 ms returned unsat
[2020-06-04 01:10:18] [INFO ] [Real]Absence check using 2020 positive place invariants in 140 ms returned unsat
[2020-06-04 01:10:18] [INFO ] [Real]Absence check using 2020 positive place invariants in 176 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-04 01:10:20] [INFO ] Flatten gal took : 1105 ms
[2020-06-04 01:10:20] [INFO ] Flatten gal took : 612 ms
[2020-06-04 01:10:20] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 26 ms.
[2020-06-04 01:10:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 72 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RwMutex-PT-r0010w2000 @ 3570 seconds

FORMULA RwMutex-PT-r0010w2000-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2870
rslt: Output for CTLFireability @ RwMutex-PT-r0010w2000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 01:10:21 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EG(EX(((1 <= p993) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))",
"processed_size": 191,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"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": 191
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 191
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p2829)",
"processed_size": 12,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 205
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EG(EX(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3804) AND (1 <= p69))))",
"processed_size": 207,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 205
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2144 <= 0)",
"processed_size": 12,
"rewrites": 110
},
"result":
{
"edges": 14240,
"markings": 3024,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3575)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3428)))",
"processed_size": 375,
"rewrites": 108
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p1607 <= 0) AND ((p158 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))",
"processed_size": 202,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3490))))",
"processed_size": 192,
"rewrites": 108
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 11
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 261
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(AX(((1 <= p3046) OR (1 <= p1525))))",
"processed_size": 39,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 4,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 37,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 37,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "AX((AX(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2490))) OR (AX((1 <= p2658)) OR (AG((1 <= p1549)) AND (((1 <= p1421) OR ((1 <= p14) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) AND ((1 <= p2147) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3904))))))))",
"processed_size": 654,
"rewrites": 110
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"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": 261
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "AX(((1 <= p1703) OR AF((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2690)) OR (1 <= p1517)))))",
"processed_size": 229,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 1772,
"markings": 889,
"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": 287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EX((AG(((1 <= p381) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) AND DEADLOCK))",
"processed_size": 206,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 2009,
"markings": 2010,
"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": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "AX(DEADLOCK)",
"processed_size": 12,
"rewrites": 107
},
"net":
{
"conflict_clusters": 2011,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 359
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EX(((1 <= p2713) AND EG(((p1042 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))))",
"processed_size": 211,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 26,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 14,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "EF((AX(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3815))) AND ((1 <= p677) AND ((1 <= p1138) AND ((1 <= p1139) AND ((1 <= p1140) AND ((1 <= p1141) AND ((1 <= p1142) AND ((1 <= p1143) AND ((1 <= p1144) AND ((1 <= p1145) AND ((1 <= p1147) AND ((1 <= p1148) AND ((p2621 <= 0) AND (EX((1 <= p1561)) AND ((p54 <= 0) OR (p76 <= 0)))))))))))))))))",
"processed_size": 476,
"rewrites": 109
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 14240,
"markings": 3024,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 479
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AF(E(((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3234 <= 0)) U ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2224 <= 0))))",
"processed_size": 378,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 4021,
"markings": 2011,
"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": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A(EF(((1 <= p423) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) U ((1 <= p3276) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3640 <= 0)) AND ((p1073 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3409 <= 0))))",
"processed_size": 602,
"rewrites": 108
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 2,
"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": 718
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AF((((1 <= p729) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p879) AND (p221 <= 0)) AND (AG(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3489))) OR AF(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p1334))))))",
"processed_size": 608,
"rewrites": 109
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "CTL model checker",
"value": false
},
"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": 958
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 958
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p2137 <= 0)))",
"processed_size": 20,
"rewrites": 107
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p1132)",
"processed_size": 12,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2453 <= 0)",
"processed_size": 12,
"rewrites": 109
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2872
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((1 <= p1986) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))",
"processed_size": 219,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((1 <= p1986) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))",
"processed_size": 219,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p1893 <= 0)",
"processed_size": 12,
"rewrites": 110
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 751648,
"runtime": 700.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(E(X(**)))) : (** OR E(G(E(X(**))))) : (E(X(E(F(**)))) OR E(F(A(G(**))))) : A((E(F(**)) U **)) : (E(G(*)) OR DEADLOCK) : (A(G(A(F(**)))) OR (A((** U **)) AND (** AND **))) : (A(X(A(X(**)))) OR (A(G(**)) OR **)) : (A(F(**)) OR **) : A(X((A(X(**)) OR (A(X(**)) OR (A(G(**)) AND (** AND **)))))) : A(F((** AND (A(G(**)) OR A(F(**)))))) : A(X((** OR A(F(**))))) : E(X((A(G(**)) AND DEADLOCK))) : A(F(E((** U **)))) : A(X(DEADLOCK)) : E(X((** AND E(G(**))))) : E(F((A(X(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (E(X(**)) AND **))))))))))))))))"
},
"net":
{
"arcs": 48060,
"conflict_clusters": 2011,
"places": 4030,
"places_significant": 2010,
"singleton_clusters": 0,
"transitions": 4020
},
"result":
{
"preliminary_value": "no no yes no yes no no no no no no no yes no no no ",
"value": "no no yes no yes no no no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 8050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4030
lola: finding significant places
lola: 4030 places, 4020 transitions, 2010 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E (G (E (X (((1 <= p993) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))))) : ((1 <= p2829) OR E (G (E (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3804) AND (1 <= p69))))))) : E (F ((E (X ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3575)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3428))))) OR A (G ((1 <= p2144)))))) : A ((E (F (((1 <= p423) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) U ((1 <= p3276) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3640 <= 0)) AND ((p1073 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3409 <= 0))))) : (NOT(A (F ((1 <= p2137)))) OR A (X ((1 <= 0)))) : (A (G (A (F ((1 <= p1893))))) OR ((A ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3535)) U ((1 <= p782) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND (1 <= p1986)) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))) : ((A (X (A (X (((1 <= p3046) OR (1 <= p1525)))))) OR A (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3490))))) OR ((p1607 <= 0) AND ((p158 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))) : (A (F ((1 <= p2453))) OR (1 <= p1132)) : A (X (((A (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2490)))) OR A (X ((1 <= p2658)))) OR ((A (G ((1 <= p1549))) AND ((1 <= p1421) OR ((1 <= p14) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND ((1 <= p2147) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3904))))))) : A (F ((((1 <= p729) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p879) AND (p221 <= 0)) AND (A (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3489)))) OR A (F (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p1334)))))))) : A (X (((1 <= p1703) OR A (F ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2690)) OR (1 <= p1517))))))) : E (X ((A (G (((1 <= p381) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND A (X ((1 <= 0)))))) : A (F (E ((((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3234 <= 0)) U ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2224 <= 0)))))) : A (X (A (X ((1 <= 0))))) : E (X (((1 <= p2713) AND E (G (((p1042 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))))))) : E (F (((((((((((((((A (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3815)))) AND (1 <= p677)) AND (1 <= p1138)) AND (1 <= p1139)) AND (1 <= p1140)) AND (1 <= p1141)) AND (1 <= p1142)) AND (1 <= p1143)) AND (1 <= p1144)) AND (1 <= p1145)) AND (1 <= p1147)) AND (1 <= p1148)) AND (p2621 <= 0)) AND E (X ((1 <= p1561)))) AND ((p54 <= 0) OR (p76 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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: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: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: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: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: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: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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((1 <= p993) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))))
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 <= p993) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))
lola: processed formula length: 191
lola: 108 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2829) OR E (G (E (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3804) AND (1 <= p69)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2829)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2829)
lola: processed formula length: 12
lola: 106 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3804) AND (1 <= p69))))))
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 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3804) AND (1 <= p69))))
lola: processed formula length: 207
lola: 108 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3575)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3428))))))) OR E (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p2144)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2144 <= 0)
lola: processed formula length: 12
lola: 110 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p2144)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p2144 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: try reading problem file CTLFireability-2-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3024 markings, 14240 edges
lola: ========================================
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3575)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3428)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3575)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3428)))
lola: processed formula length: 375
lola: 108 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3575)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3428)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 2 markings, 1 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (X (((1 <= p3046) OR (1 <= p1525)))))) OR (A (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3490)))) OR ((p1607 <= 0) AND ((p158 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1607 <= 0) AND ((p158 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1607 <= 0) AND ((p158 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))
lola: processed formula length: 202
lola: 106 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 12 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3490))))
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 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3490))))
lola: processed formula length: 192
lola: 108 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3490 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (((1 <= p3046) OR (1 <= p1525))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AX(((1 <= p3046) OR (1 <= p1525))))
lola: processed formula length: 39
lola: 108 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2490)))) OR (A (X ((1 <= p2658))) OR (A (G ((1 <= p1549))) AND (((1 <= p1421) OR ((1 <= p14) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AX(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2490))) OR (AX((1 <= p2658)) OR (AG((1 <= p1549)) AND (((1 <= p1421) OR ((1 <= p14) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p... (shortened)
lola: processed formula length: 654
lola: 110 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p1703) OR A (F ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2690)) OR (1 <= p1517)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p1703) OR AF((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2690)) OR (1 <= p1517)))))
lola: processed formula length: 229
lola: 108 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: 889 markings, 1772 edges
lola: ========================================
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G (((1 <= p381) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((AG(((1 <= p381) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) AND DEADLOCK))
lola: processed formula length: 206
lola: 108 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: 2010 markings, 2009 edges
lola: ========================================
lola: subprocess 7 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(DEADLOCK)
lola: processed formula length: 12
lola: 107 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: subprocess 8 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p2713) AND E (G (((p1042 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p2713) AND EG(((p1042 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))))
lola: processed formula length: 211
lola: 108 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3815)))) AND ((1 <= p677) AND ((1 <= p1138) AND ((1 <= p1139) AND ((1 <= p1140) AND ((1 <= p1141) AND ((1 <= p1142) AND ((1 <= p1143) AND ((1 <= p1144) AND ((1 <= p1145) AND ((1 <= p1147) AND ((1 <= p1148) AND... (shortened)
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:806
lola: processed formula: EF((AX(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3815))) AND ((1 <= p677) AND ((1 <= p1138) AND ((1 <= p1139) AND ((1 <= p1140) AND ((1 <= p1141) AND ((1 <= p1142) AND ((1 <= p1143) AND ((1 <= p1144) AND ((1 <= p1145) AND ((1 <= p1147) AND ((1 <= p1148) AND ((p262... (shortened)
lola: processed formula length: 476
lola: 109 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: 3024 markings, 14240 edges
lola: ========================================
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3234 <= 0)) U ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2224 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3234 <= 0)) U ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2224 <= 0))))
lola: processed formula length: 378
lola: 108 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: 2011 markings, 4021 edges
lola: ========================================
lola: subprocess 11 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F (((1 <= p423) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) U ((1 <= p3276) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3640 <= 0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EF(((1 <= p423) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) U ((1 <= p3276) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3640 <= 0)) AND (... (shortened)
lola: processed formula length: 602
lola: 108 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: 2 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p729) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p879) AND (p221 <= 0)) AND (A (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)... (shortened)
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:811
lola: processed formula: AF((((1 <= p729) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p879) AND (p221 <= 0)) AND (AG(((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (... (shortened)
lola: processed formula length: 608
lola: 109 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p2137 <= 0))) OR DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 106 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2137 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p2137 <= 0)))
lola: processed formula length: 20
lola: 107 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p2137)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 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 is possibly preserved.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p2453))) OR (1 <= p1132))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p1132)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p1132)
lola: processed formula length: 12
lola: 106 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p2453)))
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: (p2453 <= 0)
lola: processed formula length: 12
lola: 109 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 <= p2453)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((1 <= p1893))))) OR (A ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3535)) U ((1 <= p782) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1986) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p1986) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))
lola: processed formula length: 219
lola: 107 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 13 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 (A (F ((1 <= p1893))))) OR (A ((((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3535)) U ((1 <= p782) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p1986) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p1986) AND ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2779 <= 0) OR (p241 <= 0)))
lola: processed formula length: 219
lola: 107 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 13 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p1893)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1893 <= 0)
lola: processed formula length: 12
lola: 110 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: 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 <= p1893)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p1893 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: try reading problem file CTLFireability-17-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no no no no no yes no no no
lola:
preliminary result: no no yes no yes no no no no no no no yes no no no
lola: memory consumption: 751648 KB
lola: time consumption: 700 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="RwMutex-PT-r0010w2000"
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 RwMutex-PT-r0010w2000, 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 r186-oct2-158987938800292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w2000.tgz
mv RwMutex-PT-r0010w2000 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 ;