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-158987938400035.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-007007, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 11:58 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 2.9K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:55 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 1591223788529

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:36:30] [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:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:36:30] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-03 22:36:30] [INFO ] Transformed 39 places.
[2020-06-03 22:36:30] [INFO ] Transformed 31 transitions.
[2020-06-03 22:36:30] [INFO ] Parsed PT model containing 39 places and 31 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100006 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=800 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 31 rows 39 cols
[2020-06-03 22:36:30] [INFO ] Computed 16 place invariants in 2 ms
[2020-06-03 22:36:30] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-06-03 22:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-03 22:36:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2020-06-03 22:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 22:36:30] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 3 ms.
[2020-06-03 22:36:30] [INFO ] Added : 12 causal constraints over 3 iterations in 43 ms. Result :sat
[2020-06-03 22:36:30] [INFO ] [Real]Absence check using 16 positive place invariants in 81 ms returned sat
[2020-06-03 22:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:31] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-03 22:36:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 63 ms returned sat
[2020-06-03 22:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:31] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-06-03 22:36:31] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 7 ms.
[2020-06-03 22:36:31] [INFO ] Added : 16 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-06-03 22:36:31] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2020-06-03 22:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:36:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2020-06-03 22:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:31] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-03 22:36:31] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 3 ms.
[2020-06-03 22:36:31] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
[2020-06-03 22:36:31] [INFO ] Flatten gal took : 50 ms
[2020-06-03 22:36:31] [INFO ] Flatten gal took : 13 ms
[2020-06-03 22:36:31] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2020-06-03 22:36:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-007007 @ 3570 seconds

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

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

FORMULA n0-CTLCardinality-12 TRUE 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

FORMULA n0-CTLCardinality-07 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-08 TRUE 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-11 TRUE 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-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA n0-CTLCardinality-02 CANNOT_COMPUTE 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-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1462
rslt: Output for CTLCardinality @ RefineWMG-PT-007007

{
"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:31 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p17 + 1 <= p4) AND (1 <= p38))",
"processed_size": 32,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 ((((1 <= p18) AND (p11 <= p18)) OR (2 <= p20))))",
"processed_size": 54,
"rewrites": 24
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 266
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF((((p13 <= 2) AND (2 <= p18) AND (1 <= p29)) AND EX((2 <= p37))))",
"processed_size": 67,
"rewrites": 25
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 60773376,
"markings": 38673993,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 287
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p17)))",
"processed_size": 18,
"rewrites": 25
},
"result":
{
"edges": 7,
"markings": 8,
"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": 316
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((3 <= p16) AND (2 <= p6))))",
"processed_size": 34,
"rewrites": 25
},
"result":
{
"edges": 37,
"markings": 38,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((p32 <= 2) AND (p37 <= 0)) OR (1 <= p5))))",
"processed_size": 51,
"rewrites": 24
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 395
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p6 + 1 <= p18) AND (p22 <= 1))))",
"processed_size": 40,
"rewrites": 24
},
"result":
{
"edges": 29,
"markings": 26,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 451
},
"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 (((p26 <= 0) AND ((p22 <= 0) OR (p12 + 1 <= p37)))))",
"processed_size": 58,
"rewrites": 24
},
"result":
{
"edges": 49,
"markings": 50,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 527
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p22 + 1 <= p8)",
"processed_size": 15,
"rewrites": 26
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1271
},
"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 (((p16 <= 1) AND (p29 <= 1))))",
"processed_size": 35,
"rewrites": 24
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((3 <= p37)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3900,
"runtime": 2108.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(**)) OR (** AND (E(X(**)) AND (A(F(**)) OR **)))) : E(F(A(X(**)))) : A((** U A(G(**)))) : (E(F(*)) OR (A(G(**)) AND A(X(**)))) : (E(G(**)) AND (A(G(**)) OR E(F(*)))) : E(X(E((** U **)))) : E(F(*)) : A(G(**)) : E(F(*)) : E(F(**)) : A(G(**)) : E(F(E(G(*)))) : E(F((** AND E(X(**))))) : A((** U A(G(**)))) : (A(G(**)) OR E(F(*))) : A(F((** OR A(G(**)))))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 24,
"places": 39,
"places_significant": 23,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "yes unknown unknown yes yes unknown yes no yes yes no yes yes unknown yes unknown ",
"value": "yes unknown unknown yes yes unknown yes no yes yes no yes yes unknown 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 (F ((((1 <= p18) AND (p11 <= p18)) OR (2 <= p20)))) OR ((((p17 + 1 <= p4) AND (1 <= p38)) AND E (X ((p2 <= p9)))) AND (A (F ((p33 <= p6))) OR (3 <= p25)))) : E (F (A (X (((p2 <= p34) OR (3 <= p34)))))) : A ((((3 <= p17) AND ((2 <= p5) OR (1 <= p9))) U A (G ((p20 <= p36))))) : (NOT(A (G ((1 <= p1)))) OR (A (G (((p25 <= p29) OR (2 <= p8)))) AND A (X ((3 <= p23))))) : (E (G (E (G ((3 <= p37))))) AND (A (G (((p16 <= p8) OR (p7 <= p22)))) OR NOT(A (G ((1 <= p12)))))) : E (X (E (((1 <= p0) U (3 <= p19))))) : NOT(A (G ((((3 <= p32) OR (1 <= p37)) AND (p5 <= 0))))) : A (G (E (G (((3 <= p16) AND (2 <= p6)))))) : NOT(A (G (((p18 <= p6) OR (2 <= p22))))) : E (F (((p26 <= 0) AND ((p22 <= 0) OR (p12 + 1 <= p37))))) : A (G ((1 <= p17))) : NOT(A (G (A (F ((p8 <= p22)))))) : E (F ((((p13 <= 2) AND (2 <= p18) AND (1 <= p29)) AND E (X ((2 <= p37)))))) : A (((p3 <= 0) U A (G ((p14 <= p26))))) : (A (G (((p19 <= 2) OR (p4 + 1 <= p22)))) OR NOT(A (G (((2 <= p16) OR (2 <= p29)))))) : A (F ((((p11 <= 0) OR (p12 <= p23) OR (2 <= p13)) OR A (G ((1 <= p26))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:461
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p18) AND (p11 <= p18)) OR (2 <= p20)))) OR (((p17 + 1 <= p4) AND (1 <= p38)) AND (E (X ((p2 <= p9))) AND (A (F ((p33 <= p6))) OR (3 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p25)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p17 + 1 <= p4) AND (1 <= p38))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p17 + 1 <= p4) AND (1 <= p38))
lola: processed formula length: 32
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p18) AND (p11 <= p18)) OR (2 <= p20))))
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 ((((1 <= p18) AND (p11 <= p18)) OR (2 <= p20))))
lola: processed formula length: 54
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)
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: (((1 <= p18) AND (p11 <= p18)) OR (2 <= p20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
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: E (F (A (X (((p2 <= p34) OR (3 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p2 <= p34) OR (3 <= p34))))
lola: processed formula length: 36
lola: 25 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).
sara: try reading problem file CTLCardinality-2-0.sara.

lola: 4857380 markings, 7632994 edges, 971476 markings/sec, 0 secs
lola: 8958227 markings, 14077180 edges, 820169 markings/sec, 5 secs
lola: 13530988 markings, 21262946 edges, 914552 markings/sec, 10 secs
lola: 18103103 markings, 28447700 edges, 914423 markings/sec, 15 secs
lola: 22584234 markings, 35489473 edges, 896226 markings/sec, 20 secs
lola: 27418583 markings, 43086690 edges, 966870 markings/sec, 25 secs
lola: 32164821 markings, 50544675 edges, 949248 markings/sec, 30 secs
lola: 36927652 markings, 58029123 edges, 952566 markings/sec, 35 secs
lola: 41740012 markings, 65591387 edges, 962472 markings/sec, 40 secs
lola: 46424230 markings, 72952300 edges, 936844 markings/sec, 45 secs
lola: 50939905 markings, 80048360 edges, 903135 markings/sec, 50 secs
lola: 55357205 markings, 86989827 edges, 883460 markings/sec, 55 secs
lola: 59776898 markings, 93935064 edges, 883939 markings/sec, 60 secs
lola: 64526320 markings, 101398432 edges, 949884 markings/sec, 65 secs
lola: 68085438 markings, 106992462 edges, 711824 markings/sec, 70 secs
lola: 71568808 markings, 112465414 edges, 696674 markings/sec, 75 secs
lola: 75234089 markings, 118225147 edges, 733056 markings/sec, 80 secs
lola: 78592474 markings, 123502370 edges, 671677 markings/sec, 85 secs
lola: 82356543 markings, 129417846 edges, 752814 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p1 <= 0))) OR (A (G (((p25 <= p29) OR (2 <= p8)))) AND A (X ((3 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p1 <= 0)))
lola: processed formula length: 17
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)
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: (p1 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= p0) U (3 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((1 <= p0) U (3 <= p19)))))
lola: processed formula length: 36
lola: 26 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 / EXEU)
lola: state space: using reachability graph (EXEU 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p19)
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: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 5661835 markings, 8897143 edges, 1132367 markings/sec, 0 secs
lola: sara is running 5 secs || 10993733 markings, 17275835 edges, 1066380 markings/sec, 5 secs
lola: sara is running 10 secs || 16340878 markings, 25678496 edges, 1069429 markings/sec, 10 secs
lola: sara is running 15 secs || 21739282 markings, 34161689 edges, 1079681 markings/sec, 15 secs
lola: sara is running 20 secs || 27172010 markings, 42698835 edges, 1086546 markings/sec, 20 secs
lola: sara is running 25 secs || 32462112 markings, 51011853 edges, 1058020 markings/sec, 25 secs
lola: sara is running 30 secs || 37979602 markings, 59682177 edges, 1103498 markings/sec, 30 secs
lola: sara is running 35 secs || 43400714 markings, 68201067 edges, 1084222 markings/sec, 35 secs
lola: sara is running 40 secs || 48834007 markings, 76739098 edges, 1086659 markings/sec, 40 secs
lola: sara is running 45 secs || 54171063 markings, 85125905 edges, 1067411 markings/sec, 45 secs
lola: sara is running 50 secs || 59728178 markings, 93858501 edges, 1111423 markings/sec, 50 secs
lola: sara is running 55 secs || 65187016 markings, 102436672 edges, 1091768 markings/sec, 55 secs
lola: sara is running 60 secs || 70731746 markings, 111149820 edges, 1108946 markings/sec, 60 secs
lola: sara is running 65 secs || 76254650 markings, 119828647 edges, 1104581 markings/sec, 65 secs
lola: sara is running 70 secs || 81744870 markings, 128456144 edges, 1098044 markings/sec, 70 secs
lola: sara is running 75 secs || 86998604 markings, 136712009 edges, 1050747 markings/sec, 75 secs
lola: sara is running 80 secs || 92424298 markings, 145238102 edges, 1085139 markings/sec, 80 secs
lola: sara is running 85 secs || 97885957 markings, 153820705 edges, 1092332 markings/sec, 85 secs
lola: sara is running 90 secs || 103462145 markings, 162583273 edges, 1115238 markings/sec, 90 secs
lola: sara is running 95 secs || 108725025 markings, 170853512 edges, 1052576 markings/sec, 95 secs
lola: sara is running 100 secs || 114230283 markings, 179504629 edges, 1101052 markings/sec, 100 secs
lola: sara is running 105 secs || 119527502 markings, 187828826 edges, 1059444 markings/sec, 105 secs
lola: sara is running 110 secs || 124992305 markings, 196416368 edges, 1092961 markings/sec, 110 secs
lola: sara is running 115 secs || 130566045 markings, 205175103 edges, 1114748 markings/sec, 115 secs
lola: sara is running 120 secs || 135796592 markings, 213394527 edges, 1046109 markings/sec, 120 secs
lola: sara is running 125 secs || 135970191 markings, 213667332 edges, 34720 markings/sec, 125 secs
lola: sara is running 130 secs || 136002959 markings, 213718824 edges, 6554 markings/sec, 130 secs
lola: sara is running 135 secs || 137235669 markings, 215655938 edges, 246542 markings/sec, 135 secs
lola: sara is running 140 secs || 137487463 markings, 216051610 edges, 50359 markings/sec, 140 secs
lola: sara is running 145 secs || 140767030 markings, 221205213 edges, 655913 markings/sec, 145 secs
lola: sara is running 150 secs || 142503109 markings, 223933329 edges, 347216 markings/sec, 150 secs
lola: sara is running 155 secs || 142503109 markings, 223933329 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 142530612 markings, 223976553 edges, 5501 markings/sec, 160 secs
lola: sara is running 165 secs || 144412560 markings, 226933895 edges, 376390 markings/sec, 165 secs
lola: sara is running 170 secs || 145168021 markings, 228121053 edges, 151092 markings/sec, 170 secs
lola: sara is running 175 secs || 147013252 markings, 231020695 edges, 369046 markings/sec, 175 secs
lola: sara is running 180 secs || 147232808 markings, 231365719 edges, 43911 markings/sec, 180 secs
lola: sara is running 185 secs || 147251515 markings, 231395113 edges, 3741 markings/sec, 185 secs
lola: sara is running 190 secs || 150463481 markings, 236442484 edges, 642393 markings/sec, 190 secs
lola: sara is running 195 secs || 150600572 markings, 236657911 edges, 27418 markings/sec, 195 secs
lola: sara is running 200 secs || 150600572 markings, 236657911 edges, 0 markings/sec, 200 secs
lola: sara is running 205 secs || 150636658 markings, 236714612 edges, 7217 markings/sec, 205 secs
lola: sara is running 210 secs || 153205531 markings, 240751424 edges, 513775 markings/sec, 210 secs
lola: sara is running 215 secs || 153205531 markings, 240751424 edges, 0 markings/sec, 215 secs
lola: sara is running 220 secs || 155595724 markings, 244507439 edges, 478039 markings/sec, 220 secs
lola: sara is running 225 secs || 158197788 markings, 248596395 edges, 520413 markings/sec, 225 secs
lola: sara is running 230 secs || 158197788 markings, 248596395 edges, 0 markings/sec, 230 secs
lola: sara is running 235 secs || 158197788 markings, 248596395 edges, 0 markings/sec, 235 secs
lola: sara is running 240 secs || 158223746 markings, 248637181 edges, 5192 markings/sec, 240 secs
lola: sara is running 245 secs || 158862452 markings, 249640862 edges, 127741 markings/sec, 245 secs
lola: sara is running 250 secs || 161717558 markings, 254127461 edges, 571021 markings/sec, 250 secs
lola: sara is running 255 secs || 161717558 markings, 254127461 edges, 0 markings/sec, 255 secs
lola: sara is running 260 secs || 161717558 markings, 254127461 edges, 0 markings/sec, 260 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 15824328 KB
lola: time consumption: 368 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p13 <= 2) AND (2 <= p18) AND (1 <= p29)) AND E (X ((2 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((p13 <= 2) AND (2 <= p18) AND (1 <= p29)) AND EX((2 <= p37))))
lola: processed formula length: 67
lola: 25 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: 6019548 markings, 9459259 edges, 1203910 markings/sec, 0 secs
lola: 16900011 markings, 26557127 edges, 2176093 markings/sec, 5 secs
lola: 22156030 markings, 34816583 edges, 1051204 markings/sec, 10 secs
lola: 27675684 markings, 43490357 edges, 1103931 markings/sec, 15 secs
lola: 33109771 markings, 52029597 edges, 1086817 markings/sec, 20 secs
lola: 38673993 markings, 60773376 edges, 1112844 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 38673993 markings, 60773376 edges
lola: ========================================
lola: subprocess 5 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p17)))
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 <= p17)))
lola: processed formula length: 18
lola: 25 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: (p17 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p16) AND (2 <= p6))))
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 (((3 <= p16) AND (2 <= p6))))
lola: processed formula length: 34
lola: 25 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: ((p16 <= 2) OR (p6 <= 1))
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: 38 markings, 37 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-6-0.sara.
sara: try reading problem file CTLCardinality-5-0.sara.
lola: ...considering subproblem: E (F ((((p32 <= 2) AND (p37 <= 0)) OR (1 <= p5))))
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 ((((p32 <= 2) AND (p37 <= 0)) OR (1 <= p5))))
lola: processed formula length: 51
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)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
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: (((p32 <= 2) AND (p37 <= 0)) OR (1 <= p5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p6 + 1 <= p18) AND (p22 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p6 + 1 <= p18) AND (p22 <= 1))))
lola: processed formula length: 40
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)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 29 edges
lola: ========================================

lola: subprocess 9 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================

lola: ...considering subproblem: E (F (((p26 <= 0) AND ((p22 <= 0) OR (p12 + 1 <= p37)))))
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 (((p26 <= 0) AND ((p22 <= 0) OR (p12 + 1 <= p37)))))
lola: processed formula length: 58
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)
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: ((p26 <= 0) AND ((p22 <= 0) OR (p12 + 1 <= p37)))
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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 10 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p22 + 1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p22 + 1 <= p8)
lola: processed formula length: 15
lola: 26 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 11 will run for 632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p3 <= 0) U A (G ((p14 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((p3 <= 0) U AG((p14 <= p26)))
lola: processed formula length: 31
lola: 25 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: 5831494 markings, 9163738 edges, 1166299 markings/sec, 0 secs
lola: 11230507 markings, 17647916 edges, 1079803 markings/sec, 5 secs
lola: 16559712 markings, 26022373 edges, 1065841 markings/sec, 10 secs
lola: 21809602 markings, 34272199 edges, 1049978 markings/sec, 15 secs
lola: 27309601 markings, 42915047 edges, 1100000 markings/sec, 20 secs
lola: 32832912 markings, 51594534 edges, 1104662 markings/sec, 25 secs
lola: 38393914 markings, 60333249 edges, 1112200 markings/sec, 30 secs
lola: 43723885 markings, 68708902 edges, 1065994 markings/sec, 35 secs
lola: 48821853 markings, 76719996 edges, 1019594 markings/sec, 40 secs
lola: 53822662 markings, 84578410 edges, 1000162 markings/sec, 45 secs
lola: 58712125 markings, 92261850 edges, 977893 markings/sec, 50 secs
lola: 63977089 markings, 100535352 edges, 1052993 markings/sec, 55 secs
lola: 69193155 markings, 108732027 edges, 1043213 markings/sec, 60 secs
lola: 74484257 markings, 117046616 edges, 1058220 markings/sec, 65 secs
lola: 80027118 markings, 125756812 edges, 1108572 markings/sec, 70 secs
lola: 85292725 markings, 134031338 edges, 1053121 markings/sec, 75 secs
lola: 90710694 markings, 142545285 edges, 1083594 markings/sec, 80 secs
lola: 94170243 markings, 147982474 edges, 691910 markings/sec, 85 secs
lola: 98409226 markings, 154651223 edges, 847797 markings/sec, 90 secs
lola: 98511867 markings, 154804268 edges, 20528 markings/sec, 95 secs
lola: 98511867 markings, 154804268 edges, 0 markings/sec, 100 secs
lola: 98511867 markings, 154804268 edges, 0 markings/sec, 105 secs
lola: 98511867 markings, 154804268 edges, 0 markings/sec, 110 secs
lola: 99853688 markings, 156912836 edges, 268364 markings/sec, 115 secs
lola: 101477466 markings, 159464486 edges, 324756 markings/sec, 120 secs
lola: 101477466 markings, 159464486 edges, 0 markings/sec, 125 secs
lola: 101950073 markings, 160207159 edges, 94521 markings/sec, 130 secs
lola: 106630553 markings, 167562199 edges, 936096 markings/sec, 135 secs
lola: 111257440 markings, 174833015 edges, 925377 markings/sec, 140 secs
lola: 114967663 markings, 180663365 edges, 742045 markings/sec, 145 secs
lola: 114999417 markings, 180713262 edges, 6351 markings/sec, 150 secs
lola: 114999417 markings, 180713262 edges, 0 markings/sec, 155 secs
lola: 114999417 markings, 180713262 edges, 0 markings/sec, 160 secs
lola: 114999417 markings, 180713262 edges, 0 markings/sec, 165 secs
lola: 115258684 markings, 181120683 edges, 51853 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p17) AND ((2 <= p5) OR (1 <= p9))) U A (G ((p20 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((3 <= p17) AND ((2 <= p5) OR (1 <= p9))) U AG((p20 <= p36)))
lola: processed formula length: 64
lola: 25 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: 5976500 markings, 9391613 edges, 1195300 markings/sec, 0 secs
lola: 11601766 markings, 18231313 edges, 1125053 markings/sec, 5 secs
lola: 17200019 markings, 27028565 edges, 1119651 markings/sec, 10 secs
lola: 22533990 markings, 35410516 edges, 1066794 markings/sec, 15 secs
lola: 28359413 markings, 44564748 edges, 1165085 markings/sec, 20 secs
lola: 34005392 markings, 53437001 edges, 1129196 markings/sec, 25 secs
lola: 39749430 markings, 62463338 edges, 1148808 markings/sec, 30 secs
lola: 45294663 markings, 71177276 edges, 1109047 markings/sec, 35 secs
lola: 50592918 markings, 79503098 edges, 1059651 markings/sec, 40 secs
lola: 55656038 markings, 87459432 edges, 1012624 markings/sec, 45 secs
lola: 60752788 markings, 95468601 edges, 1019350 markings/sec, 50 secs
lola: 66234925 markings, 104083381 edges, 1096427 markings/sec, 55 secs
lola: 71499748 markings, 112356678 edges, 1052965 markings/sec, 60 secs
lola: 76931005 markings, 120891496 edges, 1086251 markings/sec, 65 secs
lola: 82481244 markings, 129613290 edges, 1110048 markings/sec, 70 secs
lola: 87799689 markings, 137970852 edges, 1063689 markings/sec, 75 secs
lola: 92889888 markings, 145969737 edges, 1018040 markings/sec, 80 secs
lola: 96992961 markings, 152427952 edges, 820615 markings/sec, 85 secs
lola: 97059739 markings, 152522354 edges, 13356 markings/sec, 90 secs
lola: 97059739 markings, 152522354 edges, 0 markings/sec, 95 secs
lola: 97341453 markings, 152965051 edges, 56343 markings/sec, 100 secs
lola: 100680044 markings, 158211397 edges, 667718 markings/sec, 105 secs
lola: 104191514 markings, 163729424 edges, 702294 markings/sec, 110 secs
lola: 108594175 markings, 170647892 edges, 880532 markings/sec, 115 secs
lola: 111856609 markings, 175774627 edges, 652487 markings/sec, 120 secs
lola: 111885871 markings, 175820553 edges, 5852 markings/sec, 125 secs
lola: 111885871 markings, 175820553 edges, 0 markings/sec, 130 secs
lola: 111885871 markings, 175820553 edges, 0 markings/sec, 135 secs
lola: 114130335 markings, 179347560 edges, 448893 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 913 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p11 <= 0) OR (p12 <= p23) OR (2 <= p13)) OR A (G ((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((p11 <= 0) OR (p12 <= p23) OR (2 <= p13)) OR AG((1 <= p26))))
lola: processed formula length: 68
lola: 25 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: 6166660 markings, 9690430 edges, 1233332 markings/sec, 0 secs
lola: 11913823 markings, 18721693 edges, 1149433 markings/sec, 5 secs
lola: 17588914 markings, 27639691 edges, 1135018 markings/sec, 10 secs
lola: 23132690 markings, 36351336 edges, 1108755 markings/sec, 15 secs
lola: 29021542 markings, 45605239 edges, 1177770 markings/sec, 20 secs
lola: 34959850 markings, 54936869 edges, 1187662 markings/sec, 25 secs
lola: 40980663 markings, 64398126 edges, 1204163 markings/sec, 30 secs
lola: 46590523 markings, 73213617 edges, 1121972 markings/sec, 35 secs
lola: 51796890 markings, 81395053 edges, 1041273 markings/sec, 40 secs
lola: 57271173 markings, 89997501 edges, 1094857 markings/sec, 45 secs
lola: 62960818 markings, 98938354 edges, 1137929 markings/sec, 50 secs
lola: 68615431 markings, 107824179 edges, 1130923 markings/sec, 55 secs
lola: 74201330 markings, 116602025 edges, 1117180 markings/sec, 60 secs
lola: 80085031 markings, 125847815 edges, 1176740 markings/sec, 65 secs
lola: 85716440 markings, 134697174 edges, 1126282 markings/sec, 70 secs
lola: 91197856 markings, 143310833 edges, 1096283 markings/sec, 75 secs
lola: 93129971 markings, 146398611 edges, 386423 markings/sec, 80 secs
lola: 97876379 markings, 153806276 edges, 949282 markings/sec, 85 secs
lola: 98029499 markings, 154046263 edges, 30624 markings/sec, 90 secs
lola: 98030523 markings, 154047873 edges, 205 markings/sec, 95 secs
lola: 98030523 markings, 154047873 edges, 0 markings/sec, 100 secs
lola: 98030523 markings, 154047873 edges, 0 markings/sec, 105 secs
lola: 98030523 markings, 154047873 edges, 0 markings/sec, 110 secs
lola: 102025947 markings, 160326685 edges, 799085 markings/sec, 115 secs
lola: 102410566 markings, 160930787 edges, 76924 markings/sec, 120 secs
lola: 102410566 markings, 160930787 edges, 0 markings/sec, 125 secs
lola: 102410566 markings, 160930787 edges, 0 markings/sec, 130 secs
lola: 102410566 markings, 160930787 edges, 0 markings/sec, 135 secs
lola: 103806803 markings, 163124879 edges, 279247 markings/sec, 140 secs
lola: 107295992 markings, 168607883 edges, 697838 markings/sec, 145 secs
lola: 107295992 markings, 168607883 edges, 0 markings/sec, 150 secs
lola: 109531704 markings, 172121150 edges, 447142 markings/sec, 155 secs
lola: 112612083 markings, 176961733 edges, 616076 markings/sec, 160 secs
lola: 112612083 markings, 176961733 edges, 0 markings/sec, 165 secs
lola: 112671361 markings, 177054888 edges, 11856 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p19 <= 2) OR (p4 + 1 <= p22)))) OR E (F (((p16 <= 1) AND (p29 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p16 <= 1) AND (p29 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p16 <= 1) AND (p29 <= 1))))
lola: processed formula length: 35
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)
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: ((p16 <= 1) AND (p29 <= 1))
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: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

lola: subprocess 15 will run for 2542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((3 <= p37))) AND (A (G (((p16 <= p8) OR (p7 <= p22)))) OR E (F ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p12 <= 0)))
lola: processed formula length: 18
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)
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: (p12 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
sara: try reading problem file CTLCardinality-15-0.sara.
lola: ========================================
lola: ========================================

lola: ...considering subproblem: E (F (A (X (((p2 <= p34) OR (3 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p2 <= p34) OR (3 <= p34))))
lola: processed formula length: 36
lola: 25 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: 5184967 markings, 8147772 edges, 1036993 markings/sec, 0 secs
lola: 10050897 markings, 15794234 edges, 973186 markings/sec, 5 secs
lola: 14907345 markings, 23425793 edges, 971290 markings/sec, 10 secs
lola: 19780026 markings, 31082868 edges, 974536 markings/sec, 15 secs
lola: 24569661 markings, 38609430 edges, 957927 markings/sec, 20 secs
lola: 29768173 markings, 46778515 edges, 1039702 markings/sec, 25 secs
lola: 34780637 markings, 54655244 edges, 1002493 markings/sec, 30 secs
lola: 39741078 markings, 62450211 edges, 992088 markings/sec, 35 secs
lola: 44711109 markings, 70260259 edges, 994006 markings/sec, 40 secs
lola: 49392075 markings, 77616058 edges, 936193 markings/sec, 45 secs
lola: 53985156 markings, 84833752 edges, 918616 markings/sec, 50 secs
lola: 58703332 markings, 92248028 edges, 943635 markings/sec, 55 secs
lola: 63742637 markings, 100166928 edges, 1007861 markings/sec, 60 secs
lola: 67025138 markings, 105325144 edges, 656500 markings/sec, 65 secs
lola: 69406722 markings, 109101704 edges, 476317 markings/sec, 70 secs
lola: 69494859 markings, 109206139 edges, 17627 markings/sec, 75 secs
lola: 69494859 markings, 109206139 edges, 0 markings/sec, 80 secs
lola: 69992383 markings, 109987959 edges, 99505 markings/sec, 85 secs
lola: 73888572 markings, 116135122 edges, 779238 markings/sec, 90 secs
lola: 77303810 markings, 121484887 edges, 683048 markings/sec, 95 secs
lola: 80580482 markings, 126626883 edges, 655334 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= p0) U (3 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((1 <= p0) U (3 <= p19)))))
lola: processed formula length: 36
lola: 26 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 / EXEU)
lola: state space: using reachability graph (EXEU 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p19)
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-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 5608854 markings, 8813882 edges, 1121771 markings/sec, 0 secs
lola: sara is running 5 secs || 10964708 markings, 17230226 edges, 1071171 markings/sec, 5 secs
lola: sara is running 10 secs || 16261839 markings, 25554287 edges, 1059426 markings/sec, 10 secs
lola: sara is running 15 secs || 21629893 markings, 33989793 edges, 1073611 markings/sec, 15 secs
lola: sara is running 20 secs || 27032400 markings, 42479446 edges, 1080501 markings/sec, 20 secs
lola: sara is running 25 secs || 32329142 markings, 50802904 edges, 1059348 markings/sec, 25 secs
lola: sara is running 30 secs || 37887078 markings, 59536779 edges, 1111587 markings/sec, 30 secs
lola: sara is running 35 secs || 43257025 markings, 67975270 edges, 1073989 markings/sec, 35 secs
lola: sara is running 40 secs || 48619512 markings, 76402035 edges, 1072497 markings/sec, 40 secs
lola: sara is running 45 secs || 53926174 markings, 84741073 edges, 1061332 markings/sec, 45 secs
lola: sara is running 50 secs || 59384051 markings, 93317728 edges, 1091575 markings/sec, 50 secs
lola: sara is running 55 secs || 64828753 markings, 101873691 edges, 1088940 markings/sec, 55 secs
lola: sara is running 60 secs || 70344609 markings, 110541459 edges, 1103171 markings/sec, 60 secs
lola: sara is running 65 secs || 75823116 markings, 119150528 edges, 1095701 markings/sec, 65 secs
lola: sara is running 70 secs || 81278432 markings, 127723169 edges, 1091063 markings/sec, 70 secs
lola: sara is running 75 secs || 86458286 markings, 135862943 edges, 1035971 markings/sec, 75 secs
lola: sara is running 80 secs || 91755359 markings, 144186912 edges, 1059415 markings/sec, 80 secs
lola: sara is running 85 secs || 97179545 markings, 152710624 edges, 1084837 markings/sec, 85 secs
lola: sara is running 90 secs || 102628091 markings, 161272610 edges, 1089709 markings/sec, 90 secs
lola: sara is running 95 secs || 107985730 markings, 169691754 edges, 1071528 markings/sec, 95 secs
lola: sara is running 100 secs || 113405829 markings, 178209062 edges, 1084020 markings/sec, 100 secs
lola: sara is running 105 secs || 118571029 markings, 186325799 edges, 1033040 markings/sec, 105 secs
lola: sara is running 110 secs || 124154279 markings, 195099475 edges, 1116650 markings/sec, 110 secs
lola: sara is running 115 secs || 129711549 markings, 203832326 edges, 1111454 markings/sec, 115 secs
lola: sara is running 120 secs || 134777787 markings, 211793554 edges, 1013248 markings/sec, 120 secs
lola: sara is running 125 secs || 136252470 markings, 214110908 edges, 294937 markings/sec, 125 secs
lola: sara is running 130 secs || 139631672 markings, 219421080 edges, 675840 markings/sec, 130 secs
lola: sara is running 135 secs || 144449187 markings, 226991455 edges, 963503 markings/sec, 135 secs
lola: sara is running 140 secs || 146398912 markings, 230055307 edges, 389945 markings/sec, 140 secs
lola: sara is running 145 secs || 148496533 markings, 233351569 edges, 419524 markings/sec, 145 secs
lola: sara is running 150 secs || 150566889 markings, 236604981 edges, 414071 markings/sec, 150 secs
lola: sara is running 155 secs || 150566889 markings, 236604981 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 152725124 markings, 239996492 edges, 431647 markings/sec, 160 secs
lola: sara is running 165 secs || 155400875 markings, 244201247 edges, 535150 markings/sec, 165 secs
lola: sara is running 170 secs || 159182564 markings, 250143899 edges, 756338 markings/sec, 170 secs
lola: sara is running 175 secs || 163861076 markings, 257495848 edges, 935702 markings/sec, 175 secs
lola: sara is running 180 secs || 164147773 markings, 257946373 edges, 57339 markings/sec, 180 secs
lola: sara is running 185 secs || 164147773 markings, 257946373 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || 164147773 markings, 257946373 edges, 0 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (((p3 <= 0) U A (G ((p14 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((p3 <= 0) U AG((p14 <= p26)))
lola: processed formula length: 31
lola: 25 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: 5570139 markings, 8753043 edges, 1114028 markings/sec, 0 secs
lola: 10796879 markings, 16966491 edges, 1045348 markings/sec, 5 secs
lola: 15854860 markings, 24914755 edges, 1011596 markings/sec, 10 secs
lola: 20758407 markings, 32620319 edges, 980709 markings/sec, 15 secs
lola: 25875874 markings, 40662046 edges, 1023493 markings/sec, 20 secs
lola: 31326934 markings, 49227995 edges, 1090212 markings/sec, 25 secs
lola: 36692441 markings, 57659510 edges, 1073101 markings/sec, 30 secs
lola: 42068720 markings, 66107930 edges, 1075256 markings/sec, 35 secs
lola: 47167182 markings, 74119796 edges, 1019692 markings/sec, 40 secs
lola: 52033288 markings, 81766540 edges, 973221 markings/sec, 45 secs
lola: 57012398 markings, 89590846 edges, 995822 markings/sec, 50 secs
lola: 62108496 markings, 97598994 edges, 1019220 markings/sec, 55 secs
lola: 67600115 markings, 106228681 edges, 1098324 markings/sec, 60 secs
lola: 72513608 markings, 113949885 edges, 982699 markings/sec, 65 secs
lola: 77753061 markings, 122183291 edges, 1047891 markings/sec, 70 secs
lola: 83020318 markings, 130460413 edges, 1053451 markings/sec, 75 secs
lola: 88163115 markings, 138541945 edges, 1028559 markings/sec, 80 secs
lola: 93204324 markings, 146464022 edges, 1008242 markings/sec, 85 secs
lola: 93875109 markings, 147520200 edges, 134157 markings/sec, 90 secs
lola: 94823280 markings, 149007920 edges, 189634 markings/sec, 95 secs
lola: 97261792 markings, 152841941 edges, 487702 markings/sec, 100 secs
lola: 99805569 markings, 156837225 edges, 508755 markings/sec, 105 secs
lola: 101353943 markings, 159270381 edges, 309675 markings/sec, 110 secs
lola: 101535696 markings, 159555992 edges, 36351 markings/sec, 115 secs
lola: 101535696 markings, 159555992 edges, 0 markings/sec, 120 secs
lola: 103973791 markings, 163387287 edges, 487619 markings/sec, 125 secs
lola: 104921985 markings, 164877311 edges, 189639 markings/sec, 130 secs
lola: 104921985 markings, 164877311 edges, 0 markings/sec, 135 secs
lola: 104921985 markings, 164877311 edges, 0 markings/sec, 140 secs
lola: 106735340 markings, 167726862 edges, 362671 markings/sec, 145 secs
lola: 108836761 markings, 171029096 edges, 420284 markings/sec, 150 secs
lola: 108836761 markings, 171029096 edges, 0 markings/sec, 155 secs
lola: 108836761 markings, 171029096 edges, 0 markings/sec, 160 secs
lola: 110513066 markings, 173663286 edges, 335261 markings/sec, 165 secs
lola: 112273417 markings, 176429551 edges, 352070 markings/sec, 170 secs
lola: 112273417 markings, 176429551 edges, 0 markings/sec, 175 secs
lola: 112273417 markings, 176429551 edges, 0 markings/sec, 180 secs
lola: 114723703 markings, 180279991 edges, 490057 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p17) AND ((2 <= p5) OR (1 <= p9))) U A (G ((p20 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((3 <= p17) AND ((2 <= p5) OR (1 <= p9))) U AG((p20 <= p36)))
lola: processed formula length: 64
lola: 25 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: 5814409 markings, 9136893 edges, 1162882 markings/sec, 0 secs
lola: 11254999 markings, 17686393 edges, 1088118 markings/sec, 5 secs
lola: 16649898 markings, 26164095 edges, 1078980 markings/sec, 10 secs
lola: 21953272 markings, 34497960 edges, 1060675 markings/sec, 15 secs
lola: 27512076 markings, 43233224 edges, 1111761 markings/sec, 20 secs
lola: 33076184 markings, 51976820 edges, 1112822 markings/sec, 25 secs
lola: 38706371 markings, 60824249 edges, 1126037 markings/sec, 30 secs
lola: 44157752 markings, 69390700 edges, 1090276 markings/sec, 35 secs
lola: 49351734 markings, 77552671 edges, 1038796 markings/sec, 40 secs
lola: 54452423 markings, 85568034 edges, 1020138 markings/sec, 45 secs
lola: 59462844 markings, 93441548 edges, 1002084 markings/sec, 50 secs
lola: 64920215 markings, 102017408 edges, 1091474 markings/sec, 55 secs
lola: 70196984 markings, 110309475 edges, 1055354 markings/sec, 60 secs
lola: 75539436 markings, 118704746 edges, 1068490 markings/sec, 65 secs
lola: 80940581 markings, 127192255 edges, 1080229 markings/sec, 70 secs
lola: 86234227 markings, 135510841 edges, 1058729 markings/sec, 75 secs
lola: 91478749 markings, 143752228 edges, 1048904 markings/sec, 80 secs
lola: 94071293 markings, 147828751 edges, 518509 markings/sec, 85 secs
lola: 98294342 markings, 154476677 edges, 844610 markings/sec, 90 secs
lola: 101878145 markings, 160094129 edges, 716761 markings/sec, 95 secs
lola: 106508652 markings, 167371555 edges, 926101 markings/sec, 100 secs
lola: 106758598 markings, 167763409 edges, 49989 markings/sec, 105 secs
lola: 106758598 markings, 167763409 edges, 0 markings/sec, 110 secs
lola: 106758598 markings, 167763409 edges, 0 markings/sec, 115 secs
lola: 106758598 markings, 167763409 edges, 0 markings/sec, 120 secs
lola: 106758598 markings, 167763409 edges, 0 markings/sec, 125 secs
lola: 107523343 markings, 168965156 edges, 152949 markings/sec, 130 secs
lola: 108632070 markings, 170707439 edges, 221745 markings/sec, 135 secs
lola: 108632070 markings, 170707439 edges, 0 markings/sec, 140 secs
lola: 108650131 markings, 170735825 edges, 3612 markings/sec, 145 secs
lola: 112283650 markings, 176445626 edges, 726704 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((((p11 <= 0) OR (p12 <= p23) OR (2 <= p13)) OR A (G ((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((p11 <= 0) OR (p12 <= p23) OR (2 <= p13)) OR AG((1 <= p26))))
lola: processed formula length: 68
lola: 25 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: 5931147 markings, 9320343 edges, 1186229 markings/sec, 0 secs
lola: 11597185 markings, 18224115 edges, 1133208 markings/sec, 5 secs
lola: 16960431 markings, 26652076 edges, 1072649 markings/sec, 10 secs
lola: 22436167 markings, 35256802 edges, 1095147 markings/sec, 15 secs
lola: 27992858 markings, 43988734 edges, 1111338 markings/sec, 20 secs
lola: 33477500 markings, 52607460 edges, 1096928 markings/sec, 25 secs
lola: 39150723 markings, 61522506 edges, 1134645 markings/sec, 30 secs
lola: 44648202 markings, 70161405 edges, 1099496 markings/sec, 35 secs
lola: 49853718 markings, 78341495 edges, 1041103 markings/sec, 40 secs
lola: 54968959 markings, 86379729 edges, 1023048 markings/sec, 45 secs
lola: 59986014 markings, 94263675 edges, 1003411 markings/sec, 50 secs
lola: 65543496 markings, 102996852 edges, 1111496 markings/sec, 55 secs
lola: 70796884 markings, 111252178 edges, 1050678 markings/sec, 60 secs
lola: 76213549 markings, 119764067 edges, 1083333 markings/sec, 65 secs
lola: 81619599 markings, 128259283 edges, 1081210 markings/sec, 70 secs
lola: 86821766 markings, 136434114 edges, 1040433 markings/sec, 75 secs
lola: 91934848 markings, 144468959 edges, 1022616 markings/sec, 80 secs
lola: 93054626 markings, 146228712 edges, 223956 markings/sec, 85 secs
lola: 95176304 markings, 149562912 edges, 424336 markings/sec, 90 secs
lola: 99938376 markings, 157046457 edges, 952414 markings/sec, 95 secs
lola: 103903953 markings, 163279830 edges, 793115 markings/sec, 100 secs
lola: 108367874 markings, 170298685 edges, 892784 markings/sec, 105 secs
lola: 111926657 markings, 175884640 edges, 711757 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (G ((3 <= p37))) AND (A (G (((p16 <= p8) OR (p7 <= p22)))) OR E (F ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p12 <= 0)))
lola: processed formula length: 18
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)
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: (p12 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((3 <= p37)))
lola: processed formula length: 18
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10 markings, 10 edges
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: (p37 <= 2)
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-22-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown unknown yes yes unknown yes no yes yes no yes yes unknown yes unknown
lola:
preliminary result: yes unknown unknown yes yes unknown yes no yes yes no yes yes unknown yes unknown
sara: try reading problem file CTLCardinality-22-0.sara.

lola: memory consumption: 3900 KB
lola: time consumption: 2108 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-007007"
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-007007, 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-158987938400035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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