Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.5K Apr 7 19:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 7 19:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 21:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 21:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 5 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591207920674

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:12:02] [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 18:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:12:02] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2020-06-03 18:12:02] [INFO ] Transformed 1001 places.
[2020-06-03 18:12:02] [INFO ] Transformed 1601 transitions.
[2020-06-03 18:12:02] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 185 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Incomplete random walk after 100010 steps, including 0 resets, run finished after 932 ms. (steps per millisecond=107 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1601 rows 1000 cols
[2020-06-03 18:12:03] [INFO ] Computed 200 place invariants in 50 ms
[2020-06-03 18:12:03] [INFO ] [Real]Absence check using 200 positive place invariants in 120 ms returned sat
[2020-06-03 18:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:06] [INFO ] [Real]Absence check using state equation in 2946 ms returned sat
[2020-06-03 18:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:12:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 99 ms returned sat
[2020-06-03 18:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:26] [INFO ] [Nat]Absence check using state equation in 19818 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:12:26] [INFO ] [Real]Absence check using 200 positive place invariants in 97 ms returned sat
[2020-06-03 18:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:29] [INFO ] [Real]Absence check using state equation in 2846 ms returned sat
[2020-06-03 18:12:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:12:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 99 ms returned sat
[2020-06-03 18:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:12:49] [INFO ] [Nat]Absence check using state equation in 19856 ms returned (error "Failed to check-sat")
[2020-06-03 18:12:50] [INFO ] Flatten gal took : 158 ms
[2020-06-03 18:12:50] [INFO ] Flatten gal took : 56 ms
[2020-06-03 18:12:50] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 18:12:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0200 @ 3570 seconds

FORMULA JoinFreeModules-PT-0200-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2057
rslt: Output for CTLCardinality @ JoinFreeModules-PT-0200

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(((3 <= p186) AND (1 <= p909)))",
"processed_size": 33,
"rewrites": 25
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p84 <= 2) AND (p317 + 1 <= p186)) OR (p636 + 1 <= p922))",
"processed_size": 60,
"rewrites": 27
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p634 <= p162) OR ((p546 <= p253) AND ((3 <= p285) OR (2 <= p772))))))",
"processed_size": 79,
"rewrites": 26
},
"result":
{
"edges": 126,
"markings": 127,
"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": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "(2 <= p821)",
"processed_size": 11,
"rewrites": 28
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G (((p19 <= 1) OR (p771 + 1 <= p878) OR (p971 <= p843))))",
"processed_size": 62,
"rewrites": 25
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 19
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A(((p560 <= p370) OR ((p753 <= p80) AND (3 <= p550))) U EG((p911 <= p141)))",
"processed_size": 76,
"rewrites": 26
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 603,
"markings": 602,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"exit":
{
"localtimelimitreached": false
},
"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 ((1 <= p811)))",
"processed_size": 19,
"rewrites": 25
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2684
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p253 <= p82) OR (p797 <= p79))",
"processed_size": 33,
"rewrites": 27
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2684
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((2 <= p427) AND (p954 <= p724))",
"processed_size": 32,
"rewrites": 27
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3500,
"runtime": 1512.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : (A(F(**)) AND (** OR A(G(**)))) : (E(G(**)) AND A(F(**))) : (A(F(**)) OR (E(X(**)) AND A(X(**)))) : E(F((E(G(**)) AND **))) : (A(F(*)) OR A(G(*))) : A(F(A(G(**)))) : E(G(*)) : A(G(**)) : A(G(A(F(*)))) : E(G(E((** U **)))) : (E(X(**)) AND A(F(**))) : A((** U E(G(**)))) : (A(F(**)) AND (** OR A(F(*)))) : A(X(E(F(*)))) : A(X(A(F(**))))"
},
"net":
{
"arcs": 4600,
"conflict_clusters": 801,
"places": 1000,
"places_significant": 800,
"singleton_clusters": 0,
"transitions": 1601
},
"result":
{
"preliminary_value": "yes no yes no unknown no no yes no no unknown no yes no unknown no ",
"value": "yes no yes no unknown no no yes no no unknown no yes no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32000
lola: finding significant places
lola: 1000 places, 1601 transitions, 800 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 ((3 <= p451))) : (A (F (((p427 <= 1) OR (p724 + 1 <= p954)))) AND ((p476 <= p584) OR A (G (((p601 <= p607) AND (p43 <= p377)))))) : (E (G (E (G ((1 <= p811))))) AND A (F ((p703 <= p56)))) : (A (F (A (F ((2 <= p89))))) OR (E (X ((p235 + 1 <= p208))) AND A (X (((3 <= p186) AND (1 <= p909)))))) : E (F ((E (G ((p225 <= p857))) AND ((p920 + 1 <= p788) OR (p892 + 1 <= p609))))) : (NOT(E (G (((p253 <= p82) OR (p797 <= p79))))) OR NOT(E (F (((p479 <= p647) OR (p51 <= p222)))))) : A (F (A (G (((3 <= p955) AND (3 <= p379)))))) : NOT(A (F (((2 <= p19) AND (p878 <= p771) AND (p843 + 1 <= p971))))) : A (G (((p634 <= p162) OR ((p546 <= p253) AND ((3 <= p285) OR (2 <= p772)))))) : NOT(E (F (E (G ((2 <= p821)))))) : E (G (E (((p736 <= p307) U (p417 <= p130))))) : (E (X (((p798 + 1 <= p266) OR (p196 <= p535)))) AND A (F ((((3 <= p84) OR (p186 <= p317)) AND (p922 <= p636))))) : A ((((p560 <= p370) OR ((p753 <= p80) AND (3 <= p550))) U E (G ((p911 <= p141))))) : (A (F ((3 <= p549))) AND ((p770 + 1 <= p899) OR NOT(E (G ((1 <= p654)))))) : NOT(E (X (A (G ((p903 <= p705)))))) : A (X (A (F (((3 <= p750) AND (p543 <= p710))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= p89))) OR (E (X ((p235 + 1 <= p208))) AND A (X (((3 <= p186) AND (1 <= p909))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p89)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p89 <= 1)
lola: processed formula length: 10
lola: 27 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p89)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p186) AND (1 <= p909))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((3 <= p186) AND (1 <= p909)))
lola: processed formula length: 33
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((p798 + 1 <= p266) OR (p196 <= p535)))) AND A (F ((((3 <= p84) OR (p186 <= p317)) AND (p922 <= p636)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((3 <= p84) OR (p186 <= p317)) AND (p922 <= p636))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p84 <= 2) AND (p317 + 1 <= p186)) OR (p636 + 1 <= p922))
lola: processed formula length: 60
lola: 27 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((3 <= p84) OR (p186 <= p317)) AND (p922 <= p636))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p705 + 1 <= p903)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p705 + 1 <= p903)))
lola: processed formula length: 26
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: 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: 545371 markings, 777718 edges, 109074 markings/sec, 0 secs
lola: 1087376 markings, 1550819 edges, 108401 markings/sec, 5 secs
lola: 1628029 markings, 2321807 edges, 108131 markings/sec, 10 secs
lola: 2171494 markings, 3096846 edges, 108693 markings/sec, 15 secs
lola: 2713099 markings, 3869558 edges, 108321 markings/sec, 20 secs
lola: 3258977 markings, 4647933 edges, 109176 markings/sec, 25 secs
lola: 3805212 markings, 5427281 edges, 109247 markings/sec, 30 secs
lola: 4350444 markings, 6204892 edges, 109046 markings/sec, 35 secs
lola: 4893319 markings, 6979331 edges, 108575 markings/sec, 40 secs
lola: 5440254 markings, 7759539 edges, 109387 markings/sec, 45 secs
lola: 5988120 markings, 8540943 edges, 109573 markings/sec, 50 secs
lola: 6532697 markings, 9317557 edges, 108915 markings/sec, 55 secs
lola: 7075354 markings, 10091674 edges, 108531 markings/sec, 60 secs
lola: 7610773 markings, 10855393 edges, 107084 markings/sec, 65 secs
lola: 8118738 markings, 11580084 edges, 101593 markings/sec, 70 secs
lola: 8601551 markings, 12268750 edges, 96563 markings/sec, 75 secs
lola: 9028878 markings, 12878262 edges, 85465 markings/sec, 80 secs
lola: 9513571 markings, 13569543 edges, 96939 markings/sec, 85 secs
lola: 9966563 markings, 14215576 edges, 90598 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((3 <= p750) AND (p543 <= p710))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p750 <= 2) OR (p710 + 1 <= p543))
lola: processed formula length: 36
lola: 27 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p750) AND (p543 <= p710))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p451)))
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 ((3 <= p451)))
lola: processed formula length: 19
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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p451)
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p634 <= p162) OR ((p546 <= p253) AND ((3 <= p285) OR (2 <= p772))))))
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 (((p634 <= p162) OR ((p546 <= p253) AND ((3 <= p285) OR (2 <= p772))))))
lola: processed formula length: 79
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)
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: ((p162 + 1 <= p634) AND ((p253 + 1 <= p546) OR ((p285 <= 2) AND (p772 <= 1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 127 markings, 126 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p821 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p821)
lola: processed formula length: 11
lola: 28 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p821 <= 1)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p821)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation: write sara problem file to CTLCardinality-6-1.sara
lola: The predicate does not eventually occur from all states.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p19 <= 1) OR (p771 + 1 <= p878) OR (p971 <= p843))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p19 <= 1) OR (p771 + 1 <= p878) OR (p971 <= p843))))
lola: processed formula length: 62
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p19) AND (p878 <= p771) AND (p843 + 1 <= p971))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: ========================================
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p736 <= p307) U (p417 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p736 <= p307) U (p417 <= p130)))
lola: processed formula length: 38
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: 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).
sara: place or transition ordering is non-deterministic

lola: 501605 markings, 715165 edges, 100321 markings/sec, 0 secs
lola: 1030386 markings, 1469399 edges, 105756 markings/sec, 5 secs
lola: 1564660 markings, 2231452 edges, 106855 markings/sec, 10 secs
lola: 2095972 markings, 2989263 edges, 106262 markings/sec, 15 secs
lola: 2628959 markings, 3749567 edges, 106597 markings/sec, 20 secs
lola: 3164381 markings, 4513205 edges, 107084 markings/sec, 25 secs
lola: 3698555 markings, 5275229 edges, 106835 markings/sec, 30 secs
lola: 4233802 markings, 6038595 edges, 107049 markings/sec, 35 secs
lola: 4763557 markings, 6794199 edges, 105951 markings/sec, 40 secs
lola: 5298518 markings, 7557250 edges, 106992 markings/sec, 45 secs
lola: 5831713 markings, 8317712 edges, 106639 markings/sec, 50 secs
lola: 6360619 markings, 9072228 edges, 105781 markings/sec, 55 secs
lola: 6890878 markings, 9828674 edges, 106052 markings/sec, 60 secs
lola: 7419436 markings, 10582597 edges, 105712 markings/sec, 65 secs
lola: 7948025 markings, 11336602 edges, 105718 markings/sec, 70 secs
lola: 8419286 markings, 12008559 edges, 94252 markings/sec, 75 secs
lola: 8819820 markings, 12579924 edges, 80107 markings/sec, 80 secs
lola: 9123411 markings, 13013088 edges, 60718 markings/sec, 85 secs
lola: 9572101 markings, 13654425 edges, 89738 markings/sec, 90 secs
lola: 9988793 markings, 14247453 edges, 83338 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p560 <= p370) OR ((p753 <= p80) AND (3 <= p550))) U E (G ((p911 <= p141)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p560 <= p370) OR ((p753 <= p80) AND (3 <= p550))) U EG((p911 <= p141)))
lola: processed formula length: 76
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 602 markings, 603 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= p955) AND (3 <= p379))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p955 <= 2) OR (p379 <= 2))
lola: processed formula length: 29
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p955 <= 2) OR (p379 <= 2))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p955) AND (3 <= p379))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 602 markings, 602 edges
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= p811))) AND A (F ((p703 <= p56))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p811)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p811)))
lola: processed formula length: 19
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p811 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 12 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p703 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p56 + 1 <= p703)
lola: processed formula length: 17
lola: 27 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p703 <= p56)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= p549))) AND ((p770 + 1 <= p899) OR A (F ((p654 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p549)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p549 <= 2)
lola: processed formula length: 11
lola: 27 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p549)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-12-0.sara.
lola: ...considering subproblem: E (F ((E (G ((p225 <= p857))) AND ((p920 + 1 <= p788) OR (p892 + 1 <= p609)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p857 + 1 <= p225)) OR ((p788 <= p920) AND (p609 <= p892))))
lola: processed formula length: 67
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic

lola: 495515 markings, 815773 edges, 99103 markings/sec, 0 secs
lola: 1024568 markings, 1686726 edges, 105811 markings/sec, 5 secs
lola: 1555833 markings, 2561265 edges, 106253 markings/sec, 10 secs
lola: 2086571 markings, 3435085 edges, 106148 markings/sec, 15 secs
lola: 2622221 markings, 4316885 edges, 107130 markings/sec, 20 secs
lola: 2986350 markings, 4916523 edges, 72826 markings/sec, 25 secs
lola: 3516176 markings, 5788704 edges, 105965 markings/sec, 30 secs
lola: 4042432 markings, 6655065 edges, 105251 markings/sec, 35 secs
lola: 4566818 markings, 7518694 edges, 104877 markings/sec, 40 secs
lola: 5093360 markings, 8385334 edges, 105308 markings/sec, 45 secs
lola: 5622164 markings, 9256055 edges, 105761 markings/sec, 50 secs
lola: 6145411 markings, 10117394 edges, 104649 markings/sec, 55 secs
lola: 6669075 markings, 10979661 edges, 104733 markings/sec, 60 secs
lola: 7202764 markings, 11858293 edges, 106738 markings/sec, 65 secs
lola: 7733549 markings, 12732050 edges, 106157 markings/sec, 70 secs
lola: 8261860 markings, 13602076 edges, 105662 markings/sec, 75 secs
lola: 8787900 markings, 14468125 edges, 105208 markings/sec, 80 secs
lola: 9318081 markings, 15340887 edges, 106036 markings/sec, 85 secs
lola: 9844712 markings, 16207924 edges, 105326 markings/sec, 90 secs
lola: 10368270 markings, 17070057 edges, 104712 markings/sec, 95 secs
lola: 10887650 markings, 17925010 edges, 103876 markings/sec, 100 secs
lola: 11411117 markings, 18786858 edges, 104693 markings/sec, 105 secs
lola: 11933540 markings, 19647049 edges, 104485 markings/sec, 110 secs
lola: 12452798 markings, 20501833 edges, 103852 markings/sec, 115 secs
lola: 12971438 markings, 21355621 edges, 103728 markings/sec, 120 secs
lola: 13497026 markings, 22221138 edges, 105118 markings/sec, 125 secs
lola: 14025071 markings, 23090593 edges, 105609 markings/sec, 130 secs
lola: 14549813 markings, 23954346 edges, 104948 markings/sec, 135 secs
lola: 15074242 markings, 24817980 edges, 104886 markings/sec, 140 secs
lola: 15598318 markings, 25680635 edges, 104815 markings/sec, 145 secs
lola: 16122395 markings, 26543558 edges, 104815 markings/sec, 150 secs
lola: 16644693 markings, 27403367 edges, 104460 markings/sec, 155 secs
lola: 17156907 markings, 28246828 edges, 102443 markings/sec, 160 secs
lola: 17672304 markings, 29095298 edges, 103079 markings/sec, 165 secs
lola: 18197115 markings, 29959526 edges, 104962 markings/sec, 170 secs
lola: 18720642 markings, 30821163 edges, 104705 markings/sec, 175 secs
lola: 19237944 markings, 31672864 edges, 103460 markings/sec, 180 secs
lola: 19754279 markings, 32523099 edges, 103267 markings/sec, 185 secs
lola: 20286794 markings, 33399754 edges, 106503 markings/sec, 190 secs
lola: 20816117 markings, 34271214 edges, 105865 markings/sec, 195 secs
lola: 21344083 markings, 35140523 edges, 105593 markings/sec, 200 secs
lola: 21865158 markings, 35998443 edges, 104215 markings/sec, 205 secs
lola: 22396243 markings, 36872871 edges, 106217 markings/sec, 210 secs
lola: 22925661 markings, 37744481 edges, 105884 markings/sec, 215 secs
lola: 23450558 markings, 38608634 edges, 104979 markings/sec, 220 secs
lola: 23971178 markings, 39465725 edges, 104124 markings/sec, 225 secs
lola: 24495491 markings, 40328979 edges, 104863 markings/sec, 230 secs
lola: 25018926 markings, 41190700 edges, 104687 markings/sec, 235 secs
lola: 25539839 markings, 42048365 edges, 104183 markings/sec, 240 secs
lola: 26057695 markings, 42901035 edges, 103571 markings/sec, 245 secs
lola: 26583307 markings, 43766281 edges, 105122 markings/sec, 250 secs
lola: 27110024 markings, 44633372 edges, 105343 markings/sec, 255 secs
lola: 27635333 markings, 45498296 edges, 105062 markings/sec, 260 secs
lola: 28157212 markings, 46357609 edges, 104376 markings/sec, 265 secs
lola: 28680277 markings, 47218930 edges, 104613 markings/sec, 270 secs
lola: 29201936 markings, 48077722 edges, 104332 markings/sec, 275 secs
lola: 29722303 markings, 48934314 edges, 104073 markings/sec, 280 secs
lola: 30241516 markings, 49789029 edges, 103843 markings/sec, 285 secs
lola: 30756120 markings, 50636559 edges, 102921 markings/sec, 290 secs
lola: 31276536 markings, 51493296 edges, 104083 markings/sec, 295 secs
lola: 31796190 markings, 52348804 edges, 103931 markings/sec, 300 secs
lola: 32316539 markings, 53205476 edges, 104070 markings/sec, 305 secs
lola: 32834071 markings, 54057397 edges, 103506 markings/sec, 310 secs
lola: 33354452 markings, 54914401 edges, 104076 markings/sec, 315 secs
lola: 33876338 markings, 55773628 edges, 104377 markings/sec, 320 secs
lola: 34397372 markings, 56631455 edges, 104207 markings/sec, 325 secs
lola: 34910257 markings, 57475660 edges, 102577 markings/sec, 330 secs
lola: 35429838 markings, 58331161 edges, 103916 markings/sec, 335 secs
lola: 35935528 markings, 59163964 edges, 101138 markings/sec, 340 secs
lola: 36429511 markings, 59977127 edges, 98797 markings/sec, 345 secs
lola: 36912485 markings, 60772273 edges, 96595 markings/sec, 350 secs
lola: 37407972 markings, 61588014 edges, 99097 markings/sec, 355 secs
lola: 37904375 markings, 62405373 edges, 99281 markings/sec, 360 secs
lola: 38403870 markings, 63227445 edges, 99899 markings/sec, 365 secs
lola: 38827485 markings, 63924955 edges, 84723 markings/sec, 370 secs
lola: 39289437 markings, 64685605 edges, 92390 markings/sec, 375 secs
lola: 39793605 markings, 65515787 edges, 100834 markings/sec, 380 secs
lola: 40297386 markings, 66345407 edges, 100756 markings/sec, 385 secs
lola: 40776586 markings, 67134108 edges, 95840 markings/sec, 390 secs
lola: 41106184 markings, 67676957 edges, 65920 markings/sec, 395 secs
lola: 41448169 markings, 68240021 edges, 68397 markings/sec, 400 secs
lola: 41950100 markings, 69066109 edges, 100386 markings/sec, 405 secs
lola: 42449707 markings, 69888703 edges, 99921 markings/sec, 410 secs
lola: 42809770 markings, 70481520 edges, 72013 markings/sec, 415 secs
lola: 43101469 markings, 70961871 edges, 58340 markings/sec, 420 secs
lola: 43593414 markings, 71771580 edges, 98389 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p82 + 1 <= p253) AND (p79 + 1 <= p797)))) OR A (G (((p647 + 1 <= p479) AND (p222 + 1 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p647 + 1 <= p479) AND (p222 + 1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p647 + 1 <= p479) AND (p222 + 1 <= p51))))
lola: processed formula length: 50
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p479 <= p647) OR (p51 <= p222))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p82 + 1 <= p253) AND (p79 + 1 <= p797))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p253 <= p82) OR (p797 <= p79))
lola: processed formula length: 33
lola: 27 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p82 + 1 <= p253) AND (p79 + 1 <= p797))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: try reading problem file CTLCardinality-15-0.sara.
lola: subprocess 15 will run for 2684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p427 <= 1) OR (p724 + 1 <= p954)))) AND ((p476 <= p584) OR A (G (((p601 <= p607) AND (p43 <= p377))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p427 <= 1) OR (p724 + 1 <= p954))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((2 <= p427) AND (p954 <= p724))
lola: processed formula length: 32
lola: 27 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p427 <= 1) OR (p724 + 1 <= p954))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p705 + 1 <= p903)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p705 + 1 <= p903)))
lola: processed formula length: 26
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: 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: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: 479914 markings, 684356 edges, 95983 markings/sec, 0 secs
lola: 1012216 markings, 1443407 edges, 106460 markings/sec, 5 secs
lola: 1545293 markings, 2203817 edges, 106615 markings/sec, 10 secs
lola: 2082099 markings, 2969459 edges, 107361 markings/sec, 15 secs
lola: 2621432 markings, 3738628 edges, 107867 markings/sec, 20 secs
lola: 3155685 markings, 4500671 edges, 106851 markings/sec, 25 secs
lola: 3689705 markings, 5262425 edges, 106804 markings/sec, 30 secs
lola: 4223234 markings, 6023544 edges, 106706 markings/sec, 35 secs
lola: 4754299 markings, 6781119 edges, 106213 markings/sec, 40 secs
lola: 5289224 markings, 7543917 edges, 106985 markings/sec, 45 secs
lola: 5825156 markings, 8308472 edges, 107186 markings/sec, 50 secs
lola: 6365425 markings, 9078985 edges, 108054 markings/sec, 55 secs
lola: 6905137 markings, 9848816 edges, 107942 markings/sec, 60 secs
lola: 7440043 markings, 10611977 edges, 106981 markings/sec, 65 secs
lola: 7973791 markings, 11373214 edges, 106750 markings/sec, 70 secs
lola: 8440846 markings, 12039536 edges, 93411 markings/sec, 75 secs
lola: 8864065 markings, 12645077 edges, 84644 markings/sec, 80 secs
lola: 9214976 markings, 13145716 edges, 70182 markings/sec, 85 secs
lola: 9594857 markings, 13685448 edges, 75976 markings/sec, 90 secs
lola: 9981833 markings, 14237381 edges, 77395 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (((p736 <= p307) U (p417 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p736 <= p307) U (p417 <= p130)))
lola: processed formula length: 38
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: 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: 499318 markings, 712052 edges, 99864 markings/sec, 0 secs
lola: 1029773 markings, 1468583 edges, 106091 markings/sec, 5 secs
lola: 1557657 markings, 2221430 edges, 105577 markings/sec, 10 secs
lola: 2086630 markings, 2976042 edges, 105795 markings/sec, 15 secs
lola: 2614551 markings, 3728818 edges, 105584 markings/sec, 20 secs
lola: 3146405 markings, 4487549 edges, 106371 markings/sec, 25 secs
lola: 3675836 markings, 5242619 edges, 105886 markings/sec, 30 secs
lola: 4205827 markings, 5998570 edges, 105998 markings/sec, 35 secs
lola: 4730477 markings, 6747016 edges, 104930 markings/sec, 40 secs
lola: 5258915 markings, 7500702 edges, 105688 markings/sec, 45 secs
lola: 5785683 markings, 8252108 edges, 105354 markings/sec, 50 secs
lola: 6312982 markings, 9004174 edges, 105460 markings/sec, 55 secs
lola: 6839316 markings, 9755012 edges, 105267 markings/sec, 60 secs
lola: 7368191 markings, 10509457 edges, 105775 markings/sec, 65 secs
lola: 7899168 markings, 11266757 edges, 106195 markings/sec, 70 secs
lola: 8333502 markings, 11886283 edges, 86867 markings/sec, 75 secs
lola: 8775257 markings, 12518945 edges, 88351 markings/sec, 80 secs
lola: 9167494 markings, 13075820 edges, 78447 markings/sec, 85 secs
lola: 9573408 markings, 13655035 edges, 81183 markings/sec, 90 secs
lola: 9979070 markings, 14234909 edges, 81132 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p225 <= p857))) AND ((p920 + 1 <= p788) OR (p892 + 1 <= p609)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p857 + 1 <= p225)) OR ((p788 <= p920) AND (p609 <= p892))))
lola: processed formula length: 67
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 441227 markings, 726125 edges, 88245 markings/sec, 0 secs
lola: 960525 markings, 1581145 edges, 103860 markings/sec, 5 secs
lola: 1494272 markings, 2459983 edges, 106749 markings/sec, 10 secs
lola: 2029694 markings, 3341396 edges, 107084 markings/sec, 15 secs
lola: 2559876 markings, 4214267 edges, 106036 markings/sec, 20 secs
lola: 3091196 markings, 5089078 edges, 106264 markings/sec, 25 secs
lola: 3620739 markings, 5960929 edges, 105909 markings/sec, 30 secs
lola: 4146938 markings, 6827149 edges, 105240 markings/sec, 35 secs
lola: 4673794 markings, 7694584 edges, 105371 markings/sec, 40 secs
lola: 5207636 markings, 8573562 edges, 106768 markings/sec, 45 secs
lola: 5736714 markings, 9444600 edges, 105816 markings/sec, 50 secs
lola: 6259933 markings, 10306087 edges, 104644 markings/sec, 55 secs
lola: 6786860 markings, 11173487 edges, 105385 markings/sec, 60 secs
lola: 7317490 markings, 12047177 edges, 106126 markings/sec, 65 secs
lola: 7846552 markings, 12918240 edges, 105812 markings/sec, 70 secs
lola: 8371503 markings, 13782535 edges, 104990 markings/sec, 75 secs
lola: 8898801 markings, 14650666 edges, 105460 markings/sec, 80 secs
lola: 9429137 markings, 15523813 edges, 106067 markings/sec, 85 secs
lola: 9960406 markings, 16398498 edges, 106254 markings/sec, 90 secs
lola: 10479902 markings, 17253712 edges, 103899 markings/sec, 95 secs
lola: 11001928 markings, 18113199 edges, 104405 markings/sec, 100 secs
lola: 11528151 markings, 18979588 edges, 105245 markings/sec, 105 secs
lola: 12051635 markings, 19841439 edges, 104697 markings/sec, 110 secs
lola: 12574668 markings, 20702573 edges, 104607 markings/sec, 115 secs
lola: 13094845 markings, 21558738 edges, 104035 markings/sec, 120 secs
lola: 13627097 markings, 22435349 edges, 106450 markings/sec, 125 secs
lola: 14157668 markings, 23308842 edges, 106114 markings/sec, 130 secs
lola: 14682239 markings, 24172576 edges, 104914 markings/sec, 135 secs
lola: 15204560 markings, 25032473 edges, 104464 markings/sec, 140 secs
lola: 15735937 markings, 25907240 edges, 106275 markings/sec, 145 secs
lola: 16266354 markings, 26780628 edges, 106083 markings/sec, 150 secs
lola: 16793428 markings, 27648390 edges, 105415 markings/sec, 155 secs
lola: 17317299 markings, 28510922 edges, 104774 markings/sec, 160 secs
lola: 17840221 markings, 29371823 edges, 104584 markings/sec, 165 secs
lola: 18362431 markings, 30231491 edges, 104442 markings/sec, 170 secs
lola: 18883406 markings, 31089229 edges, 104195 markings/sec, 175 secs
lola: 19403170 markings, 31944901 edges, 103953 markings/sec, 180 secs
lola: 19931529 markings, 32814749 edges, 105672 markings/sec, 185 secs
lola: 20463257 markings, 33690381 edges, 106346 markings/sec, 190 secs
lola: 20993884 markings, 34563790 edges, 106125 markings/sec, 195 secs
lola: 21520840 markings, 35431368 edges, 105391 markings/sec, 200 secs
lola: 22048064 markings, 36299614 edges, 105445 markings/sec, 205 secs
lola: 22575697 markings, 37168192 edges, 105527 markings/sec, 210 secs
lola: 23106366 markings, 38041944 edges, 106134 markings/sec, 215 secs
lola: 23631921 markings, 38907110 edges, 105111 markings/sec, 220 secs
lola: 24158207 markings, 39773520 edges, 105257 markings/sec, 225 secs
lola: 24686517 markings, 40643488 edges, 105662 markings/sec, 230 secs
lola: 25209113 markings, 41503837 edges, 104519 markings/sec, 235 secs
lola: 25726471 markings, 42355579 edges, 103472 markings/sec, 240 secs
lola: 26244584 markings, 43208805 edges, 103623 markings/sec, 245 secs
lola: 26776074 markings, 44083835 edges, 106298 markings/sec, 250 secs
lola: 27300972 markings, 44947920 edges, 104980 markings/sec, 255 secs
lola: 27820793 markings, 45803733 edges, 103964 markings/sec, 260 secs
lola: 28339278 markings, 46657436 edges, 103697 markings/sec, 265 secs
lola: 28863391 markings, 47520290 edges, 104823 markings/sec, 270 secs
lola: 29387890 markings, 48383673 edges, 104900 markings/sec, 275 secs
lola: 29911251 markings, 49245352 edges, 104672 markings/sec, 280 secs
lola: 30432388 markings, 50103278 edges, 104227 markings/sec, 285 secs
lola: 30953469 markings, 50961449 edges, 104216 markings/sec, 290 secs
lola: 31475243 markings, 51820228 edges, 104355 markings/sec, 295 secs
lola: 31993449 markings, 52673616 edges, 103641 markings/sec, 300 secs
lola: 32515871 markings, 53533482 edges, 104484 markings/sec, 305 secs
lola: 33039847 markings, 54396304 edges, 104795 markings/sec, 310 secs
lola: 33565601 markings, 55261951 edges, 105151 markings/sec, 315 secs
lola: 34090655 markings, 56126351 edges, 105011 markings/sec, 320 secs
lola: 34616038 markings, 56991318 edges, 105077 markings/sec, 325 secs
lola: 35134309 markings, 57844723 edges, 103654 markings/sec, 330 secs
lola: 35657495 markings, 58706142 edges, 104637 markings/sec, 335 secs
lola: 36116358 markings, 59461602 edges, 91773 markings/sec, 340 secs
lola: 36603591 markings, 60263693 edges, 97447 markings/sec, 345 secs
lola: 37098909 markings, 61079115 edges, 99064 markings/sec, 350 secs
lola: 37586108 markings, 61881339 edges, 97440 markings/sec, 355 secs
lola: 38082972 markings, 62699291 edges, 99373 markings/sec, 360 secs
lola: 38581564 markings, 63520142 edges, 99718 markings/sec, 365 secs
lola: 39076724 markings, 64335267 edges, 99032 markings/sec, 370 secs
lola: 39577859 markings, 65160646 edges, 100227 markings/sec, 375 secs
lola: 40088362 markings, 66001129 edges, 102101 markings/sec, 380 secs
lola: 40599275 markings, 66842187 edges, 102183 markings/sec, 385 secs
lola: 41109388 markings, 67682035 edges, 102023 markings/sec, 390 secs
lola: 41617924 markings, 68519145 edges, 101707 markings/sec, 395 secs
lola: 42124841 markings, 69353742 edges, 101383 markings/sec, 400 secs
lola: 42634421 markings, 70192965 edges, 101916 markings/sec, 405 secs
lola: 43137975 markings, 71021745 edges, 100711 markings/sec, 410 secs
lola: 43636144 markings, 71841834 edges, 99634 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes no unknown no no yes no no unknown no yes no unknown no
lola:
preliminary result: yes no yes no unknown no no yes no no unknown no yes no unknown no
lola: memory consumption: 3500 KB
lola: time consumption: 1512 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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r184-oct2-158987928500443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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