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.r184-oct2-158987928500420.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 JoinFreeModules-PT-0020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928500420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.0K Apr 7 18:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 7 18:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 20:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 20:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 04:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 5 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 5 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 113K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591207062508

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:57:44] [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-03 17:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:57:44] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-06-03 17:57:44] [INFO ] Transformed 101 places.
[2020-06-03 17:57:44] [INFO ] Transformed 161 transitions.
[2020-06-03 17:57:44] [INFO ] Parsed PT model containing 101 places and 161 transitions in 117 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 269 ms. (steps per millisecond=371 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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]
// Phase 1: matrix 161 rows 100 cols
[2020-06-03 17:57:44] [INFO ] Computed 20 place invariants in 8 ms
[2020-06-03 17:57:44] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 17:57:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:57:45] [INFO ] Flatten gal took : 36 ms
[2020-06-03 17:57:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:57:45] [INFO ] Flatten gal took : 15 ms
FORMULA JoinFreeModules-PT-0020-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:57:45] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 17:57:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0020 @ 3570 seconds

FORMULA JoinFreeModules-PT-0020-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0020-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1368
rslt: Output for CTLFireability @ JoinFreeModules-PT-0020

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AF(AX((5 <= p99)))",
"processed_size": 18,
"rewrites": 40
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (F (((5 <= p34) AND (2 <= p16))))",
"processed_size": 35,
"rewrites": 39
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 279
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))",
"processed_size": 58,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"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": "(4 <= p98)",
"processed_size": 10,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 334
},
"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": "(3 <= p5)",
"processed_size": 9,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((2 <= p76))",
"processed_size": 14,
"rewrites": 39
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(EX(((p18 <= 3) OR (p70 <= 4))))",
"processed_size": 35,
"rewrites": 40
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "EG(E((p15 <= 2) R (p71 <= 1)))",
"processed_size": 30,
"rewrites": 40
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 5,
"produced_by": "CTL model checker",
"value": true
},
"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": 459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((3 <= p30) OR A(AF((5 <= p90)) U AG((4 <= p33))))",
"processed_size": 50,
"rewrites": 41
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 7,
"markings": 5,
"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": 654
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"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 <= p7)",
"processed_size": 9,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 872
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": "AF(E((5 <= p14) U (3 <= p95)))",
"processed_size": 30,
"rewrites": 40
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 60,
"markings": 30,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 872
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((5 <= p0)))",
"processed_size": 17,
"rewrites": 39
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1308
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": "EF(A((2 <= p36) U (1 <= p7)))",
"processed_size": 29,
"rewrites": 40
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 1,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1308
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((p22 <= 0)))",
"processed_size": 18,
"rewrites": 39
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99)))",
"processed_size": 46,
"rewrites": 41
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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": "(1 <= p82)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((1 <= p52) AND (2 <= p27)) U (2 <= p32)))",
"processed_size": 46,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))",
"processed_size": 58,
"rewrites": 39
},
"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": 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": "(4 <= p98)",
"processed_size": 10,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(3 <= p5)",
"processed_size": 9,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((2 <= p76))",
"processed_size": 14,
"rewrites": 39
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((p22 <= 0)))",
"processed_size": 18,
"rewrites": 39
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99)))",
"processed_size": 46,
"rewrites": 41
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((2 <= p42) AND (p14 <= 4) AND (3 <= p60))",
"processed_size": 42,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 23,
"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": "(1 <= p82)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 24,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 22,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3848,
"runtime": 2202.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((E(G(**)) AND E(F(**))))) : (A(F(E((** U **)))) AND **) : E(G(E((* R *)))) : A(F(A(X(**)))) : E(G((* OR A(G(*))))) : E(F((A(X(**)) AND **))) : (E(F(**)) AND E(F(A((** U **))))) : (A(X(A(G(*)))) OR E(F(**))) : (E((** U **)) AND ((A(F(**)) OR **) AND (A(F(E(G(**)))) OR E((** U **))))) : (A(G((** OR E(X(**))))) OR (** OR (** OR (A(X(**)) OR (** OR **))))) : (A(G(E((** U **)))) AND E(F(*))) : E(F((A(X(**)) AND A(G(**))))) : E(G(E(X(*)))) : (** OR A((A(F(**)) U A(G(**))))) : A((A(G(*)) R *))"
},
"net":
{
"arcs": 460,
"conflict_clusters": 81,
"places": 100,
"places_significant": 80,
"singleton_clusters": 0,
"transitions": 161
},
"result":
{
"preliminary_value": "unknown no yes no unknown unknown yes yes no unknown unknown unknown yes no unknown ",
"value": "unknown no yes no unknown unknown yes yes no unknown unknown unknown yes no unknown "
},
"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: 261/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 161 transitions, 80 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (F ((E (G (((5 <= p25) OR (2 <= p27)))) AND E (F (((4 <= p3) AND (2 <= p97))))))) : (A (F (E (((5 <= p14) U (3 <= p95))))) AND (1 <= p7)) : E (G (NOT(A (((3 <= p15) U (2 <= p71)))))) : A (F (A (X ((5 <= p99))))) : NOT(A (F ((((2 <= p92) OR (3 <= p85) OR (2 <= p81) OR (2 <= p47)) AND E (F ((5 <= p49))))))) : E (F ((A (X ((1 <= p87))) AND ((p42 <= 1) OR (5 <= p60))))) : (E (F ((5 <= p0))) AND E (F (A (((2 <= p36) U (1 <= p7)))))) : (A (X (NOT(E (F ((2 <= p11)))))) OR E (F (((5 <= p34) AND (2 <= p16))))) : ((E ((((1 <= p52) AND (2 <= p27)) U (2 <= p32))) AND (A (F ((p82 <= 0))) OR ((2 <= p42) AND (p14 <= 4) AND (3 <= p60)))) AND (A (F (E (G ((5 <= p50))))) OR E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99))))) : (((((A (G (((3 <= p18) OR E (X ((1 <= p37)))))) OR (3 <= p5)) OR (4 <= p98)) OR A (X ((2 <= p76)))) OR (4 <= p43)) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76))) : (A (G (E (((2 <= p81) U (1 <= p47))))) AND E (F (NOT(E (G ((1 <= p22))))))) : E (F ((A (X ((4 <= p28))) AND A (G (((3 <= p58) OR (3 <= p85))))))) : E (G (NOT(A (X (((4 <= p18) AND (5 <= p70))))))) : ((3 <= p30) OR A ((A (F ((5 <= p90))) U A (G ((4 <= p33)))))) : NOT(E ((E (F ((2 <= p21))) U (5 <= p74))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((5 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX((5 <= p99)))
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((1 <= p87))) AND ((p42 <= 1) OR (5 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((1 <= p87)) AND ((p42 <= 1) OR (5 <= p60))))
lola: processed formula length: 52
lola: 40 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: 1018497 markings, 1362552 edges, 203699 markings/sec, 0 secs
lola: 2007958 markings, 2688080 edges, 197892 markings/sec, 5 secs
lola: 2998101 markings, 4012496 edges, 198029 markings/sec, 10 secs
lola: 3960707 markings, 5302985 edges, 192521 markings/sec, 15 secs
lola: 4912795 markings, 6579510 edges, 190418 markings/sec, 20 secs
lola: 5868137 markings, 7858092 edges, 191068 markings/sec, 25 secs
lola: 6812716 markings, 9124176 edges, 188916 markings/sec, 30 secs
lola: 7746573 markings, 10374803 edges, 186771 markings/sec, 35 secs
lola: 8684959 markings, 11631454 edges, 187677 markings/sec, 40 secs
lola: 9612589 markings, 12872725 edges, 185526 markings/sec, 45 secs
lola: 10539617 markings, 14112687 edges, 185406 markings/sec, 50 secs
lola: 11460852 markings, 15346702 edges, 184247 markings/sec, 55 secs
lola: 12400630 markings, 16605342 edges, 187956 markings/sec, 60 secs
lola: 13314282 markings, 17827681 edges, 182730 markings/sec, 65 secs
lola: 14247531 markings, 19075944 edges, 186650 markings/sec, 70 secs
lola: 15180413 markings, 20326304 edges, 186576 markings/sec, 75 secs
lola: 16119724 markings, 21583297 edges, 187862 markings/sec, 80 secs
lola: 17034852 markings, 22807878 edges, 183026 markings/sec, 85 secs
lola: 17975864 markings, 24066370 edges, 188202 markings/sec, 90 secs
lola: 18915949 markings, 25326615 edges, 188017 markings/sec, 95 secs
lola: 19864671 markings, 26596090 edges, 189744 markings/sec, 100 secs
lola: 20789135 markings, 27833426 edges, 184893 markings/sec, 105 secs
lola: 21729463 markings, 29090714 edges, 188066 markings/sec, 110 secs
lola: 22657350 markings, 30334522 edges, 185577 markings/sec, 115 secs
lola: 23594586 markings, 31588510 edges, 187447 markings/sec, 120 secs
lola: 24511142 markings, 32815468 edges, 183311 markings/sec, 125 secs
lola: 25451440 markings, 34072625 edges, 188060 markings/sec, 130 secs
lola: 26382257 markings, 35320287 edges, 186163 markings/sec, 135 secs
lola: 27320332 markings, 36575511 edges, 187615 markings/sec, 140 secs
lola: 28249573 markings, 37819662 edges, 185848 markings/sec, 145 secs
lola: 29185263 markings, 39070218 edges, 187138 markings/sec, 150 secs
lola: 30112841 markings, 40313803 edges, 185516 markings/sec, 155 secs
lola: 31045638 markings, 41561879 edges, 186559 markings/sec, 160 secs
lola: 31957224 markings, 42782472 edges, 182317 markings/sec, 165 secs
lola: 32810199 markings, 43926623 edges, 170595 markings/sec, 170 secs
lola: 33704904 markings, 45124799 edges, 178941 markings/sec, 175 secs
lola: 34595822 markings, 46316560 edges, 178184 markings/sec, 180 secs
lola: 35465833 markings, 47483579 edges, 174002 markings/sec, 185 secs
lola: 36330729 markings, 48641181 edges, 172979 markings/sec, 190 secs
lola: 37148291 markings, 49737964 edges, 163512 markings/sec, 195 secs
lola: 38008818 markings, 50890461 edges, 172105 markings/sec, 200 secs
lola: 38887747 markings, 52067580 edges, 175786 markings/sec, 205 secs
lola: 39772536 markings, 53252843 edges, 176958 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((p11 <= 1))))) OR E (F (((5 <= p34) AND (2 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((5 <= p34) AND (2 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((5 <= p34) AND (2 <= p16))))
lola: processed formula length: 35
lola: 39 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((5 <= p34) AND (2 <= p16))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-2-0.sara.
lola: ...considering subproblem: (A (G (((3 <= p18) OR E (X ((1 <= p37)))))) OR ((3 <= p5) OR ((4 <= p98) OR (A (X ((2 <= p76))) OR ((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))
lola: processed formula length: 58
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 4 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (4 <= p98)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (4 <= p98)
lola: processed formula length: 10
lola: 38 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 5 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p5)
lola: processed formula length: 9
lola:
38 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 6 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((2 <= p76))
lola: processed formula length: 14
lola: 39 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 7 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p18) OR E (X ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((3 <= p18) OR EX((1 <= p37))))
lola: processed formula length: 34
lola: 40 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: 2531033 markings, 3388438 edges, 506207 markings/sec, 0 secs
lola: 4886563 markings, 6544669 edges, 471106 markings/sec, 5 secs
lola: 7207947 markings, 9651791 edges, 464277 markings/sec, 10 secs
lola: 9433090 markings, 12632041 edges, 445029 markings/sec, 15 secs
lola: 11610877 markings, 15548214 edges, 435557 markings/sec, 20 secs
lola: 13785834 markings, 18458999 edges, 434991 markings/sec, 25 secs
lola: 15942055 markings, 21345476 edges, 431244 markings/sec, 30 secs
lola: 18149113 markings, 24297647 edges, 441412 markings/sec, 35 secs
lola: 20313268 markings, 27195668 edges, 432831 markings/sec, 40 secs
lola: 22425916 markings, 30024198 edges, 422530 markings/sec, 45 secs
lola: 24512988 markings, 32817900 edges, 417414 markings/sec, 50 secs
lola: 26609315 markings, 35624402 edges, 419265 markings/sec, 55 secs
lola: 28787879 markings, 38539454 edges, 435713 markings/sec, 60 secs
lola: 30913105 markings, 41385003 edges, 425045 markings/sec, 65 secs
lola: 32829739 markings, 43953237 edges, 383327 markings/sec, 70 secs
lola: 34223237 markings, 45817861 edges, 278700 markings/sec, 75 secs
lola: 35957003 markings, 48139360 edges, 346753 markings/sec, 80 secs
lola: 37485973 markings, 50189780 edges, 305794 markings/sec, 85 secs
lola: 39335807 markings, 52666651 edges, 369967 markings/sec, 90 secs
lola: 39970076 markings, 53517966 edges, 126854 markings/sec, 95 secs
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: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((4 <= p28))) AND A (G (((3 <= p58) OR (3 <= p85)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((4 <= p28)) AND AG(((3 <= p58) OR (3 <= p85)))))
lola: processed formula length: 56
lola: 41 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: 2543409 markings, 3404902 edges, 508682 markings/sec, 0 secs
lola: 4921863 markings, 6591684 edges, 475691 markings/sec, 5 secs
lola: 7216865 markings, 9663819 edges, 459000 markings/sec, 10 secs
lola: 9411533 markings, 12602997 edges, 438934 markings/sec, 15 secs
lola: 11625053 markings, 15567241 edges, 442704 markings/sec, 20 secs
lola: 13819137 markings, 18503244 edges, 438817 markings/sec, 25 secs
lola: 15981923 markings, 21398701 edges, 432557 markings/sec, 30 secs
lola: 18203126 markings, 24370131 edges, 444241 markings/sec, 35 secs
lola: 20346434 markings, 27239926 edges, 428662 markings/sec, 40 secs
lola: 22440028 markings, 30042962 edges, 418719 markings/sec, 45 secs
lola: 24544208 markings, 32859733 edges, 420836 markings/sec, 50 secs
lola: 26635642 markings, 35659667 edges, 418287 markings/sec, 55 secs
lola: 28790707 markings, 38543285 edges, 431013 markings/sec, 60 secs
lola: 30933310 markings, 41411904 edges, 428521 markings/sec, 65 secs
lola: 32762490 markings, 43863257 edges, 365836 markings/sec, 70 secs
lola: 34344873 markings, 45980211 edges, 316477 markings/sec, 75 secs
lola: 36043095 markings, 48254376 edges, 339644 markings/sec, 80 secs
lola: 37591327 markings, 50331610 edges, 309646 markings/sec, 85 secs
lola: 39238817 markings, 52537143 edges, 329498 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p18 <= 3) OR (p70 <= 4))))))
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(((p18 <= 3) OR (p70 <= 4))))
lola: processed formula length: 35
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p15 <= 2) R (p71 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p15 <= 2) R (p71 <= 1)))
lola: processed formula length: 30
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((p21 <= 1))) R (p74 <= 4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(AG((p21 <= 1)) R (p74 <= 4))
lola: processed formula length: 30
lola: 40 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: 3029204 markings, 4054092 edges, 605841 markings/sec, 0 secs
lola: 5780083 markings, 7740324 edges, 550176 markings/sec, 5 secs
lola: 8546333 markings, 11446160 edges, 553250 markings/sec, 10 secs
lola: 11259378 markings, 15077157 edges, 542609 markings/sec, 15 secs
lola: 13912308 markings, 18628486 edges, 530586 markings/sec, 20 secs
lola: 16645304 markings, 22285771 edges, 546599 markings/sec, 25 secs
lola: 19378784 markings, 25946281 edges, 546696 markings/sec, 30 secs
lola: 22020173 markings, 29479474 edges, 528278 markings/sec, 35 secs
lola: 24682398 markings, 33044793 edges, 532445 markings/sec, 40 secs
lola: 27416821 markings, 36704417 edges, 546885 markings/sec, 45 secs
lola: 30105072 markings, 40303381 edges, 537650 markings/sec, 50 secs
lola: 32773657 markings, 43877809 edges, 533717 markings/sec, 55 secs
lola: 35552107 markings, 47598329 edges, 555690 markings/sec, 60 secs
lola: 38221384 markings, 51174586 edges, 533855 markings/sec, 65 secs
lola: 40781629 markings, 54604099 edges, 512049 markings/sec, 70 secs
lola: 43435907 markings, 58156393 edges, 530856 markings/sec, 75 secs
lola: 46122477 markings, 61755320 edges, 537314 markings/sec, 80 secs
lola: 48750380 markings, 65273232 edges, 525581 markings/sec, 85 secs
lola: 51360476 markings, 68771060 edges, 522019 markings/sec, 90 secs
lola: 52542466 markings, 70353013 edges, 236398 markings/sec, 95 secs
lola: 54758114 markings, 73323606 edges, 443130 markings/sec, 100 secs
lola: 55865013 markings, 74803519 edges, 221380 markings/sec, 105 secs
lola: 55930340 markings, 74890672 edges, 13065 markings/sec, 110 secs
lola: 55945904 markings, 74911682 edges, 3113 markings/sec, 115 secs
lola: 56922148 markings, 76219396 edges, 195249 markings/sec, 120 secs
lola: 56922148 markings, 76219396 edges, 0 markings/sec, 125 secs
lola: 58420539 markings, 78226644 edges, 299678 markings/sec, 130 secs
lola: 59198909 markings, 79268676 edges, 155674 markings/sec, 135 secs
lola: 59226531 markings, 79305844 edges, 5524 markings/sec, 140 secs
lola: 61326691 markings, 82117395 edges, 420032 markings/sec, 145 secs
lola: 61326691 markings, 82117395 edges, 0 markings/sec, 150 secs
lola: 62083845 markings, 83130090 edges, 151431 markings/sec, 155 secs
lola: 64155664 markings, 85902632 edges, 414364 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p92 <= 1) AND (p85 <= 2) AND (p81 <= 1) AND (p47 <= 1)) OR A (G ((p49 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p92 <= 1) AND (p85 <= 2) AND (p81 <= 1) AND (p47 <= 1)) OR AG((p49 <= 4))))
lola: processed formula length: 81
lola: 40 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: 3114183 markings, 4167442 edges, 622837 markings/sec, 0 secs
lola: 6015307 markings, 8054499 edges, 580225 markings/sec, 5 secs
lola: 8757237 markings, 11728247 edges, 548386 markings/sec, 10 secs
lola: 11447720 markings, 15329188 edges, 538097 markings/sec, 15 secs
lola: 14108128 markings, 18889640 edges, 532082 markings/sec, 20 secs
lola: 16744817 markings, 22418969 edges, 527338 markings/sec, 25 secs
lola: 19384292 markings, 25953612 edges, 527895 markings/sec, 30 secs
lola: 21980940 markings, 29426941 edges, 519330 markings/sec, 35 secs
lola: 24518240 markings, 32825054 edges, 507460 markings/sec, 40 secs
lola: 27105896 markings, 36288980 edges, 517531 markings/sec, 45 secs
lola: 29725367 markings, 39794759 edges, 523894 markings/sec, 50 secs
lola: 32263089 markings, 43192999 edges, 507544 markings/sec, 55 secs
lola: 34867261 markings, 46680845 edges, 520834 markings/sec, 60 secs
lola: 37368387 markings, 50032315 edges, 500225 markings/sec, 65 secs
lola: 39927516 markings, 53461174 edges, 511826 markings/sec, 70 secs
lola: 42407260 markings, 56779355 edges, 495949 markings/sec, 75 secs
lola: 44913163 markings, 60133319 edges, 501181 markings/sec, 80 secs
lola: 47414494 markings, 63485268 edges, 500266 markings/sec, 85 secs
lola: 49979394 markings, 66920210 edges, 512980 markings/sec, 90 secs
lola: 52366293 markings, 70118151 edges, 477380 markings/sec, 95 secs
lola: 53390416 markings, 71489700 edges, 204825 markings/sec, 100 secs
lola: 55504898 markings, 74327294 edges, 422896 markings/sec, 105 secs
lola: 56988909 markings, 76308683 edges, 296802 markings/sec, 110 secs
lola: 58315498 markings, 78086316 edges, 265318 markings/sec, 115 secs
lola: 58315498 markings, 78086316 edges, 0 markings/sec, 120 secs
lola: 58315498 markings, 78086316 edges, 0 markings/sec, 125 secs
lola: 58713469 markings, 78618181 edges, 79594 markings/sec, 130 secs
lola: 60174532 markings, 80573276 edges, 292213 markings/sec, 135 secs
lola: 62258411 markings, 83363342 edges, 416776 markings/sec, 140 secs
lola: 64287913 markings, 86080926 edges, 405900 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p30) OR A ((A (F ((5 <= p90))) U A (G ((4 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: ((3 <= p30) OR A(AF((5 <= p90)) U AG((4 <= p33))))
lola: processed formula length: 50
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G (((5 <= p25) OR (2 <= p27)))) AND E (F (((4 <= p3) AND (2 <= p97)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG(((5 <= p25) OR (2 <= p27))) AND EF(((4 <= p3) AND (2 <= p97)))))
lola: processed formula length: 72
lola: 41 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: 2944344 markings, 3940817 edges, 588869 markings/sec, 0 secs
lola: 5739047 markings, 7685360 edges, 558941 markings/sec, 5 secs
lola: 8444361 markings, 11310019 edges, 541063 markings/sec, 10 secs
lola: 11118446 markings, 14888111 edges, 534817 markings/sec, 15 secs
lola: 13723318 markings, 18375056 edges, 520974 markings/sec, 20 secs
lola: 16317215 markings, 21847319 edges, 518779 markings/sec, 25 secs
lola: 18946427 markings, 25367377 edges, 525842 markings/sec, 30 secs
lola: 21520040 markings, 28810571 edges, 514723 markings/sec, 35 secs
lola: 24066538 markings, 32219587 edges, 509300 markings/sec, 40 secs
lola: 26625666 markings, 35646176 edges, 511826 markings/sec, 45 secs
lola: 29250185 markings, 39157418 edges, 524904 markings/sec, 50 secs
lola: 31786800 markings, 42554254 edges, 507323 markings/sec, 55 secs
lola: 34364072 markings, 46005694 edges, 515454 markings/sec, 60 secs
lola: 36889918 markings, 49390535 edges, 505169 markings/sec, 65 secs
lola: 39431596 markings, 52795659 edges, 508336 markings/sec, 70 secs
lola: 41860097 markings, 56047452 edges, 485700 markings/sec, 75 secs
lola: 44349415 markings, 59379530 edges, 497864 markings/sec, 80 secs
lola: 46869887 markings, 62755993 edges, 504094 markings/sec, 85 secs
lola: 49408717 markings, 66154764 edges, 507766 markings/sec, 90 secs
lola: 51862077 markings, 69443576 edges, 490672 markings/sec, 95 secs
lola: 53910133 markings, 72187432 edges, 409611 markings/sec, 100 secs
lola: 55205680 markings, 73921428 edges, 259109 markings/sec, 105 secs
lola: 56558946 markings, 75736030 edges, 270653 markings/sec, 110 secs
lola: 58560041 markings, 78413392 edges, 400219 markings/sec, 115 secs
lola: 60191565 markings, 80595838 edges, 326305 markings/sec, 120 secs
lola: 60801849 markings, 81414318 edges, 122057 markings/sec, 125 secs
lola: 62959646 markings, 84302757 edges, 431559 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (((5 <= p14) U (3 <= p95))))) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((5 <= p14) U (3 <= p95)))))
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((5 <= p14) U (3 <= p95)))
lola: processed formula length: 30
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 30 markings, 60 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((5 <= p0))) AND E (F (A (((2 <= p36) U (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((5 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((5 <= p0)))
lola: processed formula length: 17
lola: 39 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 1308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((2 <= p36) U (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((2 <= p36) U (1 <= p7)))
lola: processed formula length: 29
lola: 40 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: 1 markings, 1 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (((2 <= p81) U (1 <= p47))))) AND E (F ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p22 <= 0)))
lola: processed formula length: 18
lola: 39 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p22 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: subprocess 14 will run for 2617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((2 <= p81) U (1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((2 <= p81) U (1 <= p47)))
lola: processed formula length: 30
lola: 40 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: ========================================
lola: 2181975 markings, 5103839 edges, 436395 markings/sec, 0 secs
lola: 4249372 markings, 9940701 edges, 413479 markings/sec, 5 secs
lola: 6304219 markings, 14747871 edges, 410969 markings/sec, 10 secs
lola: 8284073 markings, 19379724 edges, 395971 markings/sec, 15 secs
lola: 10259867 markings, 23999352 edges, 395159 markings/sec, 20 secs
lola: 12181209 markings, 28492943 edges, 384268 markings/sec, 25 secs
lola: 14086236 markings, 32946810 edges, 381005 markings/sec, 30 secs
lola: 15988036 markings, 37394855 edges, 380360 markings/sec, 35 secs
lola: 17928960 markings, 41932808 edges, 388185 markings/sec, 40 secs
lola: 19851388 markings, 46429784 edges, 384486 markings/sec, 45 secs
lola: 21726870 markings, 50813925 edges, 375096 markings/sec, 50 secs
lola: 23604116 markings, 55205313 edges, 375449 markings/sec, 55 secs
lola: 25434380 markings, 59484279 edges, 366053 markings/sec, 60 secs
lola: 27328949 markings, 63916026 edges, 378914 markings/sec, 65 secs
lola: 29250394 markings, 68408137 edges, 384289 markings/sec, 70 secs
lola: 31132507 markings, 72810262 edges, 376423 markings/sec, 75 secs
lola: 32984212 markings, 77144031 edges, 370341 markings/sec, 80 secs
lola: 34879862 markings, 81577469 edges, 379130 markings/sec, 85 secs
lola: 36730464 markings, 85907270 edges, 370120 markings/sec, 90 secs
lola: 38598187 markings, 90278838 edges, 373545 markings/sec, 95 secs
lola: 40400944 markings, 94495958 edges, 360551 markings/sec, 100 secs
lola: 42197902 markings, 98697198 edges, 359392 markings/sec, 105 secs
lola: 44026993 markings, 102975961 edges, 365818 markings/sec, 110 secs
lola: 45921251 markings, 107406000 edges, 378852 markings/sec, 115 secs
lola: 47787965 markings, 111771816 edges, 373343 markings/sec, 120 secs
lola: 49669418 markings, 116172600 edges, 376291 markings/sec, 125 secs
lola: 51499179 markings, 120455891 edges, 365952 markings/sec, 130 secs
lola: 53202212 markings, 124440310 edges, 340607 markings/sec, 135 secs
lola: 54855376 markings, 128308731 edges, 330633 markings/sec, 140 secs
lola: 56527358 markings, 132218196 edges, 334396 markings/sec, 145 secs
lola: 58113952 markings, 135930623 edges, 317319 markings/sec, 150 secs
lola: 59752175 markings, 139761399 edges, 327645 markings/sec, 155 secs
lola: 61379782 markings, 143568400 edges, 325521 markings/sec, 160 secs
lola: 63073788 markings, 147529199 edges, 338801 markings/sec, 165 secs
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: subprocess 14 will run for 2441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p52) AND (2 <= p27)) U (2 <= p32))) AND ((A (F ((p82 <= 0))) OR ((2 <= p42) AND (p14 <= 4) AND (3 <= p60))) AND (A (F (E (G ((5 <= p50))))) OR E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99)))
lola: processed formula length: 46
lola: 41 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (5 <= p99)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 7 markings, 7 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p82 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= p82)
lola: processed formula length: 10
lola: 41 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: (p82 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p52) AND (2 <= p27)) U (2 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p52) AND (2 <= p27)) U (2 <= p32)))
lola: processed formula length: 46
lola: 41 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (2 <= p32)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((1 <= p87))) AND ((p42 <= 1) OR (5 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((1 <= p87)) AND ((p42 <= 1) OR (5 <= p60))))
lola: processed formula length: 52
lola: 40 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).
sara: try reading problem file CTLFireability-16-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1024068 markings, 1369944 edges, 204814 markings/sec, 0 secs
lola: 2033614 markings, 2722393 edges, 201909 markings/sec, 5 secs
lola: 3032752 markings, 4058855 edges, 199828 markings/sec, 10 secs
lola: 4007504 markings, 5365761 edges, 194950 markings/sec, 15 secs
lola: 4972447 markings, 6659429 edges, 192989 markings/sec, 20 secs
lola: 5948449 markings, 7965358 edges, 195200 markings/sec, 25 secs
lola: 6906578 markings, 9249244 edges, 191626 markings/sec, 30 secs
lola: 7854087 markings, 10518435 edges, 189502 markings/sec, 35 secs
lola: 8801414 markings, 11787347 edges, 189465 markings/sec, 40 secs
lola: 9738206 markings, 13041051 edges, 187358 markings/sec, 45 secs
lola: 10685533 markings, 14307740 edges, 189465 markings/sec, 50 secs
lola: 11613557 markings, 15551758 edges, 185605 markings/sec, 55 secs
lola: 12555714 markings, 16812493 edges, 188431 markings/sec, 60 secs
lola: 13488147 markings, 18060700 edges, 186487 markings/sec, 65 secs
lola: 14436509 markings, 19328462 edges, 189672 markings/sec, 70 secs
lola: 15384373 markings, 20598794 edges, 189573 markings/sec, 75 secs
lola: 16346753 markings, 21886666 edges, 192476 markings/sec, 80 secs
lola: 17288416 markings, 23147369 edges, 188333 markings/sec, 85 secs
lola: 18235008 markings, 24412841 edges, 189318 markings/sec, 90 secs
lola: 19169801 markings, 25665941 edges, 186959 markings/sec, 95 secs
lola: 20117501 markings, 26933661 edges, 189540 markings/sec, 100 secs
lola: 21046160 markings, 28177303 edges, 185732 markings/sec, 105 secs
lola: 21992081 markings, 29441659 edges, 189184 markings/sec, 110 secs
lola: 22919130 markings, 30684855 edges, 185410 markings/sec, 115 secs
lola: 23864858 markings, 31949720 edges, 189146 markings/sec, 120 secs
lola: 24784480 markings, 33180967 edges, 183924 markings/sec, 125 secs
lola: 25728176 markings, 34442977 edges, 188739 markings/sec, 130 secs
lola: 26669330 markings, 35705340 edges, 188231 markings/sec, 135 secs
lola: 27613123 markings, 36966822 edges, 188759 markings/sec, 140 secs
lola: 28556203 markings, 38230547 edges, 188616 markings/sec, 145 secs
lola: 29494490 markings, 39485635 edges, 187657 markings/sec, 150 secs
lola: 30428670 markings, 40737052 edges, 186836 markings/sec, 155 secs
lola: 31368735 markings, 41993932 edges, 188013 markings/sec, 160 secs
lola: 32276432 markings, 43211265 edges, 181539 markings/sec, 165 secs
lola: 33177062 markings, 44417822 edges, 180126 markings/sec, 170 secs
lola: 34031688 markings, 45563062 edges, 170925 markings/sec, 175 secs
lola: 34888048 markings, 46711243 edges, 171272 markings/sec, 180 secs
lola: 34958133 markings, 46802318 edges, 14017 markings/sec, 185 secs
lola: 35101059 markings, 46993638 edges, 28585 markings/sec, 190 secs
lola: 35836568 markings, 47978280 edges, 147102 markings/sec, 195 secs
lola: 36654445 markings, 49075064 edges, 163575 markings/sec, 200 secs
lola: 37345951 markings, 50002134 edges, 138301 markings/sec, 205 secs
lola: 37405931 markings, 50082323 edges, 11996 markings/sec, 210 secs
lola: 37748226 markings, 50541229 edges, 68459 markings/sec, 215 secs
lola: 38527804 markings, 51586735 edges, 155916 markings/sec, 220 secs
lola: 39160697 markings, 52432264 edges, 126579 markings/sec, 225 secs
lola: 39498556 markings, 52885781 edges, 67572 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= p18) OR E (X ((1 <= p37)))))) OR ((3 <= p5) OR ((4 <= p98) OR (A (X ((2 <= p76))) OR ((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((4 <= p43) OR ((5 <= p20) AND (3 <= p25) AND (2 <= p76)))
lola: processed formula length: 58
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: (4 <= p98)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (4 <= p98)
lola: processed formula length: 10
lola: 38 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: ========================================
lola: ...considering subproblem: (3 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p5)
lola: processed formula length: 9
lola: 38 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: ========================================
lola: ...considering subproblem: A (X ((2 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((2 <= p76))
lola: processed formula length: 14
lola: 39 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: ========================================
lola: ...considering subproblem: A (G (((3 <= p18) OR E (X ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((3 <= p18) OR EX((1 <= p37))))
lola: processed formula length: 34
lola: 40 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: 2495677 markings, 3341056 edges, 499135 markings/sec, 0 secs
lola: 4815477 markings, 6449320 edges, 463960 markings/sec, 5 secs
lola: 7083704 markings, 9486025 edges, 453645 markings/sec, 10 secs
lola: 9303530 markings, 12458441 edges, 443965 markings/sec, 15 secs
lola: 11486341 markings, 15381625 edges, 436562 markings/sec, 20 secs
lola: 13604465 markings, 18216200 edges, 423625 markings/sec, 25 secs
lola: 15669385 markings, 20981138 edges, 412984 markings/sec, 30 secs
lola: 17859332 markings, 23910378 edges, 437989 markings/sec, 35 secs
lola: 19977857 markings, 26747227 edges, 423705 markings/sec, 40 secs
lola: 22031539 markings, 29494781 edges, 410736 markings/sec, 45 secs
lola: 24119711 markings, 32290785 edges, 417634 markings/sec, 50 secs
lola: 26218539 markings, 35101234 edges, 419766 markings/sec, 55 secs
lola: 28348059 markings, 37951380 edges, 425904 markings/sec, 60 secs
lola: 30491809 markings, 40821647 edges, 428750 markings/sec, 65 secs
lola: 32413268 markings, 43395459 edges, 384292 markings/sec, 70 secs
lola: 34225399 markings, 45820498 edges, 362426 markings/sec, 75 secs
lola: 35269797 markings, 47220448 edges, 208880 markings/sec, 80 secs
lola: 36391645 markings, 48722922 edges, 224370 markings/sec, 85 secs
lola: 37679617 markings, 50448881 edges, 257594 markings/sec, 90 secs
lola: 38072854 markings, 50975934 edges, 78647 markings/sec, 95 secs
lola: 38653040 markings, 51753933 edges, 116037 markings/sec, 100 secs
lola: 39331781 markings, 52661475 edges, 135748 markings/sec, 105 secs
lola: 39921866 markings, 53453450 edges, 118017 markings/sec, 110 secs
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: E (F ((A (X ((4 <= p28))) AND A (G (((3 <= p58) OR (3 <= p85)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((4 <= p28)) AND AG(((3 <= p58) OR (3 <= p85)))))
lola: processed formula length: 56
lola: 41 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: 2444206 markings, 3271869 edges, 488841 markings/sec, 0 secs
lola: 4724539 markings, 6327594 edges, 456067 markings/sec, 5 secs
lola: 6980822 markings, 9348449 edges, 451257 markings/sec, 10 secs
lola: 9141076 markings, 12241200 edges, 432051 markings/sec, 15 secs
lola: 11244150 markings, 15056904 edges, 420615 markings/sec, 20 secs
lola: 13363119 markings, 17893167 edges, 423794 markings/sec, 25 secs
lola: 15457921 markings, 20697817 edges, 418960 markings/sec, 30 secs
lola: 17628725 markings, 23603016 edges, 434161 markings/sec, 35 secs
lola: 19739776 markings, 26429167 edges, 422210 markings/sec, 40 secs
lola: 21827168 markings, 29220923 edges, 417478 markings/sec, 45 secs
lola: 23892507 markings, 31986444 edges, 413068 markings/sec, 50 secs
lola: 25926347 markings, 34709983 edges, 406768 markings/sec, 55 secs
lola: 28066763 markings, 37574645 edges, 428083 markings/sec, 60 secs
lola: 30192531 markings, 40420627 edges, 425154 markings/sec, 65 secs
lola: 32166751 markings, 43062789 edges, 394844 markings/sec, 70 secs
lola: 33811783 markings, 45267931 edges, 329006 markings/sec, 75 secs
lola: 35351902 markings, 47330985 edges, 308024 markings/sec, 80 secs
lola: 36862609 markings, 49353963 edges, 302141 markings/sec, 85 secs
lola: 38643546 markings, 51741251 edges, 356187 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((A (G ((p21 <= 1))) R (p74 <= 4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(AG((p21 <= 1)) R (p74 <= 4))
lola: processed formula length: 30
lola: 40 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: 3002647 markings, 4018528 edges, 600529 markings/sec, 0 secs
lola: 5799420 markings, 7766121 edges, 559355 markings/sec, 5 secs
lola: 8492509 markings, 11374338 edges, 538618 markings/sec, 10 secs
lola: 11164831 markings, 14950915 edges, 534464 markings/sec, 15 secs
lola: 13791046 markings, 18465970 edges, 525243 markings/sec, 20 secs
lola: 16433389 markings, 22002190 edges, 528469 markings/sec, 25 secs
lola: 19045687 markings, 25499869 edges, 522460 markings/sec, 30 secs
lola: 21583525 markings, 28895512 edges, 507568 markings/sec, 35 secs
lola: 24081137 markings, 32239105 edges, 499522 markings/sec, 40 secs
lola: 26546490 markings, 35540375 edges, 493071 markings/sec, 45 secs
lola: 29148371 markings, 39020994 edges, 520376 markings/sec, 50 secs
lola: 31666578 markings, 42393035 edges, 503641 markings/sec, 55 secs
lola: 34197092 markings, 45782253 edges, 506103 markings/sec, 60 secs
lola: 36715939 markings, 49157436 edges, 503769 markings/sec, 65 secs
lola: 39185719 markings, 52465779 edges, 493956 markings/sec, 70 secs
lola: 41584162 markings, 55677948 edges, 479689 markings/sec, 75 secs
lola: 44011234 markings, 58928033 edges, 485414 markings/sec, 80 secs
lola: 46494756 markings, 62253659 edges, 496704 markings/sec, 85 secs
lola: 49015081 markings, 65628933 edges, 504065 markings/sec, 90 secs
lola: 51461249 markings, 68906082 edges, 489234 markings/sec, 95 secs
lola: 53427765 markings, 71539515 edges, 393303 markings/sec, 100 secs
lola: 55409856 markings, 74193828 edges, 396418 markings/sec, 105 secs
lola: 56907528 markings, 76200255 edges, 299534 markings/sec, 110 secs
lola: 58236431 markings, 77980734 edges, 265781 markings/sec, 115 secs
lola: 59090527 markings, 79123557 edges, 170819 markings/sec, 120 secs
lola: 60946995 markings, 81609092 edges, 371294 markings/sec, 125 secs
lola: 62865255 markings, 84176346 edges, 383652 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G ((((p92 <= 1) AND (p85 <= 2) AND (p81 <= 1) AND (p47 <= 1)) OR A (G ((p49 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p92 <= 1) AND (p85 <= 2) AND (p81 <= 1) AND (p47 <= 1)) OR AG((p49 <= 4))))
lola: processed formula length: 81
lola: 40 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: 2930864 markings, 3922610 edges, 586173 markings/sec, 0 secs
lola: 5628324 markings, 7537635 edges, 539492 markings/sec, 5 secs
lola: 8240326 markings, 11036705 edges, 522400 markings/sec, 10 secs
lola: 10854907 markings, 14534093 edges, 522916 markings/sec, 15 secs
lola: 13354678 markings, 17881804 edges, 499954 markings/sec, 20 secs
lola: 15848082 markings, 21220005 edges, 498681 markings/sec, 25 secs
lola: 18450845 markings, 24702768 edges, 520553 markings/sec, 30 secs
lola: 20938259 markings, 28033056 edges, 497483 markings/sec, 35 secs
lola: 23465152 markings, 31415467 edges, 505379 markings/sec, 40 secs
lola: 25925325 markings, 34708440 edges, 492035 markings/sec, 45 secs
lola: 28457061 markings, 38096806 edges, 506347 markings/sec, 50 secs
lola: 30958576 markings, 41445567 edges, 500303 markings/sec, 55 secs
lola: 33435882 markings, 44765340 edges, 495461 markings/sec, 60 secs
lola: 35891984 markings, 48052239 edges, 491220 markings/sec, 65 secs
lola: 38358746 markings, 51358607 edges, 493352 markings/sec, 70 secs
lola: 40702655 markings, 54498113 edges, 468782 markings/sec, 75 secs
lola: 43042854 markings, 57628910 edges, 468040 markings/sec, 80 secs
lola: 45421122 markings, 60813843 edges, 475654 markings/sec, 85 secs
lola: 47815743 markings, 64021042 edges, 478924 markings/sec, 90 secs
lola: 50171265 markings, 67177234 edges, 471104 markings/sec, 95 secs
lola: 52316299 markings, 70051687 edges, 429007 markings/sec, 100 secs
lola: 54247180 markings, 72639275 edges, 386176 markings/sec, 105 secs
lola: 56234485 markings, 75299786 edges, 397461 markings/sec, 110 secs
lola: 58256011 markings, 78014234 edges, 404305 markings/sec, 115 secs
lola: 60396803 markings, 80870796 edges, 428158 markings/sec, 120 secs
lola: 62440076 markings, 83606457 edges, 408655 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((E (G (((5 <= p25) OR (2 <= p27)))) AND E (F (((4 <= p3) AND (2 <= p97)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG(((5 <= p25) OR (2 <= p27))) AND EF(((4 <= p3) AND (2 <= p97)))))
lola: processed formula length: 72
lola: 41 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: 2887142 markings, 3864073 edges, 577428 markings/sec, 0 secs
lola: 5582891 markings, 7476926 edges, 539150 markings/sec, 5 secs
lola: 8157031 markings, 10925348 edges, 514828 markings/sec, 10 secs
lola: 10761239 markings, 14408977 edges, 520842 markings/sec, 15 secs
lola: 13222411 markings, 17704807 edges, 492234 markings/sec, 20 secs
lola: 15679734 markings, 20995024 edges, 491465 markings/sec, 25 secs
lola: 18232985 markings, 24410124 edges, 510650 markings/sec, 30 secs
lola: 20717888 markings, 27737768 edges, 496981 markings/sec, 35 secs
lola: 23172098 markings, 31023633 edges, 490842 markings/sec, 40 secs
lola: 25554475 markings, 34210314 edges, 476475 markings/sec, 45 secs
lola: 27991285 markings, 37473486 edges, 487362 markings/sec, 50 secs
lola: 30512970 markings, 40849900 edges, 504337 markings/sec, 55 secs
lola: 32893913 markings, 44038715 edges, 476189 markings/sec, 60 secs
lola: 35366577 markings, 47350934 edges, 494533 markings/sec, 65 secs
lola: 37727655 markings, 50513425 edges, 472216 markings/sec, 70 secs
lola: 40173973 markings, 53790718 edges, 489264 markings/sec, 75 secs
lola: 42566192 markings, 56991415 edges, 478444 markings/sec, 80 secs
lola: 45001204 markings, 60251287 edges, 487002 markings/sec, 85 secs
lola: 47401350 markings, 63467586 edges, 480029 markings/sec, 90 secs
lola: 49835470 markings, 66726151 edges, 486824 markings/sec, 95 secs
lola: 52100079 markings, 69761715 edges, 452922 markings/sec, 100 secs
lola: 54098184 markings, 72440134 edges, 399621 markings/sec, 105 secs
lola: 56185747 markings, 75234540 edges, 417513 markings/sec, 110 secs
lola: 58280091 markings, 78039251 edges, 418869 markings/sec, 115 secs
lola: 60393559 markings, 80866127 edges, 422694 markings/sec, 120 secs
lola: 62408183 markings, 83563888 edges, 402925 markings/sec, 125 secs
lola: 64267967 markings, 86053550 edges, 371957 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (E (((2 <= p81) U (1 <= p47))))) AND E (F ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p22 <= 0)))
lola: processed formula length: 18
lola: 39 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p22 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (((2 <= p81) U (1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((2 <= p81) U (1 <= p47)))
lola: processed formula length: 30
lola: 40 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: 2124877 markings, 4969889 edges, 424975 markings/sec, 0 secs
lola: 4104944 markings, 9601683 edges, 396013 markings/sec, 5 secs
lola: 6102383 markings, 14273197 edges, 399488 markings/sec, 10 secs
lola: 7985680 markings, 18682030 edges, 376659 markings/sec, 15 secs
lola: 9886195 markings, 23125244 edges, 380103 markings/sec, 20 secs
lola: 11714952 markings, 27402179 edges, 365751 markings/sec, 25 secs
lola: 13562734 markings, 31723122 edges, 369556 markings/sec, 30 secs
lola: 15366361 markings, 35941249 edges, 360725 markings/sec, 35 secs
lola: 17252240 markings, 40351263 edges, 377176 markings/sec, 40 secs
lola: 19098631 markings, 44669651 edges, 369278 markings/sec, 45 secs
lola: 20915384 markings, 48917822 edges, 363351 markings/sec, 50 secs
lola: 22737315 markings, 53178509 edges, 364386 markings/sec, 55 secs
lola: 24531470 markings, 57374236 edges, 358831 markings/sec, 60 secs
lola: 26309978 markings, 61533778 edges, 355702 markings/sec, 65 secs
lola: 28148818 markings, 65833409 edges, 367768 markings/sec, 70 secs
lola: 29981066 markings, 70118825 edges, 366450 markings/sec, 75 secs
lola: 31773407 markings, 74309523 edges, 358468 markings/sec, 80 secs
lola: 33582622 markings, 78543931 edges, 361843 markings/sec, 85 secs
lola: 35375498 markings, 82738439 edges, 358575 markings/sec, 90 secs
lola: 37155521 markings, 86903156 edges, 356005 markings/sec, 95 secs
lola: 38975394 markings, 91160408 edges, 363975 markings/sec, 100 secs
lola: 40715765 markings, 95231542 edges, 348074 markings/sec, 105 secs
lola: 42449922 markings, 99286404 edges, 346831 markings/sec, 110 secs
lola: 44203539 markings, 103388351 edges, 350723 markings/sec, 115 secs
lola: 46013828 markings, 107623143 edges, 362058 markings/sec, 120 secs
lola: 47819720 markings, 111846033 edges, 361178 markings/sec, 125 secs
lola: 49640794 markings, 116105673 edges, 364215 markings/sec, 130 secs
lola: 51397696 markings, 120218615 edges, 351380 markings/sec, 135 secs
lola: 53033034 markings, 124044085 edges, 327068 markings/sec, 140 secs
lola: 54551052 markings, 127597456 edges, 303604 markings/sec, 145 secs
lola: 56174948 markings, 131394869 edges, 324779 markings/sec, 150 secs
lola: 57787492 markings, 135167780 edges, 322509 markings/sec, 155 secs
lola: 59385409 markings, 138903850 edges, 319583 markings/sec, 160 secs
lola: 60978191 markings, 142629077 edges, 318556 markings/sec, 165 secs
lola: 62548532 markings, 146300235 edges, 314068 markings/sec, 170 secs
lola: 64071341 markings, 149860293 edges, 304562 markings/sec, 175 secs
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: (E ((((1 <= p52) AND (2 <= p27)) U (2 <= p32))) AND ((A (F ((p82 <= 0))) OR ((2 <= p42) AND (p14 <= 4) AND (3 <= p60))) AND (A (F (E (G ((5 <= p50))))) OR E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= p97) OR (3 <= p30)) U (5 <= p99)))
lola: processed formula length: 46
lola: 41 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (5 <= p99)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 7 markings, 7 edges
lola: state equation: write sara problem file to CTLFireability-22-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((2 <= p42) AND (p14 <= 4) AND (3 <= p60))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p42) AND (p14 <= 4) AND (3 <= p60))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 (F ((p82 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= p82)
lola: processed formula length: 10
lola: 41 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: (p82 <= 0)
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-24-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: try reading problem file CTLFireability-22-0.sara.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no unknown unknown yes yes no unknown unknown unknown yes no unknown
lola:
preliminary result: unknown no yes no unknown unknown yes yes no unknown unknown unknown yes no unknown
sara: place or transition ordering is non-deterministic

lola: memory consumption: 3848 KB
lola: time consumption: 2202 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16308388 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16307616 kB

--------------------
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="JoinFreeModules-PT-0020"
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 JoinFreeModules-PT-0020, 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 r184-oct2-158987928500420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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