Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938400043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-007008, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.1K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591223803277

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:36:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 22:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:36:45] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-03 22:36:45] [INFO ] Transformed 39 places.
[2020-06-03 22:36:45] [INFO ] Transformed 31 transitions.
[2020-06-03 22:36:45] [INFO ] Parsed PT model containing 39 places and 31 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 114 ms. (steps per millisecond=877 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 31 rows 39 cols
[2020-06-03 22:36:45] [INFO ] Computed 16 place invariants in 2 ms
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-06-03 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 14 ms.
[2020-06-03 22:36:46] [INFO ] Added : 15 causal constraints over 3 iterations in 59 ms. Result :sat
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-03 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 5 ms.
[2020-06-03 22:36:46] [INFO ] Added : 14 causal constraints over 3 iterations in 37 ms. Result :sat
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using 16 positive place invariants in 43 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-03 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 4 ms.
[2020-06-03 22:36:46] [INFO ] Added : 16 causal constraints over 4 iterations in 94 ms. Result :sat
[2020-06-03 22:36:46] [INFO ] Flatten gal took : 43 ms
[2020-06-03 22:36:46] [INFO ] Flatten gal took : 13 ms
[2020-06-03 22:36:46] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 22:36:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-007008 @ 3570 seconds

FORMULA n0-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2164
rslt: Output for CTLCardinality @ RefineWMG-PT-007008

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 22:36:47 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((p9 <= 1) AND (p16 <= 2))))",
"processed_size": 34,
"rewrites": 21
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((p26 + 1 <= p33) OR (p34 <= 1)))",
"processed_size": 37,
"rewrites": 21
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 264
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 <= p2)))",
"processed_size": 18,
"rewrites": 22
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p9 <= p11)))",
"processed_size": 19,
"rewrites": 22
},
"result":
{
"edges": 34,
"markings": 35,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "E (F (((2 <= p9) OR ((p21 <= 0) AND (p17 + 1 <= p18)))))",
"processed_size": 57,
"rewrites": 21
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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 (F (((p20 + 1 <= p10) AND (p0 + 1 <= p16) AND (3 <= p35))))",
"processed_size": 61,
"rewrites": 21
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p37 <= 0)",
"processed_size": 10,
"rewrites": 24
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 793
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "E (F (((p28 <= 0) AND ((2 <= p28) OR (p12 <= p25)))))",
"processed_size": 54,
"rewrites": 21
},
"result":
{
"edges": 24,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 972
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((1 <= p2)) OR ((1 <= p29) AND (p8 <= p2) AND (p7 <= p25))))",
"processed_size": 66,
"rewrites": 22
},
"result":
{
"edges": 250,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

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

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p22) AND (p34 <= p3))))",
"processed_size": 36,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"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"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p8 <= p6) OR (p5 <= p36))))",
"processed_size": 36,
"rewrites": 22
},
"result":
{
"edges": 51,
"markings": 46,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 20,
"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"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(EG((2 <= p9)))",
"processed_size": 17,
"rewrites": 22
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 18,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3620,
"runtime": 1406.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U A(G(**)))) : A(G(**)) : A(G(**)) : A(G(**)) : A(G((A(G(**)) OR **))) : (E(F(**)) AND **) : E(F(**)) : A(F(A(G(**)))) : (A(F(*)) AND A(G(*))) : E(F(*)) : (A(F(E(G(**)))) OR (E(F(**)) AND A(G(**)))) : E((** U **)) : (A(X(*)) AND E(F(*))) : A(G(**)) : E(F(*)) : A(G((E(X(**)) OR **)))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 24,
"places": 39,
"places_significant": 23,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "unknown no no no no yes yes no no yes no unknown yes no yes unknown ",
"value": "unknown no no no no yes yes no no yes no unknown yes no yes unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 31 transitions, 23 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 CTLCardinality.xml
lola: E (((1 <= p1) U A (G ((p19 <= p10))))) : A (G (A (G (((1 <= p31) OR (2 <= p19)))))) : A (G ((p9 <= p11))) : A (G ((((p4 + 1 <= p10) OR (p4 <= 0)) AND ((p22 + 1 <= p25) OR (2 <= p7))))) : A (G ((A (G ((1 <= p2))) OR ((1 <= p29) AND (p8 <= p2) AND (p7 <= p25))))) : (E (F (((p28 <= 0) AND ((2 <= p28) OR (p12 <= p25))))) AND (p38 <= p37)) : E (F (((2 <= p9) OR ((p21 <= 0) AND (p17 + 1 <= p18))))) : A (F (A (G ((1 <= p37))))) : (NOT(E (G (((p5 <= p35) AND (p11 <= p1))))) AND NOT(E (F ((p19 + 1 <= p5))))) : NOT(A (G (((p10 <= p20) OR (p16 <= p0) OR (p35 <= 2))))) : (A (F (E (G ((2 <= p9))))) OR (E (F (((2 <= p22) AND (p34 <= p3)))) AND A (G (((p8 <= p6) OR (p5 <= p36)))))) : E ((((p27 <= p26) OR (p20 <= p31) OR (p13 <= p35)) U (p21 <= p14))) : (NOT(E (X (((p33 <= p26) AND (2 <= p34))))) AND NOT(A (G (((2 <= p9) OR (3 <= p16)))))) : A (G ((p5 <= p2))) : E (F (NOT(E (G ((p33 <= p21)))))) : A (G ((E (X ((p5 <= p0))) OR ((p37 <= p9) AND (p28 <= p17) AND (2 <= p22) AND (3 <= p5)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p26 + 1 <= p33) OR (p34 <= 1)))) AND E (F (((p9 <= 1) AND (p16 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9 <= 1) AND (p16 <= 2))))
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 (((p9 <= 1) AND (p16 <= 2))))
lola: processed formula length: 34
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((p9 <= 1) AND (p16 <= 2))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p26 + 1 <= p33) OR (p34 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p26 + 1 <= p33) OR (p34 <= 1)))
lola: processed formula length: 37
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((p5 <= p0))) OR ((p37 <= p9) AND (p28 <= p17) AND (2 <= p22) AND (3 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX((p5 <= p0)) OR ((p37 <= p9) AND (p28 <= p17) AND (2 <= p22) AND (3 <= p5))))
lola: processed formula length: 83
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 5036048 markings, 7868796 edges, 1007210 markings/sec, 0 secs
lola: 9835449 markings, 15367865 edges, 959880 markings/sec, 5 secs
lola: 13614264 markings, 21272260 edges, 755763 markings/sec, 10 secs
lola: 17015517 markings, 26586717 edges, 680251 markings/sec, 15 secs
lola: 21303920 markings, 33287348 edges, 857681 markings/sec, 20 secs
lola: 24300759 markings, 37969907 edges, 599368 markings/sec, 25 secs
lola: 28562292 markings, 44628556 edges, 852307 markings/sec, 30 secs
lola: 33115888 markings, 51743545 edges, 910719 markings/sec, 35 secs
lola: 37704201 markings, 58912786 edges, 917663 markings/sec, 40 secs
lola: 42012394 markings, 65644330 edges, 861639 markings/sec, 45 secs
lola: 44894183 markings, 70147126 edges, 576358 markings/sec, 50 secs
lola: 48756011 markings, 76181231 edges, 772366 markings/sec, 55 secs
lola: 52306277 markings, 81728526 edges, 710053 markings/sec, 60 secs
lola: 55388557 markings, 86544583 edges, 616456 markings/sec, 65 secs
lola: 59729513 markings, 93327327 edges, 868191 markings/sec, 70 secs
lola: 64366115 markings, 100572006 edges, 927320 markings/sec, 75 secs
lola: 68187758 markings, 106544348 edges, 764329 markings/sec, 80 secs
lola: 71857814 markings, 112278080 edges, 734011 markings/sec, 85 secs
lola: 73973940 markings, 115584243 edges, 423225 markings/sec, 90 secs
lola: 74928305 markings, 117075437 edges, 190873 markings/sec, 95 secs
lola: 76799906 markings, 119999806 edges, 374320 markings/sec, 100 secs
lola: 78943010 markings, 123348412 edges, 428621 markings/sec, 105 secs
lola: 80635718 markings, 125993265 edges, 338542 markings/sec, 110 secs
lola: 82260225 markings, 128531559 edges, 324901 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p31) OR (2 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p31) OR (2 <= p19))))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p31 <= 0) AND (p19 <= 1))
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: 48 markings, 47 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 <= p2)))
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 ((p5 <= p2)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file CTLCardinality.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
sara: try reading problem file CTLCardinality-2-0.sara.
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: (p2 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p21 + 1 <= p33)))
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 ((p21 + 1 <= p33)))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (p21 + 1 <= p33)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 15 edges
lola: state equation: write sara problem file to CTLCardinality-4-0.sara

lola: state equation: calling and running sara

sara: try reading problem file CTLCardinality-4-0.sara.

lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p9 <= p11)))
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 ((p9 <= p11)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p11 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p9) OR ((p21 <= 0) AND (p17 + 1 <= p18)))))
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 (((2 <= p9) OR ((p21 <= 0) AND (p17 + 1 <= p18)))))
lola: processed formula length: 57
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((2 <= p9) OR ((p21 <= 0) AND (p17 + 1 <= p18)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
sara: try reading problem file CTLCardinality-5-0.sara.
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara

sara: try reading problem file CTLCardinality-6-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p4 + 1 <= p10) OR (p4 <= 0)) AND ((p22 + 1 <= p25) OR (2 <= p7)))))
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 ((((p4 + 1 <= p10) OR (p4 <= 0)) AND ((p22 + 1 <= p25) OR (2 <= p7)))))
lola: processed formula length: 78
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p10 <= p4) AND (1 <= p4)) OR ((p25 <= p22) AND (p7 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + 1 <= p10) AND (p0 + 1 <= p16) AND (3 <= p35))))
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 (((p20 + 1 <= p10) AND (p0 + 1 <= p16) AND (3 <= p35))))
lola: processed formula length: 61
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((p20 + 1 <= p10) AND (p0 + 1 <= p16) AND (3 <= p35))
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
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================

lola: ...considering subproblem: E (((1 <= p1) U A (G ((p19 <= p10)))))
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((1 <= p1) U AG((p19 <= p10)))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 4792625 markings, 9304265 edges, 958525 markings/sec, 0 secs
lola: 5670076 markings, 21329367 edges, 175490 markings/sec, 5 secs
lola: 11548990 markings, 30515172 edges, 1175783 markings/sec, 10 secs
lola: 17435959 markings, 39713551 edges, 1177394 markings/sec, 15 secs
lola: 23187049 markings, 48699635 edges, 1150218 markings/sec, 20 secs
lola: 28975083 markings, 57743444 edges, 1157607 markings/sec, 25 secs
lola: 29909769 markings, 65298649 edges, 186937 markings/sec, 30 secs
lola: 29909769 markings, 76366049 edges, 0 markings/sec, 35 secs
lola: 29909769 markings, 88368041 edges, 0 markings/sec, 40 secs
lola: 29909769 markings, 99761004 edges, 0 markings/sec, 45 secs
lola: 29909769 markings, 111697348 edges, 0 markings/sec, 50 secs
lola: 29957512 markings, 123205089 edges, 9549 markings/sec, 55 secs
lola: 35560521 markings, 132153342 edges, 1120602 markings/sec, 60 secs
lola: 41271646 markings, 141076978 edges, 1142225 markings/sec, 65 secs
lola: 46884247 markings, 149846660 edges, 1122520 markings/sec, 70 secs
lola: 52276087 markings, 158271410 edges, 1078368 markings/sec, 75 secs
lola: 57817526 markings, 166929917 edges, 1108288 markings/sec, 80 secs
lola: 59803321 markings, 173481792 edges, 397159 markings/sec, 85 secs
lola: 59803321 markings, 183804500 edges, 0 markings/sec, 90 secs
lola: 59803321 markings, 195121001 edges, 0 markings/sec, 95 secs
lola: 59803321 markings, 206013923 edges, 0 markings/sec, 100 secs
lola: 59803321 markings, 216831164 edges, 0 markings/sec, 105 secs
lola: 59803321 markings, 227489690 edges, 0 markings/sec, 110 secs
lola: 59803321 markings, 238373502 edges, 0 markings/sec, 115 secs
lola: 61327465 markings, 248639391 edges, 304829 markings/sec, 120 secs
lola: 67242121 markings, 257881041 edges, 1182931 markings/sec, 125 secs
lola: 73018025 markings, 266905887 edges, 1155181 markings/sec, 130 secs
lola: 78715581 markings, 275808317 edges, 1139511 markings/sec, 135 secs
lola: 84382371 markings, 284662681 edges, 1133358 markings/sec, 140 secs
lola: 89950629 markings, 293363078 edges, 1113652 markings/sec, 145 secs
lola: 92661001 markings, 297599512 edges, 542074 markings/sec, 150 secs
lola: 94473281 markings, 300429724 edges, 362456 markings/sec, 155 secs
lola: 94473281 markings, 320146363 edges, 0 markings/sec, 160 secs
lola: 94473281 markings, 331699589 edges, 0 markings/sec, 165 secs
lola: 94473281 markings, 343396875 edges, 0 markings/sec, 170 secs
lola: 94473281 markings, 354571496 edges, 0 markings/sec, 175 secs
lola: 94473281 markings, 366381258 edges, 0 markings/sec, 180 secs
lola: 94473281 markings, 376372079 edges, 0 markings/sec, 185 secs
lola: 94473281 markings, 387361508 edges, 0 markings/sec, 190 secs
lola: 99052652 markings, 395997865 edges, 915874 markings/sec, 195 secs
lola: 99198568 markings, 396225228 edges, 29183 markings/sec, 200 secs
lola: 99198568 markings, 396225228 edges, 0 markings/sec, 205 secs
lola: 99198568 markings, 396225228 edges, 0 markings/sec, 210 secs
lola: 100806934 markings, 398738302 edges, 321673 markings/sec, 215 secs
lola: 104342150 markings, 404264336 edges, 707043 markings/sec, 220 secs
lola: 109218863 markings, 411882292 edges, 975343 markings/sec, 225 secs
lola: 110730625 markings, 414244073 edges, 302352 markings/sec, 230 secs
lola: 114639300 markings, 420351367 edges, 781735 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p37 <= 0)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p37)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 9 markings, 9 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p37 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p28 <= 0) AND ((2 <= p28) OR (p12 <= p25))))) AND (p38 <= p37))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p38 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p38 <= p37)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 793 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p28 <= 0) AND ((2 <= p28) OR (p12 <= p25)))))
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 (((p28 <= 0) AND ((2 <= p28) OR (p12 <= p25)))))
lola: processed formula length: 54
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: formula 0: ((p28 <= 0) AND ((2 <= p28) OR (p12 <= p25)))
lola: state equation task get result unparse finished id 0
lola: 17 markings, 24 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 793 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p27 <= p26) OR (p20 <= p31) OR (p13 <= p35)) U (p21 <= p14)))
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 ((((p27 <= p26) OR (p20 <= p31) OR (p13 <= p35)) U (p21 <= p14)))
lola: processed formula length: 69
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: (p21 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 5976278 markings, 9337904 edges, 1195256 markings/sec, 0 secs
lola: sara is running 5 secs || 11618310 markings, 18153586 edges, 1128406 markings/sec, 5 secs
lola: sara is running 10 secs || 17244340 markings, 26944260 edges, 1125206 markings/sec, 10 secs
lola: sara is running 15 secs || 22779684 markings, 35593232 edges, 1107069 markings/sec, 15 secs
lola: sara is running 20 secs || 28372961 markings, 44332727 edges, 1118655 markings/sec, 20 secs
lola: sara is running 25 secs || 33796957 markings, 52807717 edges, 1084799 markings/sec, 25 secs
lola: sara is running 30 secs || 39281678 markings, 61377585 edges, 1096944 markings/sec, 30 secs
lola: sara is running 35 secs || 44630330 markings, 69734853 edges, 1069730 markings/sec, 35 secs
lola: sara is running 40 secs || 49871062 markings, 77923504 edges, 1048146 markings/sec, 40 secs
lola: sara is running 45 secs || 55178146 markings, 86215817 edges, 1061417 markings/sec, 45 secs
lola: sara is running 50 secs || 60435570 markings, 94430537 edges, 1051485 markings/sec, 50 secs
lola: sara is running 55 secs || 65877702 markings, 102933864 edges, 1088426 markings/sec, 55 secs
lola: sara is running 60 secs || 71288226 markings, 111387809 edges, 1082105 markings/sec, 60 secs
lola: sara is running 65 secs || 76693941 markings, 119834243 edges, 1081143 markings/sec, 65 secs
lola: sara is running 70 secs || 82016218 markings, 128150302 edges, 1064455 markings/sec, 70 secs
lola: sara is running 75 secs || 87454801 markings, 136648083 edges, 1087717 markings/sec, 75 secs
lola: sara is running 80 secs || 93040945 markings, 145376431 edges, 1117229 markings/sec, 80 secs
lola: sara is running 85 secs || 98652029 markings, 154143742 edges, 1122217 markings/sec, 85 secs
lola: sara is running 90 secs || 104132485 markings, 162706952 edges, 1096091 markings/sec, 90 secs
lola: sara is running 95 secs || 109584710 markings, 171226052 edges, 1090445 markings/sec, 95 secs
lola: sara is running 100 secs || 114980702 markings, 179657295 edges, 1079198 markings/sec, 100 secs
lola: sara is running 105 secs || 120272007 markings, 187924951 edges, 1058261 markings/sec, 105 secs
lola: sara is running 110 secs || 125579853 markings, 196218460 edges, 1061569 markings/sec, 110 secs
lola: sara is running 115 secs || 131031351 markings, 204736435 edges, 1090300 markings/sec, 115 secs
lola: sara is running 120 secs || 136284140 markings, 212943899 edges, 1050558 markings/sec, 120 secs
lola: sara is running 125 secs || 137244249 markings, 214444073 edges, 192022 markings/sec, 125 secs
lola: sara is running 130 secs || 138384959 markings, 216226433 edges, 228142 markings/sec, 130 secs
lola: sara is running 135 secs || 140533218 markings, 219583091 edges, 429652 markings/sec, 135 secs
lola: sara is running 140 secs || 143927903 markings, 224887287 edges, 678937 markings/sec, 140 secs
lola: sara is running 145 secs || 144187347 markings, 225292665 edges, 51889 markings/sec, 145 secs
lola: sara is running 150 secs || 144187347 markings, 225292665 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || 144187347 markings, 225292665 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 144187347 markings, 225292665 edges, 0 markings/sec, 160 secs
lola: sara is running 165 secs || 144228349 markings, 225356729 edges, 8200 markings/sec, 165 secs
lola: sara is running 170 secs || 148161120 markings, 231501688 edges, 786554 markings/sec, 170 secs
lola: sara is running 175 secs || 148431249 markings, 231923774 edges, 54026 markings/sec, 175 secs
lola: sara is running 180 secs || 148431249 markings, 231923774 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || 148431249 markings, 231923774 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || 148431249 markings, 231923774 edges, 0 markings/sec, 190 secs
lola: sara is running 195 secs || 150897761 markings, 235777689 edges, 493302 markings/sec, 195 secs
lola: sara is running 200 secs || 153000238 markings, 239062805 edges, 420495 markings/sec, 200 secs
lola: sara is running 205 secs || 156141474 markings, 243970984 edges, 628247 markings/sec, 205 secs
lola: sara is running 210 secs || 159370125 markings, 249015747 edges, 645730 markings/sec, 210 secs
lola: sara is running 215 secs || 164189877 markings, 256546611 edges, 963950 markings/sec, 215 secs
lola: sara is running 220 secs || 164388950 markings, 256857672 edges, 39815 markings/sec, 220 secs
lola: sara is running 225 secs || 167089556 markings, 261077359 edges, 540121 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((1 <= p2))) OR ((1 <= p29) AND (p8 <= p2) AND (p7 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= p2)) OR ((1 <= p29) AND (p8 <= p2) AND (p7 <= p25))))
lola: processed formula length: 66
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 194 markings, 250 edges
lola: ========================================
lola: subprocess 14 will run for 1458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p35 + 1 <= p5) OR (p1 + 1 <= p11)))) AND A (G ((p5 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p5 <= p19)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p19 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2916 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((2 <= p9))))) OR (E (F (((2 <= p22) AND (p34 <= p3)))) AND A (G (((p8 <= p6) OR (p5 <= p36))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2916 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p22) AND (p34 <= p3))))
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 (((2 <= p22) AND (p34 <= p3))))
lola: processed formula length: 36
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p22) AND (p34 <= p3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
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 (F (E (G ((2 <= p9)))))
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((2 <= p9)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((p5 <= p0))) OR ((p37 <= p9) AND (p28 <= p17) AND (2 <= p22) AND (3 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX((p5 <= p0)) OR ((p37 <= p9) AND (p28 <= p17) AND (2 <= p22) AND (3 <= p5))))
lola: processed formula length: 83
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 5053291 markings, 7895742 edges, 1010658 markings/sec, 0 secs
lola: 9864170 markings, 15412736 edges, 962176 markings/sec, 5 secs
lola: 13623746 markings, 21287084 edges, 751915 markings/sec, 10 secs
lola: 17028874 markings, 26607584 edges, 681026 markings/sec, 15 secs
lola: 21368985 markings, 33389018 edges, 868022 markings/sec, 20 secs
lola: 24408471 markings, 38138209 edges, 607897 markings/sec, 25 secs
lola: 28765953 markings, 44946772 edges, 871496 markings/sec, 30 secs
lola: 33390955 markings, 52173332 edges, 925000 markings/sec, 35 secs
lola: 38049818 markings, 59452809 edges, 931773 markings/sec, 40 secs
lola: 42301773 markings, 66096485 edges, 850391 markings/sec, 45 secs
lola: 45229827 markings, 70671565 edges, 585611 markings/sec, 50 secs
lola: 49345123 markings, 77101721 edges, 823059 markings/sec, 55 secs
lola: 52755349 markings, 82430201 edges, 682045 markings/sec, 60 secs
lola: 56130670 markings, 87704135 edges, 675064 markings/sec, 65 secs
lola: 60628557 markings, 94732088 edges, 899577 markings/sec, 70 secs
lola: 65331972 markings, 102081162 edges, 940683 markings/sec, 75 secs
lola: 67091575 markings, 104834212 edges, 351921 markings/sec, 80 secs
lola: 67933916 markings, 106146843 edges, 168468 markings/sec, 85 secs
lola: 71799850 markings, 112187263 edges, 773187 markings/sec, 90 secs
lola: 74192041 markings, 115925327 edges, 478438 markings/sec, 95 secs
lola: 77673387 markings, 121364675 edges, 696269 markings/sec, 100 secs
lola: 80916482 markings, 126432683 edges, 648619 markings/sec, 105 secs
lola: 82445967 markings, 128821780 edges, 305897 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((1 <= p1) U A (G ((p19 <= p10)))))
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((1 <= p1) U AG((p19 <= p10)))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 4792625 markings, 9500697 edges, 958525 markings/sec, 0 secs
lola: 5867792 markings, 21638294 edges, 215033 markings/sec, 5 secs
lola: 11846575 markings, 30980152 edges, 1195757 markings/sec, 10 secs
lola: 17698188 markings, 40123287 edges, 1170323 markings/sec, 15 secs
lola: 23516205 markings, 49213947 edges, 1163603 markings/sec, 20 secs
lola: 29364520 markings, 58351931 edges, 1169663 markings/sec, 25 secs
lola: 29909769 markings, 66045502 edges, 109050 markings/sec, 30 secs
lola: 29909769 markings, 77259654 edges, 0 markings/sec, 35 secs
lola: 29909769 markings, 89220077 edges, 0 markings/sec, 40 secs
lola: 29909769 markings, 100625492 edges, 0 markings/sec, 45 secs
lola: 29909769 markings, 112460241 edges, 0 markings/sec, 50 secs
lola: 30237085 markings, 123835477 edges, 65463 markings/sec, 55 secs
lola: 35921925 markings, 132718035 edges, 1136968 markings/sec, 60 secs
lola: 41597267 markings, 141585762 edges, 1135068 markings/sec, 65 secs
lola: 47133842 markings, 150236653 edges, 1107315 markings/sec, 70 secs
lola: 52600785 markings, 158778761 edges, 1093389 markings/sec, 75 secs
lola: 58056404 markings, 167303160 edges, 1091124 markings/sec, 80 secs
lola: 59803321 markings, 173862708 edges, 349383 markings/sec, 85 secs
lola: 59803321 markings, 184187873 edges, 0 markings/sec, 90 secs
lola: 59803321 markings, 195605154 edges, 0 markings/sec, 95 secs
lola: 59803321 markings, 206643602 edges, 0 markings/sec, 100 secs
lola: 59803321 markings, 217587860 edges, 0 markings/sec, 105 secs
lola: 59803321 markings, 228512762 edges, 0 markings/sec, 110 secs
lola: 59803321 markings, 239791739 edges, 0 markings/sec, 115 secs
lola: 61997934 markings, 249687000 edges, 438923 markings/sec, 120 secs
lola: 67840690 markings, 258816294 edges, 1168551 markings/sec, 125 secs
lola: 73610184 markings, 267831138 edges, 1153899 markings/sec, 130 secs
lola: 79247970 markings, 276640174 edges, 1127557 markings/sec, 135 secs
lola: 84820166 markings, 285346729 edges, 1114439 markings/sec, 140 secs
lola: 90350864 markings, 293988450 edges, 1106140 markings/sec, 145 secs
lola: 94473281 markings, 300429724 edges, 824483 markings/sec, 150 secs
lola: 94473281 markings, 303396655 edges, 0 markings/sec, 155 secs
lola: 94473281 markings, 313934354 edges, 0 markings/sec, 160 secs
lola: 94473281 markings, 325244691 edges, 0 markings/sec, 165 secs
lola: 94473281 markings, 336508920 edges, 0 markings/sec, 170 secs
lola: 94473281 markings, 347584777 edges, 0 markings/sec, 175 secs
lola: 94473281 markings, 358563386 edges, 0 markings/sec, 180 secs
lola: 94473281 markings, 369653376 edges, 0 markings/sec, 185 secs
lola: 94473281 markings, 380865758 edges, 0 markings/sec, 190 secs
lola: 96203184 markings, 391546508 edges, 345981 markings/sec, 195 secs
lola: 97666722 markings, 393831708 edges, 292708 markings/sec, 200 secs
lola: 97681978 markings, 393855550 edges, 3051 markings/sec, 205 secs
lola: 99810380 markings, 397181181 edges, 425680 markings/sec, 210 secs
lola: 99966857 markings, 397425680 edges, 31295 markings/sec, 215 secs
lola: 99974605 markings, 397437787 edges, 1550 markings/sec, 220 secs
lola: 103838546 markings, 403475192 edges, 772788 markings/sec, 225 secs
lola: 103980988 markings, 403697760 edges, 28488 markings/sec, 230 secs
lola: 103980988 markings, 403697760 edges, 0 markings/sec, 235 secs
lola: 103980988 markings, 403697760 edges, 0 markings/sec, 240 secs
lola: 107400298 markings, 409040427 edges, 683862 markings/sec, 245 secs
lola: 108123200 markings, 410169967 edges, 144580 markings/sec, 250 secs
lola: 108123200 markings, 410169967 edges, 0 markings/sec, 255 secs
lola: 110451557 markings, 413808026 edges, 465671 markings/sec, 260 secs
lola: 113297023 markings, 418254060 edges, 569093 markings/sec, 265 secs
lola: 113297023 markings, 418254060 edges, 0 markings/sec, 270 secs
lola: 113297023 markings, 418254060 edges, 0 markings/sec, 275 secs
lola: 113297023 markings, 418254060 edges, 0 markings/sec, 280 secs
lola: 115173583 markings, 421186184 edges, 375312 markings/sec, 285 secs
lola: 115173670 markings, 421186320 edges, 17 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p27 <= p26) OR (p20 <= p31) OR (p13 <= p35)) U (p21 <= p14)))
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 ((((p27 <= p26) OR (p20 <= p31) OR (p13 <= p35)) U (p21 <= p14)))
lola: processed formula length: 69
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: (p21 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 6053005 markings, 9457796 edges, 1210601 markings/sec, 0 secs
lola: sara is running 5 secs || 11741064 markings, 18345385 edges, 1137612 markings/sec, 5 secs
lola: sara is running 10 secs || 17478175 markings, 27309622 edges, 1147422 markings/sec, 10 secs
lola: sara is running 15 secs || 23083965 markings, 36068665 edges, 1121158 markings/sec, 15 secs
lola: sara is running 20 secs || 28677436 markings, 44808471 edges, 1118694 markings/sec, 20 secs
lola: sara is running 25 secs || 34141617 markings, 53346240 edges, 1092836 markings/sec, 25 secs
lola: sara is running 30 secs || 39713843 markings, 62052850 edges, 1114445 markings/sec, 30 secs
lola: sara is running 35 secs || 45108322 markings, 70481718 edges, 1078896 markings/sec, 35 secs
lola: sara is running 40 secs || 50363328 markings, 78692668 edges, 1051001 markings/sec, 40 secs
lola: sara is running 45 secs || 55781068 markings, 87157879 edges, 1083548 markings/sec, 45 secs
lola: sara is running 50 secs || 61130776 markings, 95516797 edges, 1069942 markings/sec, 50 secs
lola: sara is running 55 secs || 66593764 markings, 104052708 edges, 1092598 markings/sec, 55 secs
lola: sara is running 60 secs || 72120869 markings, 112688814 edges, 1105421 markings/sec, 60 secs
lola: sara is running 65 secs || 77551116 markings, 121173570 edges, 1086049 markings/sec, 65 secs
lola: sara is running 70 secs || 82892068 markings, 129518812 edges, 1068190 markings/sec, 70 secs
lola: sara is running 75 secs || 88290395 markings, 137953699 edges, 1079665 markings/sec, 75 secs
lola: sara is running 80 secs || 93964664 markings, 146819738 edges, 1134854 markings/sec, 80 secs
lola: sara is running 85 secs || 99565996 markings, 155571816 edges, 1120266 markings/sec, 85 secs
lola: sara is running 90 secs || 105059939 markings, 164156105 edges, 1098789 markings/sec, 90 secs
lola: sara is running 95 secs || 110408589 markings, 172513368 edges, 1069730 markings/sec, 95 secs
lola: sara is running 100 secs || 115764179 markings, 180881471 edges, 1071118 markings/sec, 100 secs
lola: sara is running 105 secs || 121010815 markings, 189079344 edges, 1049327 markings/sec, 105 secs
lola: sara is running 110 secs || 126296592 markings, 197338366 edges, 1057155 markings/sec, 110 secs
lola: sara is running 115 secs || 131652915 markings, 205707619 edges, 1071265 markings/sec, 115 secs
lola: sara is running 120 secs || 136182980 markings, 212785838 edges, 906013 markings/sec, 120 secs
lola: sara is running 125 secs || 140220006 markings, 219093702 edges, 807405 markings/sec, 125 secs
lola: sara is running 130 secs || 142458950 markings, 222592044 edges, 447789 markings/sec, 130 secs
lola: sara is running 135 secs || 147141566 markings, 229908633 edges, 936523 markings/sec, 135 secs
lola: sara is running 140 secs || 147303781 markings, 230162100 edges, 32443 markings/sec, 140 secs
lola: sara is running 145 secs || 147303781 markings, 230162100 edges, 0 markings/sec, 145 secs
lola: sara is running 150 secs || 147303781 markings, 230162100 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || 147342707 markings, 230222919 edges, 7785 markings/sec, 155 secs
lola: sara is running 160 secs || 151082011 markings, 236065574 edges, 747861 markings/sec, 160 secs
lola: sara is running 165 secs || 156149809 markings, 243984011 edges, 1013560 markings/sec, 165 secs
lola: sara is running 170 secs || 156376640 markings, 244338422 edges, 45366 markings/sec, 170 secs
lola: sara is running 175 secs || 156376640 markings, 244338422 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || 156733513 markings, 244896042 edges, 71375 markings/sec, 180 secs
lola: sara is running 185 secs || 161020860 markings, 251595024 edges, 857469 markings/sec, 185 secs
lola: sara is running 190 secs || 161020860 markings, 251595024 edges, 0 markings/sec, 190 secs
lola: sara is running 195 secs || 161020860 markings, 251595024 edges, 0 markings/sec, 195 secs
lola: sara is running 200 secs || 162633249 markings, 254114382 edges, 322478 markings/sec, 200 secs
lola: sara is running 205 secs || 165465167 markings, 258539258 edges, 566384 markings/sec, 205 secs
lola: sara is running 210 secs || 168062867 markings, 262598157 edges, 519540 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((2 <= p9))))) OR (E (F (((2 <= p22) AND (p34 <= p3)))) AND A (G (((p8 <= p6) OR (p5 <= p36))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p22) AND (p34 <= p3))))
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 (((2 <= p22) AND (p34 <= p3))))
lola: processed formula length: 36
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: formula 0: ((2 <= p22) AND (p34 <= p3))
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 (G (((p8 <= p6) OR (p5 <= p36))))
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 (((p8 <= p6) OR (p5 <= p36))))
lola: processed formula length: 36
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6 + 1 <= p8) AND (p36 + 1 <= p5))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 46 markings, 51 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((2 <= p9)))))
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((2 <= p9)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no yes yes no no yes no unknown yes no yes unknown
lola:
preliminary result: unknown no no no no yes yes no no yes no unknown yes no yes unknown
lola: memory consumption: 3620 KB
lola: time consumption: 1406 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="RefineWMG-PT-007008"
export BK_EXAMINATION="CTLCardinality"
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 RefineWMG-PT-007008, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938400043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007008.tgz
mv RefineWMG-PT-007008 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;