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.r178-tajo-158987882000164.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 DNAwalker-PT-11ringRR, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882000164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.4K Mar 31 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 20:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 20:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591206759943

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:52: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-03 17:52:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:52:43] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2020-06-03 17:52:43] [INFO ] Transformed 27 places.
[2020-06-03 17:52:43] [INFO ] Transformed 260 transitions.
[2020-06-03 17:52:43] [INFO ] Parsed PT model containing 27 places and 260 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Incomplete random walk after 100000 steps, including 8075 resets, run finished after 355 ms. (steps per millisecond=281 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 17:52:43] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:52:43] [INFO ] Computed 0 place invariants in 8 ms
[2020-06-03 17:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:43] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-06-03 17:52:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:44] [INFO ] [Nat]Absence check using state equation in 210 ms returned unsat
[2020-06-03 17:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:44] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-06-03 17:52:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:44] [INFO ] [Nat]Absence check using state equation in 426 ms returned unsat
[2020-06-03 17:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:45] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-06-03 17:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:45] [INFO ] [Nat]Absence check using state equation in 165 ms returned unsat
[2020-06-03 17:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:45] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-06-03 17:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:45] [INFO ] [Nat]Absence check using state equation in 236 ms returned unsat
[2020-06-03 17:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:45] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-06-03 17:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:46] [INFO ] [Nat]Absence check using state equation in 226 ms returned unsat
[2020-06-03 17:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:46] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-06-03 17:52:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:46] [INFO ] [Nat]Absence check using state equation in 236 ms returned unsat
[2020-06-03 17:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:46] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 17:52:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:52:46] [INFO ] [Nat]Absence check using state equation in 187 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 17:52:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:52:46] [INFO ] Flatten gal took : 72 ms
[2020-06-03 17:52:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:52:46] [INFO ] Flatten gal took : 25 ms
FORMULA DNAwalker-PT-11ringRR-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:52:46] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2020-06-03 17:52:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DNAwalker-PT-11ringRR @ 3570 seconds

FORMULA DNAwalker-PT-11ringRR-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2151
rslt: Output for CTLFireability @ DNAwalker-PT-11ringRR

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 216
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((p3 <= 0) OR (p25 <= 1))))",
"processed_size": 34,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"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 (((p11 <= 0) OR (p15 <= 1))))",
"processed_size": 35,
"rewrites": 40
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 59
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 216
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(EX(AF(((p7 <= 1) OR (p17 <= 0)))) AND E(EF(((1 <= p3) AND (2 <= p7))) U ((2 <= p9) AND (1 <= p13))))",
"processed_size": 102,
"rewrites": 43
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 1018619,
"markings": 145660,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G (((p5 <= 0) OR (p15 <= 1))))",
"processed_size": 34,
"rewrites": 41
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 288
},
"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": "((p3 <= 1) OR (p15 <= 0))",
"processed_size": 26,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 259
},
"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": "((p11 <= 0) OR (p18 <= 1))",
"processed_size": 27,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 41
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "EG(A(((p9 <= 1) OR (p15 <= 0)) R ((p22 <= 1) OR (p25 <= 0))))",
"processed_size": 63,
"rewrites": 41
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 8,
"markings": 4,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 519
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EF((EF(((2 <= p0) AND (1 <= p17))) AND (EG(((2 <= p21) AND (1 <= p22) AND (1 <= p3) AND (2 <= p21))) AND (((p18 <= 1) OR (p21 <= 0)) AND ((p7 <= 0) OR (p8 <= 1))))))",
"processed_size": 167,
"rewrites": 42
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 509974919,
"markings": 28209796,
"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": 576
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 769
},
"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": "((p3 <= 1) OR (p15 <= 0))",
"processed_size": 26,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG((((p0 <= 1) OR (p23 <= 0)) OR EF(((1 <= p19) AND (2 <= p21)))))",
"processed_size": 67,
"rewrites": 41
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 240890378,
"markings": 28209796,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1075
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 8,
"adisj": 6,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (((((1 <= p3) AND (2 <= p21)) OR (((p21 <= 0) OR (p23 <= 1)) AND ((p4 <= 1) OR (p25 <= 0)))) U (((1 <= p9) AND (2 <= p15)) OR ((((1 <= p15) AND (2 <= p22)) OR ((1 <= p21) AND (2 <= p22))) AND (((1 <= p3) AND (2 <= p5)) OR ((2 <= p21) AND (1 <= p22)))))))",
"processed_size": 262,
"rewrites": 42
},
"result":
{
"edges": 44010,
"markings": 8822,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 73
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 5
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2151
},
"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": "((p1 <= 0) OR (p22 <= 1))",
"processed_size": 26,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 57
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 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": "((p1 <= 0) OR (p22 <= 1))",
"processed_size": 26,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 57
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1))) U ((2 <= p21) AND (1 <= p25))))",
"processed_size": 96,
"rewrites": 44
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 109
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 51764,
"runtime": 1419.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) OR A((** U **))) : (E(G(*)) OR (A(X(**)) AND (E(F(*)) AND **))) : A(F(**)) : E(G(**)) : E(G(**)) : E(F((E(F(**)) AND (E(G(**)) AND (** AND **))))) : (E(G(A(X(*)))) OR (E(F(*)) AND A(G(**)))) : (A(G((** OR E(F(**))))) OR (** OR **)) : TRUE : (E(X(A(F(**)))) AND E((E(F(**)) U **))) : E((** U **)) : (** AND A(F(**))) : E(G(**)) : (A(F(**)) OR (E(X(*)) AND (A(G(*)) AND (** AND (A(F(**)) OR **))))) : E(G(A((* R *))))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no yes no yes yes no yes yes yes yes yes no no no yes ",
"value": "no yes no yes yes no yes yes yes yes yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (A (F (A ((((2 <= p0) AND (1 <= p1)) U ((1 <= p1) AND (2 <= p22)))))) OR A (((((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1))) U ((2 <= p21) AND (1 <= p25))))) : (NOT(A (F (((1 <= p11) AND (2 <= p15))))) OR ((A (X ((1 <= p10))) AND NOT(A (G (((1 <= p3) AND (2 <= p25)))))) AND ((p15 <= 1) OR (p22 <= 0)))) : A (F (((1 <= p11) AND (2 <= p18)))) : E (G (((p1 <= 0) OR (p17 <= 1)))) : E (G ((((2 <= p7) AND (1 <= p15)) OR ((1 <= p8) AND (2 <= p17)) OR (((p11 <= 0) OR (p17 <= 1)) AND ((p7 <= 0) OR (p9 <= 1)))))) : E (F ((((E (F (((2 <= p0) AND (1 <= p17)))) AND E (G (((2 <= p21) AND (1 <= p22) AND (1 <= p3) AND (2 <= p21))))) AND ((p18 <= 1) OR (p21 <= 0))) AND ((p7 <= 0) OR (p8 <= 1))))) : (E (G (NOT(E (X (((2 <= p13) AND (1 <= p15))))))) OR (NOT(A (G (((2 <= p1) AND (1 <= p13))))) AND A (G (((1 <= p7) AND (2 <= p15)))))) : ((A (G ((((p0 <= 1) OR (p23 <= 0)) OR E (F (((1 <= p19) AND (2 <= p21))))))) OR (p0 <= 1)) OR (p19 <= 0)) : E (G ((0 <= 0))) : (E (X (A (F (((p7 <= 1) OR (p17 <= 0)))))) AND E ((E (F (((1 <= p3) AND (2 <= p7)))) U ((2 <= p9) AND (1 <= p13))))) : E (((((1 <= p3) AND (2 <= p21)) OR (((p21 <= 0) OR (p23 <= 1)) AND ((p4 <= 1) OR (p25 <= 0)))) U (((1 <= p9) AND (2 <= p15)) OR ((((1 <= p15) AND (2 <= p22)) OR ((1 <= p21) AND (2 <= p22))) AND (((1 <= p3) AND (2 <= p5)) OR ((2 <= p21) AND (1 <= p22))))))) : (((2 <= p0) AND (1 <= p2)) AND A (F (((2 <= p3) AND (1 <= p15))))) : E (G (A (((1 <= 0) U ((2 <= p0) AND (1 <= p18)))))) : (A (F (A ((((2 <= p1) AND (1 <= p21)) U ((2 <= p3) AND (1 <= p15)))))) OR (((NOT(A (X (((1 <= p7) AND (2 <= p17))))) AND NOT(E (F (((1 <= p5) AND (2 <= p15)))))) AND ((p2 <= 1) OR (p3 <= 0))) AND (A (F (((1 <= p3) AND (2 <= p4)))) OR ((2 <= p15) AND (1 <= p22))))) : NOT(A (F (E ((((2 <= p9) AND (1 <= p15)) U ((2 <= p22) AND (1 <= p25)))))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X (((p13 <= 1) OR (p15 <= 0)))))) OR (E (F (((p1 <= 1) OR (p13 <= 0)))) AND A (G (((1 <= p7) AND (2 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p7) AND (2 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p7) AND (2 <= p15))))
lola: processed formula length: 34
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: SUBRESULT
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: ((p7 <= 0) OR (p15 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((p13 <= 1) OR (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((p13 <= 1) OR (p15 <= 0))))
lola: processed formula length: 35
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p11 <= 0) OR (p15 <= 1)))) OR (A (X ((1 <= p10))) AND (E (F (((p3 <= 0) OR (p25 <= 1)))) AND ((p15 <= 1) OR (p22 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p15 <= 1) OR (p22 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p15 <= 1) OR (p22 <= 0))
lola: processed formula length: 27
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 <= 0) OR (p25 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p3 <= 0) OR (p25 <= 1))))
lola: processed formula length: 34
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 <= 0) OR (p25 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p11 <= 0) OR (p15 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p11 <= 0) OR (p15 <= 1))))
lola: processed formula length: 35
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F (((p7 <= 1) OR (p17 <= 0)))))) AND E ((E (F (((1 <= p3) AND (2 <= p7)))) U ((2 <= p9) AND (1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
sara: try reading problem file CTLFireability-3-0.sara.
lola: processed formula: (EX(AF(((p7 <= 1) OR (p17 <= 0)))) AND E(EF(((1 <= p3) AND (2 <= p7))) U ((2 <= p9) AND (1 <= p13))))
lola: processed formula length: 102
lola: 43 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).
sara: error: :60: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 145660 markings, 1018619 edges
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((2 <= p3) AND (1 <= p15)))) OR (E (X (((p7 <= 0) OR (p17 <= 1)))) AND (A (G (((p5 <= 0) OR (p15 <= 1)))) AND (((p2 <= 1) OR (p3 <= 0)) AND (A (F (((1 <= p3) AND (2 <= p4)))) OR ((2 <= p15) AND (1 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 <= 1) OR (p3 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 <= 1) OR (p3 <= 0))
lola: processed formula length: 25
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 <= 0) OR (p15 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p5 <= 0) OR (p15 <= 1))))
lola: processed formula length: 34
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: ========================================lola:
state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p5) AND (2 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p3) AND (1 <= p15))))
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: ((p3 <= 1) OR (p15 <= 0))
lola: processed formula length: 26
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p3) AND (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p11) AND (2 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p11 <= 0) OR (p18 <= 1))
lola: processed formula length: 27
lola: 42 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: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p0) AND (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p0) AND (1 <= p18))))
lola: processed formula length: 34
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 1) OR (p18 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 127 markings, 126 edges
lola: ========================================
lola: subprocess 7 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1 <= 0) OR (p17 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p1 <= 0) OR (p17 <= 1))))
lola: processed formula length: 34
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1) AND (2 <= p17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((2 <= p7) AND (1 <= p15)) OR ((1 <= p8) AND (2 <= p17)) OR (((p11 <= 0) OR (p17 <= 1)) AND ((p7 <= 0) OR (p9 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((2 <= p7) AND (1 <= p15)) OR ((1 <= p8) AND (2 <= p17)) OR (((p11 <= 0) OR (p17 <= 1)) AND ((p7 <= 0) OR (p9 <= 1))))))
lola: processed formula length: 131
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: result: yes
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: The predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: 7 markings, 7 edges
lola: formula 0: (((p7 <= 1) OR (p15 <= 0)) AND ((p8 <= 0) OR (p17 <= 1)) AND (((1 <= p11) AND (2 <= p17)) OR ((1 <= p7) AND (2 <= p9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((((p9 <= 1) OR (p15 <= 0)) R ((p22 <= 1) OR (p25 <= 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(((p9 <= 1) OR (p15 <= 0)) R ((p22 <= 1) OR (p25 <= 0))))
lola: processed formula length: 63
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F (((2 <= p0) AND (1 <= p17)))) AND (E (G (((2 <= p21) AND (1 <= p22) AND (1 <= p3) AND (2 <= p21)))) AND (((p18 <= 1) OR (p21 <= 0)) AND ((p7 <= 0) OR (p8 <= 1)))))))
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:806
lola: processed formula: EF((EF(((2 <= p0) AND (1 <= p17))) AND (EG(((2 <= p21) AND (1 <= p22) AND (1 <= p3) AND (2 <= p21))) AND (((p18 <= 1) OR (p21 <= 0)) AND ((p7 <= 0) OR (p8 <= 1))))))
lola: processed formula length: 167
lola: 42 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: 1184192 markings, 8897460 edges, 236838 markings/sec, 0 secs
lola: 2411895 markings, 18224692 edges, 245541 markings/sec, 5 secs
lola: 3545127 markings, 27044839 edges, 226646 markings/sec, 10 secs
lola: 4592309 markings, 35381146 edges, 209436 markings/sec, 15 secs
lola: 5685654 markings, 44711153 edges, 218669 markings/sec, 20 secs
lola: 6762173 markings, 53695191 edges, 215304 markings/sec, 25 secs
lola: 7626133 markings, 60750511 edges, 172792 markings/sec, 30 secs
lola: 8660324 markings, 69205796 edges, 206838 markings/sec, 35 secs
lola: 9627356 markings, 77612121 edges, 193406 markings/sec, 40 secs
lola: 10589441 markings, 85717057 edges, 192417 markings/sec, 45 secs
lola: 11626366 markings, 94894057 edges, 207385 markings/sec, 50 secs
lola: 12564913 markings, 103305122 edges, 187709 markings/sec, 55 secs
lola: 12627184 markings, 112581556 edges, 12454 markings/sec, 60 secs
lola: 12627184 markings, 121807756 edges, 0 markings/sec, 65 secs
lola: 12627184 markings, 130142794 edges, 0 markings/sec, 70 secs
lola: 12627184 markings, 138741208 edges, 0 markings/sec, 75 secs
lola: 12627184 markings, 148541483 edges, 0 markings/sec, 80 secs
lola: 12627184 markings, 157876327 edges, 0 markings/sec, 85 secs
lola: 12627184 markings, 167616607 edges, 0 markings/sec, 90 secs
lola: 12627184 markings, 176527141 edges, 0 markings/sec, 95 secs
lola: 12627184 markings, 185092927 edges, 0 markings/sec, 100 secs
lola: 12627184 markings, 194787124 edges, 0 markings/sec, 105 secs
lola: 12627184 markings, 203204759 edges, 0 markings/sec, 110 secs
lola: 12627184 markings, 212646173 edges, 0 markings/sec, 115 secs
lola: 12811087 markings, 221811466 edges, 36781 markings/sec, 120 secs
lola: 13931062 markings, 230511181 edges, 223995 markings/sec, 125 secs
lola: 15083850 markings, 239768159 edges, 230558 markings/sec, 130 secs
lola: 16084082 markings, 248054182 edges, 200046 markings/sec, 135 secs
lola: 17051911 markings, 255992384 edges, 193566 markings/sec, 140 secs
lola: 18154017 markings, 265329047 edges, 220421 markings/sec, 145 secs
lola: 19074908 markings, 274214848 edges, 184178 markings/sec, 150 secs
lola: 19074908 markings, 283809590 edges, 0 markings/sec, 155 secs
lola: 19074908 markings, 292787059 edges, 0 markings/sec, 160 secs
lola: 19074908 markings, 301154788 edges, 0 markings/sec, 165 secs
lola: 19074908 markings, 310705816 edges, 0 markings/sec, 170 secs
lola: 19074908 markings, 319221660 edges, 0 markings/sec, 175 secs
lola: 19074908 markings, 328459540 edges, 0 markings/sec, 180 secs
lola: 19441491 markings, 337322100 edges, 73317 markings/sec, 185 secs
lola: 20592364 markings, 346812280 edges, 230175 markings/sec, 190 secs
lola: 21516797 markings, 354945943 edges, 184887 markings/sec, 195 secs
lola: 22496363 markings, 363373817 edges, 195913 markings/sec, 200 secs
lola: 22665099 markings, 372089523 edges, 33747 markings/sec, 205 secs
lola: 22665099 markings, 381132325 edges, 0 markings/sec, 210 secs
lola: 22665099 markings, 389879993 edges, 0 markings/sec, 215 secs
lola: 22665099 markings, 398402946 edges, 0 markings/sec, 220 secs
lola: 23358866 markings, 406791062 edges, 138753 markings/sec, 225 secs
lola: 24374067 markings, 415524629 edges, 203040 markings/sec, 230 secs
lola: 24615957 markings, 423416748 edges, 48378 markings/sec, 235 secs
lola: 24615957 markings, 432800091 edges, 0 markings/sec, 240 secs
lola: 24847054 markings, 439681647 edges, 46219 markings/sec, 245 secs
lola: 25759829 markings, 448237142 edges, 182555 markings/sec, 250 secs
lola: 25759829 markings, 457597442 edges, 0 markings/sec, 255 secs
lola: 26462082 markings, 466604308 edges, 140451 markings/sec, 260 secs
lola: 26708439 markings, 475645126 edges, 49271 markings/sec, 265 secs
lola: 27089756 markings, 484532119 edges, 76263 markings/sec, 270 secs
lola: 27568530 markings, 493545468 edges, 95755 markings/sec, 275 secs
lola: 27883649 markings, 502555715 edges, 63024 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: 28209796 markings, 509974919 edges
lola: ========================================
lola: subprocess 11 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p0) AND (1 <= p2)) AND A (F (((2 <= p3) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p0) AND (1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p0) AND (1 <= p2))
lola: processed formula length: 25
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p3) AND (1 <= p15))))
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: ((p3 <= 1) OR (p15 <= 0))
lola: processed formula length: 26
lola: 42 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: ((2 <= p3) AND (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p0 <= 1) OR (p23 <= 0)) OR E (F (((1 <= p19) AND (2 <= p21))))))) OR ((p0 <= 1) OR (p19 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 1) OR (p19 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p0 <= 1) OR (p19 <= 0))
lola: processed formula length: 25
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p0 <= 1) OR (p23 <= 0)) OR E (F (((1 <= p19) AND (2 <= p21)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p0 <= 1) OR (p23 <= 0)) OR EF(((1 <= p19) AND (2 <= p21)))))
lola: processed formula length: 67
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1177500 markings, 8827552 edges, 235500 markings/sec, 0 secs
lola: 2388938 markings, 18062181 edges, 242288 markings/sec, 5 secs
lola: 3422144 markings, 26132184 edges, 206641 markings/sec, 10 secs
lola: 4408767 markings, 33923014 edges, 197325 markings/sec, 15 secs
lola: 5496489 markings, 43075895 edges, 217544 markings/sec, 20 secs
lola: 6474785 markings, 51434433 edges, 195659 markings/sec, 25 secs
lola: 7278802 markings, 57826236 edges, 160803 markings/sec, 30 secs
lola: 8318961 markings, 66367833 edges, 208032 markings/sec, 35 secs
lola: 9025770 markings, 72690571 edges, 141362 markings/sec, 40 secs
lola: 10127155 markings, 81647869 edges, 220277 markings/sec, 45 secs
lola: 10849572 markings, 87849479 edges, 144483 markings/sec, 50 secs
lola: 11808519 markings, 96483441 edges, 191789 markings/sec, 55 secs
lola: 12708625 markings, 104495741 edges, 180021 markings/sec, 60 secs
lola: 13795757 markings, 112855873 edges, 217426 markings/sec, 65 secs
lola: 14686887 markings, 120114305 edges, 178226 markings/sec, 70 secs
lola: 15448686 markings, 126287773 edges, 152360 markings/sec, 75 secs
lola: 16426674 markings, 134230121 edges, 195598 markings/sec, 80 secs
lola: 17216584 markings, 140799763 edges, 157982 markings/sec, 85 secs
lola: 18232590 markings, 149508096 edges, 203201 markings/sec, 90 secs
lola: 19098440 markings, 157467500 edges, 173170 markings/sec, 95 secs
lola: 19964172 markings, 165326408 edges, 173146 markings/sec, 100 secs
lola: 20791125 markings, 172126550 edges, 165391 markings/sec, 105 secs
lola: 21633378 markings, 179666820 edges, 168451 markings/sec, 110 secs
lola: 22479951 markings, 186928001 edges, 169315 markings/sec, 115 secs
lola: 23114681 markings, 193174808 edges, 126946 markings/sec, 120 secs
lola: 24065877 markings, 201343139 edges, 190239 markings/sec, 125 secs
lola: 24687145 markings, 207125203 edges, 124254 markings/sec, 130 secs
lola: 25609938 markings, 215676966 edges, 184559 markings/sec, 135 secs
lola: 26498386 markings, 224152124 edges, 177690 markings/sec, 140 secs
lola: 27351731 markings, 232421325 edges, 170669 markings/sec, 145 secs
lola: 28194848 markings, 240712016 edges, 168623 markings/sec, 150 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28209796 markings, 240890378 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1075 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p3) AND (2 <= p21)) OR (((p21 <= 0) OR (p23 <= 1)) AND ((p4 <= 1) OR (p25 <= 0)))) U (((1 <= p9) AND (2 <= p15)) OR ((((1 <= p15) AND (2 <= p22)) OR ((1 <= p21) AND (2 <= p22))) AND (((1 <= p3) AND (2 <= p5)) OR ((2 <= p21) AND (1 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p3) AND (2 <= p21)) OR (((p21 <= 0) OR (p23 <= 1)) AND ((p4 <= 1) OR (p25 <= 0)))) U (((1 <= p9) AND (2 <= p15)) OR ((((1 <= p15) AND (2 <= p22)) OR ((1 <= p21) AND (2 <= p22))) AND (((1 <= p3) AND (2 <= p5)) OR ((2 <= p21) AND (1 <= p22)))))))
lola: processed formula length: 262
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p9) AND (2 <= p15)) OR ((((1 <= p15) AND (2 <= p22)) OR ((1 <= p21) AND (2 <= p22))) AND (((1 <= p3) AND (2 <= p5)) OR ((2 <= p21) AND (1 <= p22)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: error: :60: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 8822 markings, 44010 edges
lola: ========================================
lola: subprocess 14 will run for 2151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p1) AND (2 <= p22)))) OR A (((((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1))) U ((2 <= p21) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p1) AND (2 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 0) OR (p22 <= 1))
lola: processed formula length: 26
lola: 42 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 <= p1) AND (2 <= p22))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p1) AND (2 <= p22)))) OR A (((((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1))) U ((2 <= p21) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p1) AND (2 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 0) OR (p22 <= 1))
lola: processed formula length: 26
lola: 42 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 <= p1) AND (2 <= p22))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1))) U ((2 <= p21) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1))) U ((2 <= p21) AND (1 <= p25))))
lola: processed formula length: 96
lola: 44 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p5 <= 1) OR (p15 <= 0)) AND ((p22 <= 0) OR (p23 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 9 markings, 9 edges
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes yes yes yes yes no no no yes
lola:
preliminary result: no yes no yes yes no yes yes yes yes yes no no no yes
sara: try reading problem file CTLFireability-16-0.sara.
sara: error: :60: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: memory consumption: 51764 KB
lola: time consumption: 1419 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-11ringRR"
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 DNAwalker-PT-11ringRR, 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 r178-tajo-158987882000164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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