Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033476900060.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-002A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K May 14 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 18K May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591284220642

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 15:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:42] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-04 15:23:42] [INFO ] Transformed 53 places.
[2020-06-04 15:23:42] [INFO ] Transformed 51 transitions.
[2020-06-04 15:23:42] [INFO ] Found NUPN structural information;
[2020-06-04 15:23:42] [INFO ] Parsed PT model containing 53 places and 51 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Finished random walk after 2328 steps, including 16 resets, run visited all 36 properties in 16 ms. (steps per millisecond=145 )
[2020-06-04 15:23:42] [INFO ] Flatten gal took : 33 ms
[2020-06-04 15:23:42] [INFO ] Flatten gal took : 9 ms
[2020-06-04 15:23:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 15:23:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldIIPs-PT-002A @ 3570 seconds

FORMULA ShieldIIPs-PT-002A-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2572
rslt: Output for CTLFireability @ ShieldIIPs-PT-002A

{
"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": "Thu Jun 4 15:23:43 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF((((1 <= p36) AND (1 <= p40) AND (1 <= p51)) OR (AX(((1 <= p38) AND (1 <= p48) AND (1 <= p52))) AND (((1 <= p11)) AND (((1 <= p15)) AND (((1 <= p26)) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))))",
"processed_size": 204,
"rewrites": 68
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))",
"processed_size": 42,
"rewrites": 69
},
"result":
{
"edges": 173,
"markings": 174,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF((EX(((1 <= p7) AND (1 <= p9))) OR (((1 <= p36) AND (1 <= p42) AND (1 <= p52)) AND AX(((1 <= p50))))))",
"processed_size": 104,
"rewrites": 69
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 849,
"markings": 575,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 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": "((p41 <= 0))",
"processed_size": 12,
"rewrites": 69
},
"result":
{
"edges": 187,
"markings": 187,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p4 <= 0) OR (p19 <= 0) OR (p33 <= 0) OR (p48 <= 0))",
"processed_size": 56,
"rewrites": 70
},
"result":
{
"edges": 237,
"markings": 238,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p5 <= 0) OR (p18 <= 0)) AND ((p31 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p19 <= 0)))",
"processed_size": 91,
"rewrites": 69
},
"result":
{
"edges": 1062,
"markings": 698,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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(EG(((1 <= p51))))",
"processed_size": 20,
"rewrites": 68
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 7375946,
"markings": 2556285,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 657
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EG(A(((p8 <= 0) OR (p22 <= 0)) R ((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))))",
"processed_size": 78,
"rewrites": 68
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 893,
"markings": 543,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 821
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E(((p6 <= 0) OR (p17 <= 0) OR ((1 <= p37) AND ((p0 <= 0)))) U AG(((p40 <= 0))))",
"processed_size": 81,
"rewrites": 68
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 3881,
"markings": 1800,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1095
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(E(EF(((1 <= p3) AND (1 <= p24))) U EG(((1 <= p5) AND (1 <= p18)))) OR ((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p6) AND (1 <= p16)))",
"processed_size": 143,
"rewrites": 69
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 469660455,
"markings": 43960267,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 9,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 7,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF((AF(((1 <= p0))) AND (((1 <= p33)) AND (((1 <= p48)) AND (((1 <= p5)) AND (((1 <= p18)) AND (((1 <= p3)) AND (((1 <= p24)) AND E(((1 <= p7) AND (1 <= p9)) U ((1 <= p51)))))))))))",
"processed_size": 181,
"rewrites": 69
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 380,
"markings": 127,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2859
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))",
"processed_size": 50,
"rewrites": 67
},
"result":
{
"edges": 192,
"markings": 193,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0)))))",
"processed_size": 142,
"rewrites": 71
},
"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": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"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": "EX(EX(EF(((1 <= p0)))))",
"processed_size": 23,
"rewrites": 69
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 310638849,
"markings": 43960265,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))",
"processed_size": 50,
"rewrites": 67
},
"result":
{
"edges": 192,
"markings": 193,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((p13 <= 0) OR (p21 <= 0) OR (p25 <= 0)) R ((p28 <= 0) OR (p49 <= 0))))",
"processed_size": 78,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0)))))",
"processed_size": 142,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 50780,
"runtime": 998.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((** OR (A(X(**)) AND (** AND (** AND (** AND **))))))) : A(F(**)) : (E((E(F(**)) U E(G(**)))) OR **) : E(G(*)) : E(G(*)) : E((** U A(G(*)))) : A(F((A(F(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND E((** U **))))))))))) : (A((* R *)) AND (E(G(*)) AND A((* R *)))) : E(G(A((* R *)))) : A(F(**)) : A(F(**)) : A(X(A(F(**)))) : A(F((E(X(**)) OR (** AND A(X(**)))))) : A(G(A(F(**)))) : E(X(E(X(E(F(**)))))) : A(F(E(G(**))))"
},
"net":
{
"arcs": 222,
"conflict_clusters": 17,
"places": 53,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 51
},
"result":
{
"preliminary_value": "no yes no yes yes yes no yes yes yes no no no no no no ",
"value": "no yes no yes yes yes no yes yes yes no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 104/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1696
lola: finding significant places
lola: 53 places, 51 transitions, 34 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: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: A (F ((((1 <= p36) AND (1 <= p40) AND (1 <= p51)) OR ((((A (X (((1 <= p38) AND (1 <= p48) AND (1 <= p52)))) AND ((1 <= p11))) AND ((1 <= p15))) AND ((1 <= p26))) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0)))))) : A (F (((1 <= p14) AND (1 <= p35)))) : (E ((E (F (((1 <= p3) AND (1 <= p24)))) U E (G (((1 <= p5) AND (1 <= p18)))))) OR ((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p6) AND (1 <= p16))) : NOT(A ((((((1 <= p38) AND (1 <= p48) AND (1 <= p50)) OR ((1 <= p36) AND (1 <= p40) AND (1 <= p52))) AND ((p41 <= 0))) U A (F (((1 <= p7) AND (1 <= p9))))))) : NOT(A (F (A ((((1 <= p36) AND (1 <= p40) AND (1 <= p51)) U ((1 <= p15))))))) : E ((((p6 <= 0) OR (p17 <= 0) OR ((1 <= p37) AND ((p0 <= 0)))) U NOT(E (F (((1 <= p40))))))) : A (F ((((((((A (F (((1 <= p0)))) AND ((1 <= p33))) AND ((1 <= p48))) AND ((1 <= p5))) AND ((1 <= p18))) AND ((1 <= p3))) AND ((1 <= p24))) AND E ((((1 <= p7) AND (1 <= p9)) U ((1 <= p51))))))) : ((NOT(E ((((1 <= p13) AND (1 <= p23) AND (1 <= p27) AND (1 <= p14) AND (1 <= p35)) U (((1 <= p13) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p51)))))) AND NOT(A (F (((1 <= p38) AND (1 <= p48) AND (1 <= p50)))))) AND NOT(E ((((1 <= p13) AND (1 <= p21) AND (1 <= p25)) U ((1 <= p28) AND (1 <= p49)))))) : NOT(A (F (E ((((1 <= p8) AND (1 <= p22)) U ((1 <= p38) AND (1 <= p46) AND (1 <= p52))))))) : A (F (A (F ((((1 <= p5) AND (1 <= p18)) OR ((1 <= p31) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p19))))))) : A (F (((1 <= p41)))) : A (X (A (F (((1 <= p38) AND (1 <= p46) AND (1 <= p52)))))) : A (F ((E (X (((1 <= p7) AND (1 <= p9)))) OR (((1 <= p36) AND (1 <= p42) AND (1 <= p52)) AND A (X (((1 <= p50)))))))) : A (G (A (F (((1 <= p4) AND (1 <= p19) AND (1 <= p33) AND (1 <= p48)))))) : E (X (E (F (E (X (((1 <= p0)))))))) : NOT(E (G (NOT(E (G (((1 <= p51))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:395
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p36) AND (1 <= p40) AND (1 <= p51)) OR (A (X (((1 <= p38) AND (1 <= p48) AND (1 <= p52)))) AND (((1 <= p11)) AND (((1 <= p15)) AND (((1 <= p26)) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0)))))))))
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((((1 <= p36) AND (1 <= p40) AND (1 <= p51)) OR (AX(((1 <= p38) AND (1 <= p48) AND (1 <= p52))) AND (((1 <= p11)) AND (((1 <= p15)) AND (((1 <= p26)) AND ((p36 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))))
lola: processed formula length: 204
lola: 68 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: 127 markings, 127 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p38) AND (1 <= p46) AND (1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))
lola: processed formula length: 42
lola: 69 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p38) AND (1 <= p46) AND (1 <= p52))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 174 markings, 173 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (((1 <= p7) AND (1 <= p9)))) OR (((1 <= p36) AND (1 <= p42) AND (1 <= p52)) AND A (X (((1 <= p50))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
sara: try reading problem file CTLFireability-0.sara.
lola: processed formula: AF((EX(((1 <= p7) AND (1 <= p9))) OR (((1 <= p36) AND (1 <= p42) AND (1 <= p52)) AND AX(((1 <= p50))))))
lola: processed formula length: 104
lola: 69 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: 575 markings, 849 edges
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (E (F (((1 <= p0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX(EF(((1 <= p0)))))
lola: processed formula length: 23
lola: 69 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: 905949 markings, 5347556 edges, 181190 markings/sec, 0 secs
lola: 1478555 markings, 9170294 edges, 114521 markings/sec, 5 secs
lola: 2160179 markings, 13495014 edges, 136325 markings/sec, 10 secs
lola: 2977506 markings, 18848940 edges, 163465 markings/sec, 15 secs
lola: 3622633 markings, 23608394 edges, 129025 markings/sec, 20 secs
lola: 4461542 markings, 28666874 edges, 167782 markings/sec, 25 secs
lola: 5081875 markings, 33753040 edges, 124067 markings/sec, 30 secs
lola: 5681715 markings, 37984643 edges, 119968 markings/sec, 35 secs
lola: 6254838 markings, 42173954 edges, 114625 markings/sec, 40 secs
lola: 6956502 markings, 46295942 edges, 140333 markings/sec, 45 secs
lola: 7539835 markings, 50671151 edges, 116667 markings/sec, 50 secs
lola: 8124414 markings, 54773966 edges, 116916 markings/sec, 55 secs
lola: 8757422 markings, 59046624 edges, 126602 markings/sec, 60 secs
lola: 9207836 markings, 62507391 edges, 90083 markings/sec, 65 secs
lola: 9763132 markings, 66064180 edges, 111059 markings/sec, 70 secs
lola: 10219750 markings, 69638651 edges, 91324 markings/sec, 75 secs
lola: 10742733 markings, 72639134 edges, 104597 markings/sec, 80 secs
lola: 11021487 markings, 75824672 edges, 55751 markings/sec, 85 secs
lola: 11628997 markings, 79843174 edges, 121502 markings/sec, 90 secs
lola: 12132970 markings, 83828304 edges, 100795 markings/sec, 95 secs
lola: 12670963 markings, 87559569 edges, 107599 markings/sec, 100 secs
lola: 13232935 markings, 91558274 edges, 112394 markings/sec, 105 secs
lola: 13680877 markings, 95255179 edges, 89588 markings/sec, 110 secs
lola: 14504654 markings, 100739387 edges, 164755 markings/sec, 115 secs
lola: 15146478 markings, 105417895 edges, 128365 markings/sec, 120 secs
lola: 15781901 markings, 109393668 edges, 127085 markings/sec, 125 secs
lola: 16298598 markings, 113819585 edges, 103339 markings/sec, 130 secs
lola: 17011038 markings, 118945586 edges, 142488 markings/sec, 135 secs
lola: 17826989 markings, 124504130 edges, 163190 markings/sec, 140 secs
lola: 18597158 markings, 129857719 edges, 154034 markings/sec, 145 secs
lola: 19377358 markings, 134881725 edges, 156040 markings/sec, 150 secs
lola: 20027737 markings, 139627067 edges, 130076 markings/sec, 155 secs
lola: 20693931 markings, 144402075 edges, 133239 markings/sec, 160 secs
lola: 21337071 markings, 148818497 edges, 128628 markings/sec, 165 secs
lola: 21808597 markings, 153524861 edges, 94305 markings/sec, 170 secs
lola: 22539540 markings, 158516884 edges, 146189 markings/sec, 175 secs
lola: 23161001 markings, 162887857 edges, 124292 markings/sec, 180 secs
lola: 23866270 markings, 167702838 edges, 141054 markings/sec, 185 secs
lola: 24396204 markings, 172000446 edges, 105987 markings/sec, 190 secs
lola: 25117106 markings, 177150050 edges, 144180 markings/sec, 195 secs
lola: 25711304 markings, 181918115 edges, 118840 markings/sec, 200 secs
lola: 26292015 markings, 186298952 edges, 116142 markings/sec, 205 secs
lola: 26997730 markings, 191054943 edges, 141143 markings/sec, 210 secs
lola: 27617612 markings, 195925116 edges, 123976 markings/sec, 215 secs
lola: 28424556 markings, 201255310 edges, 161389 markings/sec, 220 secs
lola: 29134597 markings, 206544800 edges, 142008 markings/sec, 225 secs
lola: 29969902 markings, 212111683 edges, 167061 markings/sec, 230 secs
lola: 30657678 markings, 217169093 edges, 137555 markings/sec, 235 secs
lola: 31246248 markings, 221620941 edges, 117714 markings/sec, 240 secs
lola: 32007628 markings, 226403332 edges, 152276 markings/sec, 245 secs
lola: 32647337 markings, 231224621 edges, 127942 markings/sec, 250 secs
lola: 33302612 markings, 235859023 edges, 131055 markings/sec, 255 secs
lola: 33885306 markings, 240190802 edges, 116539 markings/sec, 260 secs
lola: 34511142 markings, 244762084 edges, 125167 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no no unknown unknown unknown
lola: memory consumption: 2731832 KB
lola: time consumption: 277 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p41))))
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: ((p41 <= 0))
lola: processed formula length: 12
lola: 69 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p41))
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: state equation: write sara problem file to CTLFireability-4-0.sara
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 187 markings, 187 edges
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p15 <= 0))))
lola: processed formula length: 20
lola: 67 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15))
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 / EG
lola: The predicate is possibly preserved.
lola: 227 markings, 248 edges
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p7 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p7 <= 0) OR (p9 <= 0))))
lola: processed formula length: 33
lola: 67 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7) AND (1 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 1969 markings, 2911 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p14) AND (1 <= p35))))
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: ((p14 <= 0) OR (p35 <= 0))
lola: processed formula length: 27
lola: 69 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p14) AND (1 <= p35))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 83484 markings, 136732 edges
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p4) AND (1 <= p19) AND (1 <= p33) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 0) OR (p19 <= 0) OR (p33 <= 0) OR (p48 <= 0))
lola: processed formula length: 56
lola: 70 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: 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 1
lola: formula 1: ((p4 <= 0) OR (p19 <= 0) OR (p33 <= 0) OR (p48 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p19) AND (1 <= p33) AND (1 <= p48))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 238 markings, 237 edges
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p5) AND (1 <= p18)) OR ((1 <= p31) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p19)))))
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: (((p5 <= 0) OR (p18 <= 0)) AND ((p31 <= 0) OR (p42 <= 0)) AND ((p4 <= 0) OR (p19 <= 0)))
lola: processed formula length: 91
lola: 69 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p5) AND (1 <= p18)) OR ((1 <= p31) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p19)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 698 markings, 1062 edges
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p51))))
lola: processed formula length: 20
lola: 68 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: 2154168 markings, 6294832 edges, 430834 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2556285 markings, 7375946 edges
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((((p8 <= 0) OR (p22 <= 0)) R ((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A(((p8 <= 0) OR (p22 <= 0)) R ((p38 <= 0) OR (p46 <= 0) OR (p52 <= 0))))
lola: processed formula length: 78
lola: 68 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: 543 markings, 893 edges
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p6 <= 0) OR (p17 <= 0) OR ((1 <= p37) AND ((p0 <= 0)))) U A (G (((p40 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p6 <= 0) OR (p17 <= 0) OR ((1 <= p37) AND ((p0 <= 0)))) U AG(((p40 <= 0))))
lola: processed formula length: 81
lola: 68 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: 1800 markings, 3881 edges
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (F (((1 <= p3) AND (1 <= p24)))) U E (G (((1 <= p5) AND (1 <= p18)))))) OR ((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p6) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(EF(((1 <= p3) AND (1 <= p24))) U EG(((1 <= p5) AND (1 <= p18)))) OR ((1 <= p13) AND (1 <= p21) AND (1 <= p27) AND (1 <= p6) AND (1 <= p16)))
lola: processed formula length: 143
lola: 69 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: 765377 markings, 5986469 edges, 153075 markings/sec, 0 secs
lola: 1358493 markings, 11634340 edges, 118623 markings/sec, 5 secs
lola: 1840826 markings, 16692257 edges, 96467 markings/sec, 10 secs
lola: 2315808 markings, 21492967 edges, 94996 markings/sec, 15 secs
lola: 2853514 markings, 27007000 edges, 107541 markings/sec, 20 secs
lola: 3341617 markings, 32121115 edges, 97621 markings/sec, 25 secs
lola: 3845392 markings, 37676522 edges, 100755 markings/sec, 30 secs
lola: 4427501 markings, 43393507 edges, 116422 markings/sec, 35 secs
lola: 4864220 markings, 48585625 edges, 87344 markings/sec, 40 secs
lola: 5467669 markings, 54996779 edges, 120690 markings/sec, 45 secs
lola: 6024095 markings, 60959196 edges, 111285 markings/sec, 50 secs
lola: 6558289 markings, 66808773 edges, 106839 markings/sec, 55 secs
lola: 7140243 markings, 72938874 edges, 116391 markings/sec, 60 secs
lola: 7802059 markings, 79349136 edges, 132363 markings/sec, 65 secs
lola: 8332418 markings, 85488359 edges, 106072 markings/sec, 70 secs
lola: 8899074 markings, 91309204 edges, 113331 markings/sec, 75 secs
lola: 9385033 markings, 96650953 edges, 97192 markings/sec, 80 secs
lola: 9849704 markings, 102240353 edges, 92934 markings/sec, 85 secs
lola: 10355766 markings, 107719075 edges, 101212 markings/sec, 90 secs
lola: 10930971 markings, 112846705 edges, 115041 markings/sec, 95 secs
lola: 11306431 markings, 118031491 edges, 75092 markings/sec, 100 secs
lola: 11833494 markings, 123965930 edges, 105413 markings/sec, 105 secs
lola: 12429322 markings, 129741313 edges, 119166 markings/sec, 110 secs
lola: 12847990 markings, 135184318 edges, 83734 markings/sec, 115 secs
lola: 13409320 markings, 140861080 edges, 112266 markings/sec, 120 secs
lola: 13804392 markings, 146102755 edges, 79014 markings/sec, 125 secs
lola: 14406120 markings, 152406366 edges, 120346 markings/sec, 130 secs
lola: 15000827 markings, 158585032 edges, 118941 markings/sec, 135 secs
lola: 15534720 markings, 164255496 edges, 106779 markings/sec, 140 secs
lola: 15970746 markings, 169493187 edges, 87205 markings/sec, 145 secs
lola: 16562815 markings, 175087474 edges, 118414 markings/sec, 150 secs
lola: 17059869 markings, 181039993 edges, 99411 markings/sec, 155 secs
lola: 17608748 markings, 186925469 edges, 109776 markings/sec, 160 secs
lola: 18188591 markings, 192924195 edges, 115969 markings/sec, 165 secs
lola: 18794093 markings, 198930254 edges, 121100 markings/sec, 170 secs
lola: 19302775 markings, 204614276 edges, 101736 markings/sec, 175 secs
lola: 19724858 markings, 209797278 edges, 84417 markings/sec, 180 secs
lola: 20189187 markings, 215044427 edges, 92866 markings/sec, 185 secs
lola: 20781782 markings, 220616935 edges, 118519 markings/sec, 190 secs
lola: 21251417 markings, 225626643 edges, 93927 markings/sec, 195 secs
lola: 21607972 markings, 230563520 edges, 71311 markings/sec, 200 secs
lola: 22174973 markings, 236185524 edges, 113400 markings/sec, 205 secs
lola: 22682428 markings, 241557041 edges, 101491 markings/sec, 210 secs
lola: 23031243 markings, 246285232 edges, 69763 markings/sec, 215 secs
lola: 23574387 markings, 251653416 edges, 108629 markings/sec, 220 secs
lola: 23878571 markings, 255996951 edges, 60837 markings/sec, 225 secs
lola: 24397381 markings, 260765025 edges, 103762 markings/sec, 230 secs
lola: 24837678 markings, 265999329 edges, 88059 markings/sec, 235 secs
lola: 25322107 markings, 271394355 edges, 96886 markings/sec, 240 secs
lola: 25731847 markings, 276218044 edges, 81948 markings/sec, 245 secs
lola: 26213816 markings, 281204811 edges, 96394 markings/sec, 250 secs
lola: 26640351 markings, 286266833 edges, 85307 markings/sec, 255 secs
lola: 27194258 markings, 291584895 edges, 110781 markings/sec, 260 secs
lola: 27658823 markings, 297079285 edges, 92913 markings/sec, 265 secs
lola: 28260437 markings, 303097648 edges, 120323 markings/sec, 270 secs
lola: 28777837 markings, 308694351 edges, 103480 markings/sec, 275 secs
lola: 29410357 markings, 314692876 edges, 126504 markings/sec, 280 secs
lola: 29890464 markings, 320098974 edges, 96021 markings/sec, 285 secs
lola: 30483000 markings, 325624439 edges, 118507 markings/sec, 290 secs
lola: 30906428 markings, 330965236 edges, 84686 markings/sec, 295 secs
lola: 31337137 markings, 336171548 edges, 86142 markings/sec, 300 secs
lola: 31879186 markings, 341808696 edges, 108410 markings/sec, 305 secs
lola: 32360905 markings, 347137580 edges, 96344 markings/sec, 310 secs
lola: 32975281 markings, 353235047 edges, 122875 markings/sec, 315 secs
lola: 33505069 markings, 358501003 edges, 105958 markings/sec, 320 secs
lola: 33891539 markings, 363611225 edges, 77294 markings/sec, 325 secs
lola: 34363171 markings, 368979226 edges, 94326 markings/sec, 330 secs
lola: 34847466 markings, 374136240 edges, 96859 markings/sec, 335 secs
lola: 35375131 markings, 379717584 edges, 105533 markings/sec, 340 secs
lola: 35871299 markings, 385084643 edges, 99234 markings/sec, 345 secs
lola: 36304673 markings, 390002941 edges, 86675 markings/sec, 350 secs
lola: 36779526 markings, 394903470 edges, 94971 markings/sec, 355 secs
lola: 37298392 markings, 400335845 edges, 103773 markings/sec, 360 secs
lola: 37761754 markings, 405392205 edges, 92672 markings/sec, 365 secs
lola: 38328538 markings, 411018608 edges, 113357 markings/sec, 370 secs
lola: 38850586 markings, 416578201 edges, 104410 markings/sec, 375 secs
lola: 39344487 markings, 422136602 edges, 98780 markings/sec, 380 secs
lola: 39878979 markings, 427770020 edges, 106898 markings/sec, 385 secs
lola: 40387483 markings, 433075364 edges, 101701 markings/sec, 390 secs
lola: 40910358 markings, 438412176 edges, 104575 markings/sec, 395 secs
lola: 41402031 markings, 443776101 edges, 98335 markings/sec, 400 secs
lola: 41883725 markings, 448946269 edges, 96339 markings/sec, 405 secs
lola: 42467872 markings, 454720530 edges, 116829 markings/sec, 410 secs
lola: 43046001 markings, 460642936 edges, 115626 markings/sec, 415 secs
lola: 43616145 markings, 466375501 edges, 114029 markings/sec, 420 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43960267 markings, 469660455 edges
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (((1 <= p0)))) AND (((1 <= p33)) AND (((1 <= p48)) AND (((1 <= p5)) AND (((1 <= p18)) AND (((1 <= p3)) AND (((1 <= p24)) AND E ((((1 <= p7) AND (1 <= p9)) U ((1 <= p51)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AF(((1 <= p0))) AND (((1 <= p33)) AND (((1 <= p48)) AND (((1 <= p5)) AND (((1 <= p18)) AND (((1 <= p3)) AND (((1 <= p24)) AND E(((1 <= p7) AND (1 <= p9)) U ((1 <= p51)))))))))))
lola: processed formula length: 181
lola: 69 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: 127 markings, 380 edges
lola: ========================================
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0))))) AND (E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0)))) AND A ((((p13 <= 0) OR (p21 <= 0) OR (p25 <= 0)) R ((p28 <= 0) OR (p49 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))
lola: processed formula length: 50
lola: 67 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: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p38) AND (1 <= p48) AND (1 <= p50))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved.
lola: 193 markings, 192 edges
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0)))))
lola: processed formula length: 142
lola: 71 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p13) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p51)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (E (X (E (F (((1 <= p0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX(EF(((1 <= p0)))))
lola: processed formula length: 23
lola: 69 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: 1188003 markings, 7038083 edges, 237601 markings/sec, 0 secs
lola: 2160274 markings, 13526160 edges, 194454 markings/sec, 5 secs
lola: 3166015 markings, 20258783 edges, 201148 markings/sec, 10 secs
lola: 4045108 markings, 26294675 edges, 175819 markings/sec, 15 secs
lola: 4777349 markings, 31923569 edges, 146448 markings/sec, 20 secs
lola: 5741767 markings, 38411496 edges, 192884 markings/sec, 25 secs
lola: 6641539 markings, 44696599 edges, 179954 markings/sec, 30 secs
lola: 7611490 markings, 50921507 edges, 193990 markings/sec, 35 secs
lola: 8414691 markings, 56695765 edges, 160640 markings/sec, 40 secs
lola: 9163577 markings, 62327427 edges, 149777 markings/sec, 45 secs
lola: 9983469 markings, 67958237 edges, 163978 markings/sec, 50 secs
lola: 10831578 markings, 73094459 edges, 169622 markings/sec, 55 secs
lola: 11386499 markings, 78459018 edges, 110984 markings/sec, 60 secs
lola: 12170104 markings, 83990950 edges, 156721 markings/sec, 65 secs
lola: 12893103 markings, 89230072 edges, 144600 markings/sec, 70 secs
lola: 13611215 markings, 94452952 edges, 143622 markings/sec, 75 secs
lola: 14525368 markings, 100909191 edges, 182831 markings/sec, 80 secs
lola: 15358651 markings, 106613333 edges, 166657 markings/sec, 85 secs
lola: 15990158 markings, 111517425 edges, 126301 markings/sec, 90 secs
lola: 16682487 markings, 116702515 edges, 138466 markings/sec, 95 secs
lola: 17521783 markings, 122511507 edges, 167859 markings/sec, 100 secs
lola: 18389231 markings, 128257290 edges, 173490 markings/sec, 105 secs
lola: 19133898 markings, 133731552 edges, 148933 markings/sec, 110 secs
lola: 19810343 markings, 138793127 edges, 135289 markings/sec, 115 secs
lola: 20516528 markings, 143772888 edges, 141237 markings/sec, 120 secs
lola: 21258051 markings, 148443648 edges, 148305 markings/sec, 125 secs
lola: 21765680 markings, 153237512 edges, 101526 markings/sec, 130 secs
lola: 22534363 markings, 158502238 edges, 153737 markings/sec, 135 secs
lola: 23190592 markings, 163170037 edges, 131246 markings/sec, 140 secs
lola: 23867345 markings, 168074720 edges, 135351 markings/sec, 145 secs
lola: 24396551 markings, 172455281 edges, 105841 markings/sec, 150 secs
lola: 25161165 markings, 177932048 edges, 152923 markings/sec, 155 secs
lola: 25852262 markings, 182971489 edges, 138219 markings/sec, 160 secs
lola: 26498028 markings, 187673206 edges, 129153 markings/sec, 165 secs
lola: 27232053 markings, 192481954 edges, 146805 markings/sec, 170 secs
lola: 27940258 markings, 198075429 edges, 141641 markings/sec, 175 secs
lola: 28717246 markings, 203637015 edges, 155398 markings/sec, 180 secs
lola: 29516978 markings, 209110046 edges, 159946 markings/sec, 185 secs
lola: 30351524 markings, 214580633 edges, 166909 markings/sec, 190 secs
lola: 31018050 markings, 219804867 edges, 133305 markings/sec, 195 secs
lola: 31834351 markings, 225121655 edges, 163260 markings/sec, 200 secs
lola: 32455524 markings, 230150566 edges, 124235 markings/sec, 205 secs
lola: 33195999 markings, 235517671 edges, 148095 markings/sec, 210 secs
lola: 33912021 markings, 240343824 edges, 143204 markings/sec, 215 secs
lola: 34556954 markings, 245226617 edges, 128987 markings/sec, 220 secs
lola: 35257082 markings, 250262760 edges, 140026 markings/sec, 225 secs
lola: 35999480 markings, 255280239 edges, 148480 markings/sec, 230 secs
lola: 36634492 markings, 260029729 edges, 127002 markings/sec, 235 secs
lola: 37317999 markings, 265051828 edges, 136701 markings/sec, 240 secs
lola: 38112135 markings, 270678760 edges, 158827 markings/sec, 245 secs
lola: 38923949 markings, 276309382 edges, 162363 markings/sec, 250 secs
lola: 39733772 markings, 281783679 edges, 161965 markings/sec, 255 secs
lola: 40471548 markings, 286871178 edges, 147555 markings/sec, 260 secs
lola: 41197826 markings, 292118022 edges, 145256 markings/sec, 265 secs
lola: 41911711 markings, 297210570 edges, 142777 markings/sec, 270 secs
lola: 42782808 markings, 302982896 edges, 174219 markings/sec, 275 secs
lola: 43647150 markings, 308712230 edges, 172868 markings/sec, 280 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43960265 markings, 310638849 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0))))) AND (E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0)))) AND A ((((p13 <= 0) OR (p21 <= 0) OR (p25 <= 0)) R ((p28 <= 0) OR (p49 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p38 <= 0) OR (p48 <= 0) OR (p50 <= 0))))
lola: processed formula length: 50
lola: 67 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p38) AND (1 <= p48) AND (1 <= p50))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 193 markings, 192 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: ...considering subproblem: A ((((p13 <= 0) OR (p21 <= 0) OR (p25 <= 0)) R ((p28 <= 0) OR (p49 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p13 <= 0) OR (p21 <= 0) OR (p25 <= 0)) R ((p28 <= 0) OR (p49 <= 0))))
lola: processed formula length: 78
lola: 71 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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation task get result unparse finished++ id 0
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: formula 0: ((1 <= p28) AND (1 <= p49))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p13 <= 0) OR (p23 <= 0) OR (p27 <= 0) OR (p14 <= 0) OR (p35 <= 0)) R (((p13 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p51 <= 0)))))
lola: processed formula length: 142
lola: 71 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p13) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p51)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes no yes yes yes no no no no no no
lola:
preliminary result: no yes no yes yes yes no yes yes yes no no no no no no
sara: try reading problem file CTLFireability-19-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: memory consumption: 50780 KB
lola: time consumption: 998 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: 16427456 kB
MemFree: 16107308 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16107300 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="ShieldIIPs-PT-002A"
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 ShieldIIPs-PT-002A, 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 r211-tajo-159033476900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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