MCC'2020 - Execution of r186-oct2-158987938600171

About the Execution of ITS-LoLa for RobotManipulation-PT-00020

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15790.120	3600000.00	1277898.00	11509.20	FTFFTFTFTFTFFFTT	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.3K Apr 12 10:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 10:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 9 22:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 22:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-00020-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591229091328

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:04:54] [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-04 00:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:04:54] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2020-06-04 00:04:54] [INFO ] Transformed 15 places.
[2020-06-04 00:04:54] [INFO ] Transformed 11 transitions.
[2020-06-04 00:04:54] [INFO ] Parsed PT model containing 15 places and 11 transitions in 49 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Incomplete random walk after 100024 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=2128 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 11 rows 15 cols
[2020-06-04 00:04:54] [INFO ] Computed 6 place invariants in 7 ms
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 00:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-04 00:04:54] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 00:04:54] [INFO ] Flatten gal took : 33 ms
[2020-06-04 00:04:54] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 00:04:54] [INFO ] Flatten gal took : 4 ms
FORMULA RobotManipulation-PT-00020-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00020-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00020-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00020-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:04:54] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 00:04:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RobotManipulation-PT-00020 @ 3570 seconds

FORMULA RobotManipulation-PT-00020-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00020-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2374
rslt: Output for CTLCardinality @ RobotManipulation-PT-00020

{
"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": "Thu Jun 4 00:04:54 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": "A (((3 <= p2) U (p12 <= p9)))",
"processed_size": 29,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p0 <= p11)))",
"processed_size": 19,
"rewrites": 14
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((2 <= p9) AND (1 <= p1) AND ((1 <= p10) OR (1 <= p6)))",
"processed_size": 56,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"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 <= p11)))",
"processed_size": 18,
"rewrites": 14
},
"result":
{
"edges": 160,
"markings": 161,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p4 <= p9)))",
"processed_size": 18,
"rewrites": 13
},
"result":
{
"edges": 80,
"markings": 81,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p11 <= p14)))",
"processed_size": 20,
"rewrites": 13
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p4) OR (p9 <= p1))))",
"processed_size": 34,
"rewrites": 14
},
"result":
{
"edges": 82,
"markings": 83,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 1080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p5 <= 0)))",
"processed_size": 17,
"rewrites": 13
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 1621
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1621
},
"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 ((p1 <= 2)))",
"processed_size": 17,
"rewrites": 14
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 3242
},
"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 <= p14)",
"processed_size": 10,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))",
"processed_size": 45,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "E (G (((p9 + 1 <= p13) OR (p2 <= p3) OR (p5 <= p14))))",
"processed_size": 56,
"rewrites": 13
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p4 <= p10)",
"processed_size": 11,
"rewrites": 14
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"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 ((p1 <= 2)))",
"processed_size": 17,
"rewrites": 14
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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"
}
},

{
"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 <= p14)",
"processed_size": 10,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((3 <= p11)))",
"processed_size": 18,
"rewrites": 14
},
"result":
{
"edges": 152,
"markings": 153,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))",
"processed_size": 45,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p10 <= p9) OR (p0 <= p11))))",
"processed_size": 37,
"rewrites": 14
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 5524,
"runtime": 1196.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(*)) : E(F(**)) : (E(G(**)) AND (A(G(**)) OR **)) : A(G(**)) : E(F(**)) : (** OR (A(G(**)) OR A(G(**)))) : E((A(F(**)) U A(X(**)))) : (E(X(E(F(**)))) OR E(F(A(G(**))))) : (E(G(E(X(**)))) AND (A(G(**)) OR A((** U **)))) : A(G(**)) : ((E(G(**)) OR A(X(*))) AND (A(G(**)) OR **)) : A(G(**))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no yes no no yes no yes yes no no no no ",
"value": "no yes no no yes no yes yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: LP says that atomic proposition is always true: (p1 <= p5)
lola: NOT(A (F ((1 <= p5)))) : E (F (E (((3 <= p11) U (p11 <= p14))))) : (E (G (((p9 + 1 <= p13) OR (p2 <= p3) OR (p5 <= p14)))) AND (A (G (((p10 <= p9) OR (p0 <= p11)))) OR ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9)))) : E (G (A (G (((1 <= p4) OR (2 <= p2)))))) : E (F ((p4 <= p9))) : (((3 <= p14) OR A (G ((3 <= p11)))) OR A (G ((p1 <= 2)))) : E ((A (F ((1 <= p0))) U A (X ((p12 <= p2))))) : E (F ((E (X ((p4 <= p10))) OR A (G ((3 <= p3)))))) : (E (G (E (X ((2 <= p11))))) AND (A (G ((2 <= p4))) OR A (((3 <= p2) U (p12 <= p9))))) : A (G (E (G (((2 <= p4) OR (p9 <= p1)))))) : ((E (G (((p6 <= p2) OR (p7 <= p3)))) OR NOT(E (X ((p7 <= p10))))) AND (A (G ((p0 <= p11))) OR ((2 <= p9) AND (1 <= p1) AND ((1 <= p10) OR (1 <= p6))))) : A (G ((1 <= p11)))
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:446
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= p0))) U A (X ((p12 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= p0)) U AX((p12 <= p2)))
lola: processed formula length: 34
lola: 15 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: 42 markings, 83 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((p4 <= p10))))) OR E (F (A (G ((3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 <= 2)
lola: processed formula length: 9
lola: 16 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p3 <= 2)
lola: state equation task get result unparse finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p3)
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-1.sara.
sara: try reading problem file CTLCardinality-0.sara.

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2189049 markings, 7378686 edges, 437810 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3935666 markings, 13538379 edges, 349323 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5309938 markings, 18445211 edges, 274854 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 6473439 markings, 22651995 edges, 232700 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 7539839 markings, 26515242 edges, 213280 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 8542375 markings, 30151687 edges, 200507 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 9496407 markings, 33635186 edges, 190806 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 10428940 markings, 37050615 edges, 186507 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 11347706 markings, 40416091 edges, 183753 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 12240919 markings, 43693914 edges, 178643 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 13100003 markings, 46852427 edges, 171817 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 13945055 markings, 49976845 edges, 169010 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 14765889 markings, 53017273 edges, 164167 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 15602292 markings, 56107264 edges, 167281 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 16443368 markings, 59220035 edges, 168215 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17298408 markings, 62361974 edges, 171008 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 18113083 markings, 65388960 edges, 162935 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18887570 markings, 68279496 edges, 154897 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19691185 markings, 71253908 edges, 160723 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 20475184 markings, 74175747 edges, 156800 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 21253508 markings, 77065582 edges, 155665 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 22017628 markings, 79918403 edges, 152824 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 22782291 markings, 82771813 edges, 152933 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 23540047 markings, 85609141 edges, 151551 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 24302784 markings, 88458542 edges, 152547 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 25050484 markings, 91253385 edges, 149540 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 25802352 markings, 94065552 edges, 150374 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 26552034 markings, 96871213 edges, 149936 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 27292901 markings, 99653011 edges, 148173 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 28023901 markings, 102405395 edges, 146200 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 28747872 markings, 105119413 edges, 144794 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 29463452 markings, 107801948 edges, 143116 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 30175093 markings, 110479930 edges, 142328 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 30910314 markings, 113241885 edges, 147044 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 31664165 markings, 116075537 edges, 150770 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 32419759 markings, 118914475 edges, 151119 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 33159341 markings, 121710346 edges, 147916 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 33905123 markings, 124512749 edges, 149156 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 34639113 markings, 127279435 edges, 146798 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 35369684 markings, 130034748 edges, 146114 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 36096443 markings, 132773498 edges, 145352 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 36801261 markings, 135424939 edges, 140964 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 37518782 markings, 138146018 edges, 143504 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 38279843 markings, 141021982 edges, 152212 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 39030017 markings, 143875975 edges, 150035 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 39790938 markings, 146749212 edges, 152184 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 40576975 markings, 149709185 edges, 157207 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 41336706 markings, 152572948 edges, 151946 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 42083073 markings, 155399572 edges, 149273 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 42839296 markings, 158256146 edges, 151245 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 43591290 markings, 161093918 edges, 150399 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 44347440 markings, 163965988 edges, 151230 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 45101831 markings, 166840993 edges, 150878 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 45885415 markings, 169789831 edges, 156717 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 46657026 markings, 172709773 edges, 154322 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 47438852 markings, 175658102 edges, 156365 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 48216479 markings, 178606418 edges, 155525 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 48979056 markings, 181502182 edges, 152515 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 49739354 markings, 184389352 edges, 152060 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 50526427 markings, 187382552 edges, 157415 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 51317948 markings, 190389264 edges, 158304 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 52144663 markings, 193515047 edges, 165343 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 52987401 markings, 196718826 edges, 168548 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 53844331 markings, 199977209 edges, 171386 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown
lola: memory consumption: 5679228 KB
lola: time consumption: 328 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown
lola: memory consumption: 5680116 KB
lola: time consumption: 328 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 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((2 <= p11))))) AND (A (G ((2 <= p4))) OR A (((3 <= p2) U (p12 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p4)))
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 ((2 <= p4)))
lola: processed formula length: 17
lola: 14 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= 1)
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 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p2) U (p12 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((3 <= p2) U (p12 <= p9)))
lola: processed formula length: 29
lola: 17 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p2)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p6 <= p2) OR (p7 <= p3)))) OR A (X ((p10 + 1 <= p7)))) AND (A (G ((p0 <= p11))) OR ((2 <= p9) AND (1 <= p1) AND ((1 <= p10) OR (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p6 <= p2) OR (p7 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p6 <= p2) OR (p7 <= p3))))
lola: processed formula length: 35
lola: 13 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: ((p2 + 1 <= p6) AND (p3 + 1 <= p7))
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
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 204 markings, 204 edges
lola: ========================================
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p0 <= p11)))
lola: processed formula length: 19
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p11 + 1 <= p0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p9) AND (1 <= p1) AND ((1 <= p10) OR (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p9) AND (1 <= p1) AND ((1 <= p10) OR (1 <= p6)))
lola: processed formula length: 56
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
sara: try reading problem file CTLCardinality-4-0.sara.
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

lola: ========================================
lola: subprocess 4 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p11)))
lola: processed formula length: 18
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p11 <= 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: 161 markings, 160 edges
lola: ========================================
lola: subprocess 5 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p9)))
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 ((p4 <= p9)))
lola: processed formula length: 18
lola: 13 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: (p4 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: ========================================
lola: subprocess 6 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p11 <= p14)))
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 ((p11 <= p14)))
lola: processed formula length: 20
lola: 13 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: (p11 <= p14)
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: 41 markings, 40 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-6-0.sara.
lola: subprocess 7 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p4) OR (2 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p4) OR (2 <= p2))))
lola: processed formula length: 33
lola: 14 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================

lola: subprocess 8 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p4) OR (p9 <= p1))))
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 (((2 <= p4) OR (p9 <= p1))))
lola: processed formula length: 34
lola: 14 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: ((p4 <= 1) AND (p1 + 1 <= p9))
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 83 markings, 82 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: subprocess 9 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p5 <= 0)))
lola: processed formula length: 17
lola: 13 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 42 markings, 41 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: subprocess 10 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p14) OR (A (G ((3 <= p11))) OR A (G ((p1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1 <= 2)))
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 ((p1 <= 2)))
lola: processed formula length: 17
lola: 14 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: (3 <= p1)
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-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p14)
lola: processed formula length: 10
lola: 12 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p9 + 1 <= p13) OR (p2 <= p3) OR (p5 <= p14)))) AND (A (G (((p10 <= p9) OR (p0 <= p11)))) OR ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))
lola: processed formula length: 45
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p9 + 1 <= p13) OR (p2 <= p3) OR (p5 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p9 + 1 <= p13) OR (p2 <= p3) OR (p5 <= p14))))
lola: processed formula length: 56
lola: 13 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: ((p13 <= p9) AND (p3 + 1 <= p2) AND (p14 + 1 <= p5))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((p4 <= p10))))) OR E (F (A (G ((3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 <= 2)
lola: processed formula length: 9
lola: 16 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
lola: using tscc preserving stubborn set method (--stubborn)
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: (3 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation 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: (p3 <= 2)
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-12-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2012675 markings, 6761880 edges, 402535 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3820245 markings, 13130744 edges, 361514 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5558740 markings, 19345082 edges, 347699 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7230482 markings, 25388643 edges, 334348 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8861741 markings, 31312634 edges, 326252 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 10450588 markings, 37130340 edges, 317769 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 12002163 markings, 42829828 edges, 310315 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 13512227 markings, 48375231 edges, 302013 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 14989501 markings, 53838690 edges, 295455 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 16450290 markings, 59244835 edges, 292158 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 17905064 markings, 64625958 edges, 290955 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 19326526 markings, 69914010 edges, 284292 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 20766316 markings, 75252535 edges, 287958 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 22189728 markings, 80563076 edges, 284682 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 23605697 markings, 85851515 edges, 283194 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 24981568 markings, 90993341 edges, 275174 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 26345456 markings, 96100790 edges, 272778 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 27714842 markings, 101234679 edges, 273877 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 29067227 markings, 106314424 edges, 270477 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 30423853 markings, 111408120 edges, 271325 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 31761525 markings, 116445856 edges, 267534 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 33095743 markings, 121470428 edges, 266844 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 34437974 markings, 126521970 edges, 268446 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 35766619 markings, 131530325 edges, 265729 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 37054302 markings, 136383633 edges, 257537 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 38283125 markings, 141034361 edges, 245765 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 39466496 markings, 145519564 edges, 236674 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 40623874 markings, 149887042 edges, 231476 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 41770912 markings, 154216514 edges, 229408 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 42908007 markings, 158512545 edges, 227419 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 44034627 markings, 162777813 edges, 225324 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 45167929 markings, 167089095 edges, 226660 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 46308393 markings, 171395606 edges, 228093 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 47445658 markings, 175684781 edges, 227453 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 48564375 markings, 179929667 edges, 223743 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 49688262 markings, 184189394 edges, 224777 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 50804410 markings, 188449466 edges, 223230 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 51939798 markings, 192746823 edges, 227078 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 53125075 markings, 197245658 edges, 237055 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 54316748 markings, 201774455 edges, 238335 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 55524475 markings, 206346085 edges, 241545 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 56682194 markings, 210771643 edges, 231544 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 57833949 markings, 215173436 edges, 230351 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 58997974 markings, 219602329 edges, 232805 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 60158884 markings, 224029514 edges, 232182 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 61342451 markings, 228530948 edges, 236713 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 62559113 markings, 233171050 edges, 243332 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 63795932 markings, 237879386 edges, 247364 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 65003652 markings, 242489275 edges, 241544 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 66197579 markings, 247057855 edges, 238785 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 67382032 markings, 251615162 edges, 236891 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 68570712 markings, 256170062 edges, 237736 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 69762609 markings, 260723995 edges, 238379 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 70949714 markings, 265255619 edges, 237421 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 72141651 markings, 269826528 edges, 238387 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 73338433 markings, 274406602 edges, 239356 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 74534363 markings, 278993296 edges, 239186 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 75735089 markings, 283600249 edges, 240145 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 76945627 markings, 288235428 edges, 242108 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 78068870 markings, 292543073 edges, 224649 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 78950030 markings, 295907931 edges, 176232 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 80106716 markings, 300331936 edges, 231337 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 81294104 markings, 304879447 edges, 237478 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 82469135 markings, 309412972 edges, 235006 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 83659167 markings, 313988767 edges, 238006 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 84824700 markings, 318500997 edges, 233107 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 86009882 markings, 323042614 edges, 237036 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 87177002 markings, 327542050 edges, 233424 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 88338062 markings, 331994663 edges, 232212 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 89503009 markings, 336472894 edges, 232989 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 90677316 markings, 340969095 edges, 234861 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 91822556 markings, 345373893 edges, 229048 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 92958156 markings, 349767389 edges, 227120 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 94101762 markings, 354171434 edges, 228721 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 95238877 markings, 358559439 edges, 227423 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 96381003 markings, 362967100 edges, 228425 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 97529071 markings, 367387896 edges, 229614 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 98655259 markings, 371733881 edges, 225238 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 99786062 markings, 376107729 edges, 226161 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 100908952 markings, 380446432 edges, 224578 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 102055824 markings, 384845438 edges, 229374 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 103195826 markings, 389206571 edges, 228000 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 104343320 markings, 393643914 edges, 229499 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 105500848 markings, 398096309 edges, 231506 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 106648061 markings, 402525402 edges, 229443 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 107782471 markings, 406917924 edges, 226882 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 108913021 markings, 411283313 edges, 226110 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 110035512 markings, 415600160 edges, 224498 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 111157257 markings, 419925987 edges, 224349 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 112248677 markings, 424123371 edges, 218284 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 113389038 markings, 428514566 edges, 228072 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 114508992 markings, 432873545 edges, 223991 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 115624485 markings, 437213884 edges, 223099 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 116744165 markings, 441548912 edges, 223936 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 117875391 markings, 445927282 edges, 226245 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 119012937 markings, 450307840 edges, 227509 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 120145078 markings, 454685573 edges, 226428 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 121279624 markings, 459063486 edges, 226909 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 122414350 markings, 463443939 edges, 226945 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 123559853 markings, 467842513 edges, 229101 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 124690343 markings, 472209240 edges, 226098 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 125810552 markings, 476563381 edges, 224042 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 126939452 markings, 480917851 edges, 225780 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 128075717 markings, 485283935 edges, 227253 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 129189143 markings, 489598503 edges, 222685 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 130306294 markings, 493912401 edges, 223430 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 131408462 markings, 498188171 edges, 220434 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 132532002 markings, 502507728 edges, 224708 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 133643934 markings, 506811837 edges, 222386 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 134749294 markings, 511103240 edges, 221072 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 135854899 markings, 515377802 edges, 221121 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 136956782 markings, 519673090 edges, 220377 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 138052390 markings, 523942731 edges, 219122 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 139168771 markings, 528258164 edges, 223276 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 140259193 markings, 532505679 edges, 218084 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 141357579 markings, 536778383 edges, 219677 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 142458720 markings, 541044895 edges, 220228 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 143539801 markings, 545268589 edges, 216216 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 144625072 markings, 549504500 edges, 217054 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 145714677 markings, 553737156 edges, 217921 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 146803956 markings, 557980556 edges, 217856 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 147874973 markings, 562145425 edges, 214203 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 148947982 markings, 566317430 edges, 214602 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 150029911 markings, 570526966 edges, 216386 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 151106138 markings, 574737225 edges, 215245 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 152174503 markings, 578897525 edges, 213673 markings/sec, 625 secs
lola: sara is running 630 secs || sara is running 630 secs || 153250737 markings, 583068291 edges, 215247 markings/sec, 630 secs
lola: sara is running 635 secs || sara is running 635 secs || 154288563 markings, 587091016 edges, 207565 markings/sec, 635 secs
lola: sara is running 640 secs || sara is running 640 secs || 155109752 markings, 590287784 edges, 164238 markings/sec, 640 secs
lola: sara is running 645 secs || sara is running 645 secs || 155636611 markings, 592339957 edges, 105372 markings/sec, 645 secs
lola: sara is running 650 secs || sara is running 650 secs || 156476530 markings, 595575237 edges, 167984 markings/sec, 650 secs
lola: sara is running 655 secs || sara is running 655 secs || 157534023 markings, 599649452 edges, 211499 markings/sec, 655 secs
lola: sara is running 660 secs || sara is running 660 secs || 158279598 markings, 602551175 edges, 149115 markings/sec, 660 secs
lola: sara is running 665 secs || sara is running 665 secs || 159185546 markings, 606065625 edges, 181190 markings/sec, 665 secs
lola: sara is running 670 secs || sara is running 670 secs || 159788546 markings, 608417150 edges, 120600 markings/sec, 670 secs
lola: sara is running 675 secs || sara is running 675 secs || 160656014 markings, 611805453 edges, 173494 markings/sec, 675 secs
lola: sara is running 680 secs || sara is running 680 secs || 161681925 markings, 615815382 edges, 205182 markings/sec, 680 secs
lola: sara is running 685 secs || sara is running 685 secs || 162714083 markings, 619836271 edges, 206432 markings/sec, 685 secs
lola: sara is running 690 secs || sara is running 690 secs || 163740248 markings, 623839092 edges, 205233 markings/sec, 690 secs
lola: sara is running 695 secs || sara is running 695 secs || 164763245 markings, 627837875 edges, 204599 markings/sec, 695 secs
lola: sara is running 700 secs || sara is running 700 secs || 165805471 markings, 631868302 edges, 208445 markings/sec, 700 secs
lola: sara is running 705 secs || sara is running 705 secs || 166836905 markings, 635894075 edges, 206287 markings/sec, 705 secs
lola: sara is running 710 secs || sara is running 710 secs || 167863679 markings, 639907647 edges, 205355 markings/sec, 710 secs
lola: sara is running 715 secs || sara is running 715 secs || 168924623 markings, 644010868 edges, 212189 markings/sec, 715 secs
lola: sara is running 720 secs || sara is running 720 secs || 169916503 markings, 647867343 edges, 198376 markings/sec, 720 secs
lola: sara is running 725 secs || sara is running 725 secs || 170975878 markings, 651993071 edges, 211875 markings/sec, 725 secs
lola: sara is running 730 secs || sara is running 730 secs || 171978785 markings, 655897013 edges, 200581 markings/sec, 730 secs
lola: sara is running 735 secs || sara is running 735 secs || 172972284 markings, 659755330 edges, 198700 markings/sec, 735 secs
lola: sara is running 740 secs || sara is running 740 secs || 173876871 markings, 663302869 edges, 180917 markings/sec, 740 secs
lola: sara is running 745 secs || sara is running 745 secs || 174869903 markings, 667183888 edges, 198606 markings/sec, 745 secs
lola: sara is running 750 secs || sara is running 750 secs || 175868879 markings, 671061392 edges, 199795 markings/sec, 750 secs
lola: sara is running 755 secs || sara is running 755 secs || 176597494 markings, 673896425 edges, 145723 markings/sec, 755 secs
lola: sara is running 760 secs || sara is running 760 secs || 177338782 markings, 676784611 edges, 148258 markings/sec, 760 secs
lola: sara is running 765 secs || sara is running 765 secs || 178061831 markings, 679601446 edges, 144610 markings/sec, 765 secs
lola: sara is running 770 secs || sara is running 770 secs || 179094744 markings, 683636347 edges, 206583 markings/sec, 770 secs
lola: sara is running 775 secs || sara is running 775 secs || 180132546 markings, 687676041 edges, 207560 markings/sec, 775 secs
lola: sara is running 780 secs || sara is running 780 secs || 181166831 markings, 691709611 edges, 206857 markings/sec, 780 secs
lola: sara is running 785 secs || sara is running 785 secs || 182079957 markings, 695288325 edges, 182625 markings/sec, 785 secs
lola: sara is running 790 secs || sara is running 790 secs || 182693145 markings, 697673581 edges, 122638 markings/sec, 790 secs
lola: sara is running 795 secs || sara is running 795 secs || 183568107 markings, 701090861 edges, 174992 markings/sec, 795 secs
lola: sara is running 800 secs || sara is running 800 secs || 184549397 markings, 704942242 edges, 196258 markings/sec, 800 secs
lola: sara is running 805 secs || sara is running 805 secs || 185194289 markings, 707490309 edges, 128978 markings/sec, 805 secs
lola: sara is running 810 secs || sara is running 810 secs || 185919658 markings, 710343570 edges, 145074 markings/sec, 810 secs
lola: sara is running 815 secs || sara is running 815 secs || 186880361 markings, 714115218 edges, 192141 markings/sec, 815 secs
lola: sara is running 820 secs || sara is running 820 secs || 187852101 markings, 717912874 edges, 194348 markings/sec, 820 secs
lola: sara is running 825 secs || sara is running 825 secs || 188840631 markings, 721749528 edges, 197706 markings/sec, 825 secs
lola: sara is running 830 secs || sara is running 830 secs || 189810698 markings, 725572465 edges, 194013 markings/sec, 830 secs
lola: sara is running 835 secs || sara is running 835 secs || 190795992 markings, 729430460 edges, 197059 markings/sec, 835 secs
lola: sara is running 840 secs || sara is running 840 secs || 191784878 markings, 733301282 edges, 197777 markings/sec, 840 secs
lola: sara is running 845 secs || sara is running 845 secs || 192626558 markings, 736599014 edges, 168336 markings/sec, 845 secs
lola: sara is running 850 secs || sara is running 850 secs || 193483074 markings, 739951518 edges, 171303 markings/sec, 850 secs
lola: sara is running 855 secs || sara is running 855 secs || 194381813 markings, 743459958 edges, 179748 markings/sec, 855 secs
lola: sara is running 860 secs || sara is running 860 secs || 195089758 markings, 746252459 edges, 141589 markings/sec, 860 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p4 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p4 <= p10)
lola: processed formula length: 11
lola: 14 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 /EXEF)
lola: state space: using reachability graph (EXef 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: 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: (p4 <= p10)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 80 markings, 79 edges
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: ========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file CTLCardinality-13-0.sara.
lola: ========================================
lola: ...considering subproblem: ((3 <= p14) OR (A (G ((3 <= p11))) OR A (G ((p1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas

lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((p1 <= 2)))
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 ((p1 <= 2)))
lola: processed formula length: 17
lola: 14 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: (3 <= p1)
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-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (3 <= p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p14)
lola: processed formula length: 10
lola: 12 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: ========================================
lola: ...considering subproblem: A (G ((3 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((3 <= p11)))
lola: processed formula length: 18
lola: 14 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: (p11 <= 2)
lola: state equation task get result unparse finished id 0
lola: 153 markings, 152 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((p9 + 1 <= p13) OR (p2 <= p3) OR (p5 <= p14)))) AND (A (G (((p10 <= p9) OR (p0 <= p11)))) OR ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= p0) AND (p9 <= 2) AND (p5 + 1 <= p9))
lola: processed formula length: 45
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: ========================================
lola: ...considering subproblem: A (G (((p10 <= p9) OR (p0 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p10 <= p9) OR (p0 <= p11))))
lola: processed formula length: 37
lola: 14 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: ((p9 + 1 <= p10) AND (p11 + 1 <= p0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 49 markings, 48 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: RESULT
lola:
SUMMARY: no yes no no yes no yes yes no no no no
lola:
preliminary result: no yes no no yes no yes yes no no no no
lola: memory consumption: 5524 KB
lola: time consumption: 1196 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="RobotManipulation-PT-00020"
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 RobotManipulation-PT-00020, 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-158987938600171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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