Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928600499.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 Kanban-PT-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 7 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 02:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591211202919

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:06:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 19:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:06:45] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-06-03 19:06:45] [INFO ] Transformed 16 places.
[2020-06-03 19:06:45] [INFO ] Transformed 16 transitions.
[2020-06-03 19:06:45] [INFO ] Parsed PT model containing 16 places and 16 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 57 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=1098 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 19:06:46] [INFO ] Computed 5 place invariants in 15 ms
[2020-06-03 19:06:46] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned unsat
[2020-06-03 19:06:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 19:06:46] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-03 19:06:46] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:06:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-03 19:06:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:06:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 19:06:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 19:06:47] [INFO ] Flatten gal took : 19 ms
[2020-06-03 19:06:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 19:06:47] [INFO ] Flatten gal took : 4 ms
FORMULA Kanban-PT-00020-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:06:47] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 19:06:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Kanban-PT-00020 @ 3570 seconds

FORMULA Kanban-PT-00020-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Kanban-PT-00020-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-00020-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00020-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2535
rslt: Output for CTLCardinality @ Kanban-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": "Wed Jun 3 19:06:47 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF(((1 <= p6) AND AX((p0 <= p11))))",
"processed_size": 35,
"rewrites": 26
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 467,
"markings": 340,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(((3 <= p4) AND ((3 <= p14) OR (p6 <= p1))))",
"processed_size": 47,
"rewrites": 25
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p12 <= p13)))",
"processed_size": 20,
"rewrites": 26
},
"result":
{
"edges": 63,
"markings": 54,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p0 <= p10) OR (p13 <= p3))",
"processed_size": 28,
"rewrites": 25
},
"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": 324
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p9 <= p5) AND (3 <= p10) AND (p0 <= 0))))",
"processed_size": 49,
"rewrites": 25
},
"result":
{
"edges": 98,
"markings": 99,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 ((p13 <= p1)))",
"processed_size": 19,
"rewrites": 25
},
"result":
{
"edges": 66,
"markings": 49,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p2 <= p3) OR (3 <= p9))))",
"processed_size": 34,
"rewrites": 26
},
"result":
{
"edges": 166,
"markings": 149,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 606
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(EF((3 <= p11)) U ((p12 + 1 <= p5) AND (p12 <= 2)))",
"processed_size": 52,
"rewrites": 26
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 22089,
"markings": 10485,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 757
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "E((((p12 <= p10) OR (p9 <= p8))) U AG((2 <= p9)))",
"processed_size": 50,
"rewrites": 26
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 30803,
"markings": 19685,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1515
},
"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 ((p10 <= 2)))",
"processed_size": 18,
"rewrites": 26
},
"result":
{
"edges": 21,
"markings": 22,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1515
},
"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": "(p14 <= p13)",
"processed_size": 12,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3030
},
"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": "(p1 <= p3)",
"processed_size": 10,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (((p8 <= p15) U (p5 <= p0)))",
"processed_size": 30,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))",
"processed_size": 88,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(p14 <= p13)",
"processed_size": 12,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(p1 <= p3)",
"processed_size": 10,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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 (((p8 <= p15) U (p5 <= p0)))",
"processed_size": 30,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p8 <= p0) AND (1 <= p0))))",
"processed_size": 34,
"rewrites": 26
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p13 + 1 <= p5)))",
"processed_size": 23,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 18,
"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": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))",
"processed_size": 88,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3784,
"runtime": 1035.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : (A(G(**)) OR (A(G(*)) OR **)) : A(G(*)) : E((** U A(G(**)))) : E(F(A(G(**)))) : (E(F(**)) OR (** AND E(X(*)))) : A(X(A(G(*)))) : E(F((** AND A(X(**))))) : E((E(F(**)) U **)) : (E(F(**)) AND (** AND (** AND E((** U **))))) : E(F(**)) : E(F(*)) : (E(X(**)) AND (A(G(**)) OR (** OR **))) : (** AND (A(G(**)) AND A((** U **)))) : TRUE"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes no no no unknown yes no yes yes yes yes yes no no yes ",
"value": "yes no no no unknown yes no yes yes yes yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: E (F ((p13 <= p1))) : ((A (G (((p8 <= p0) AND (1 <= p0)))) OR NOT(E (F ((p5 <= p13))))) OR ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))) : NOT(E (F (((p3 + 1 <= p2) AND (p9 <= 2))))) : E (((((p12 <= p10) OR (p9 <= p8))) U A (G ((2 <= p9))))) : E (F (A (G (((p6 <= p4) AND (p14 <= p7)))))) : (E (F (((p9 <= p5) AND (3 <= p10) AND (p0 <= 0)))) OR ((p7 <= p3) AND NOT(A (X ((1 <= p0)))))) : A (X (NOT(E (F ((p9 <= p1)))))) : E (F (((1 <= p6) AND A (X ((p0 <= p11)))))) : E ((E (F ((3 <= p11))) U ((p12 + 1 <= p5) AND (p12 <= 2)))) : (((E (F ((p9 <= 0))) AND (p1 <= p3)) AND (p14 <= p13)) AND E (((p8 <= p15) U (p5 <= p0)))) : E (F (((2 <= p11) AND (p5 <= p7) AND ((2 <= p3) OR (p12 <= p11))))) : NOT(A (G ((((2 <= p15) AND (p8 <= p9)) OR (p11 <= p5) OR (2 <= p4))))) : (E (X (((3 <= p4) AND ((3 <= p14) OR (p6 <= p1))))) AND ((A (G ((p12 <= p13))) OR (p0 <= p10)) OR (p13 <= p3))) : (((p7 + 1 <= p13) AND A (G ((p10 <= 2)))) AND A (((p0 <= p3) U (p2 <= 1)))) : E (G ((0 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p1 + 1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p9 <= p1)
lola: processed formula length: 10
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p9 <= p1)
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 155 markings, 192 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND A (X ((p0 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: ========================================
lola: processed formula: EF(((1 <= p6) AND AX((p0 <= p11))))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 340 markings, 467 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((3 <= p4) AND ((3 <= p14) OR (p6 <= p1))))) AND (A (G ((p12 <= p13))) OR ((p0 <= p10) OR (p13 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((3 <= p4) AND ((3 <= p14) OR (p6 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((3 <= p4) AND ((3 <= p14) OR (p6 <= p1))))
lola: processed formula length: 47
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p12 <= p13)))
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 ((p12 <= p13)))
lola: processed formula length: 20
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p13 + 1 <= p12)
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-4-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: 54 markings, 63 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= p10) OR (p13 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p0 <= p10) OR (p13 <= p3))
lola: processed formula length: 28
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p9 <= p5) AND (3 <= p10) AND (p0 <= 0)))) OR ((p7 <= p3) AND E (X ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p7 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p7 <= p3)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9 <= p5) AND (3 <= p10) AND (p0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p9 <= p5) AND (3 <= p10) AND (p0 <= 0))))
lola: processed formula length: 49
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p9 <= p5) AND (3 <= p10) AND (p0 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 99 markings, 98 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p13 <= p1)))
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 ((p13 <= p1)))
lola: processed formula length: 19
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p13 <= p1)
lola: state equation task get result unparse finished id 0
lola: sara: try reading problem file CTLCardinality-5-0.sara.
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: 49 markings, 66 edges
lola: ========================================
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 <= p3) OR (3 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p2 <= p3) OR (3 <= p9))))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 + 1 <= p2) AND (p9 <= 2))
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: 149 markings, 166 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p11) AND (p5 <= p7) AND ((2 <= p3) OR (p12 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= p11) AND (p5 <= p7) AND ((2 <= p3) OR (p12 <= p11)))))
lola: processed formula length: 68
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p11) AND (p5 <= p7) AND ((2 <= p3) OR (p12 <= p11)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 330 markings, 443 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p15 <= 1) OR (p9 + 1 <= p8)) AND (p5 + 1 <= p11) AND (p4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p15 <= 1) OR (p9 + 1 <= p8)) AND (p5 + 1 <= p11) AND (p4 <= 1))))
lola: processed formula length: 75
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p15 <= 1) OR (p9 + 1 <= p8)) AND (p5 + 1 <= p11) AND (p4 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 184 markings, 243 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p6 <= p4) AND (p14 <= p7))))))
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: ((p4 + 1 <= p6) OR (p7 + 1 <= p14))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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 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: ((p4 + 1 <= p6) OR (p7 + 1 <= p14))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
sara: place or transition ordering is non-deterministic

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: ((p6 <= p4) AND (p14 <= 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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3414106 markings, 8611734 edges, 682821 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6004769 markings, 15425183 edges, 518133 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8393280 markings, 21760152 edges, 477702 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10607866 markings, 27701405 edges, 442917 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12607132 markings, 33097384 edges, 399853 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14761641 markings, 38886328 edges, 430902 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 16998444 markings, 44913452 edges, 447361 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19218298 markings, 50959012 edges, 443971 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21441619 markings, 57037097 edges, 444664 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 23736180 markings, 63252014 edges, 458912 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 26025159 markings, 69550517 edges, 457796 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 28397771 markings, 76021520 edges, 474522 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 30665248 markings, 82234494 edges, 453495 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 32968499 markings, 88584525 edges, 460650 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 35280701 markings, 94952931 edges, 462440 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 37684974 markings, 101572592 edges, 480855 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 39986090 markings, 108009627 edges, 460223 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 42345201 markings, 114583232 edges, 471822 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44814388 markings, 121395291 edges, 493837 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 46680005 markings, 126624492 edges, 373123 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 48465812 markings, 131564364 edges, 357161 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 50118558 markings, 136164563 edges, 330549 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 51810247 markings, 140853440 edges, 338338 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 53455492 markings, 145411743 edges, 329049 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 55017333 markings, 149816619 edges, 312368 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 56595988 markings, 154250768 edges, 315731 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 58227989 markings, 158820384 edges, 326400 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 59931660 markings, 163554243 edges, 340734 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 61550261 markings, 168090881 edges, 323720 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 63227625 markings, 172811019 edges, 335473 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 65014701 markings, 177813685 edges, 357415 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 66726327 markings, 182627547 edges, 342325 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 68475517 markings, 187530837 edges, 349838 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 70205736 markings, 192366600 edges, 346044 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 71901186 markings, 197123775 edges, 339090 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 73561917 markings, 201834319 edges, 332146 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 75335215 markings, 206807882 edges, 354660 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 77026158 markings, 211571812 edges, 338189 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 78778681 markings, 216495972 edges, 350505 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 80457742 markings, 221214127 edges, 335812 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 82207155 markings, 226119944 edges, 349883 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 83942814 markings, 231003402 edges, 347132 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 85646142 markings, 235815075 edges, 340666 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 87336430 markings, 240593695 edges, 338058 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 89009708 markings, 245324727 edges, 334656 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 90754132 markings, 250256246 edges, 348885 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 92480556 markings, 255155634 edges, 345285 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 94220516 markings, 260076867 edges, 347992 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 95951504 markings, 264932803 edges, 346198 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 97675374 markings, 269784948 edges, 344774 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 99340853 markings, 274492747 edges, 333096 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 101044820 markings, 279312427 edges, 340793 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 102770204 markings, 284179629 edges, 345077 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 104494014 markings, 289012678 edges, 344762 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 106165186 markings, 293757432 edges, 334234 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 107826722 markings, 298537804 edges, 332307 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 109517839 markings, 303325501 edges, 338223 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 111251081 markings, 308202113 edges, 346648 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 113011284 markings, 313156452 edges, 352041 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 114734006 markings, 318075173 edges, 344544 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 116410416 markings, 322829199 edges, 335282 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 118116404 markings, 327658831 edges, 341198 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 119808208 markings, 332475441 edges, 338361 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 121525323 markings, 337351090 edges, 343423 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 123264359 markings, 342281179 edges, 347807 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 124989298 markings, 347186288 edges, 344988 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 126683447 markings, 352047366 edges, 338830 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 128385932 markings, 356902520 edges, 340497 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 130160975 markings, 361911047 edges, 355009 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 131836846 markings, 366650324 edges, 335174 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 133052411 markings, 370155206 edges, 243113 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 134515418 markings, 374293165 edges, 292601 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 136110402 markings, 378830062 edges, 318997 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 137712911 markings, 383360737 edges, 320502 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 139351488 markings, 388004659 edges, 327715 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 140760370 markings, 392021365 edges, 281776 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 142316629 markings, 396504629 edges, 311252 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 143969448 markings, 401226718 edges, 330564 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 145612226 markings, 405930259 edges, 328556 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 147223287 markings, 410539755 edges, 322212 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 148910391 markings, 415332329 edges, 337421 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 150376994 markings, 419496275 edges, 293321 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 151238270 markings, 421972557 edges, 172255 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 151851538 markings, 423721887 edges, 122654 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 152378677 markings, 425218048 edges, 105428 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 152888980 markings, 426652667 edges, 102061 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 153378463 markings, 428032334 edges, 97897 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 153913782 markings, 429552170 edges, 107064 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 154396430 markings, 430940436 edges, 96530 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 154856642 markings, 432255123 edges, 92042 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 155376677 markings, 433752040 edges, 104007 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 155787377 markings, 434918741 edges, 82140 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 156230749 markings, 436172985 edges, 88674 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 156768384 markings, 437718250 edges, 107527 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 157193887 markings, 438958602 edges, 85101 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 157690959 markings, 440377129 edges, 99414 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 158054978 markings, 441417656 edges, 72804 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 158570231 markings, 442881146 edges, 103051 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 159074145 markings, 444315016 edges, 100783 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 159627659 markings, 445881528 edges, 110703 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 160014355 markings, 446988230 edges, 77339 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 160475987 markings, 448302684 edges, 92326 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 160894741 markings, 449489945 edges, 83751 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 161370747 markings, 450838170 edges, 95201 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 161586511 markings, 451468952 edges, 43153 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 161655477 markings, 451674587 edges, 13793 markings/sec, 525 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((3 <= p11))) U ((p12 + 1 <= p5) AND (p12 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((3 <= p11)) U ((p12 + 1 <= p5) AND (p12 <= 2)))
lola: processed formula length: 52
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10485 markings, 22089 edges
lola: ========================================
lola: subprocess 11 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p12 <= p10) OR (p9 <= p8))) U A (G ((2 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((p12 <= p10) OR (p9 <= p8))) U AG((2 <= p9)))
lola: processed formula length: 50
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19685 markings, 30803 edges
lola: ========================================
lola: subprocess 12 will run for 1010 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 + 1 <= p13) AND (A (G ((p10 <= 2))) AND A (((p0 <= p3) U (p2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1010 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p7 + 1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p7 + 1 <= p13)
lola: processed formula length: 15
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p10 <= 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 ((p10 <= 2)))
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p9 <= 0))) AND ((p1 <= p3) AND ((p14 <= p13) AND E (((p8 <= p15) U (p5 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p13)
lola: processed formula length: 12
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 3030 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p3)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p8 <= p15) U (p5 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p8 <= p15) U (p5 <= p0)))
lola: processed formula length: 30
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 <= p0)
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 /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 3030 seconds at most (--localtimelimit=0)
lola: ========================================


lola: ...considering subproblem: (A (G (((p8 <= p0) AND (1 <= p0)))) OR (A (G ((p13 + 1 <= p5))) OR ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3030 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p8 <= p0) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p8 <= p0) AND (1 <= p0))))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))
lola: processed formula length: 88
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p6 <= p4) AND (p14 <= p7))))))
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: ((p4 + 1 <= p6) OR (p7 + 1 <= p14))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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 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: ((p4 + 1 <= p6) OR (p7 + 1 <= p14))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6 <= p4) AND (p14 <= 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-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLCardinality-15-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3751459 markings, 9487944 edges, 750292 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6730874 markings, 17343991 edges, 595883 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9357291 markings, 24384320 edges, 525283 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12020832 markings, 31519146 edges, 532708 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14624270 markings, 38510745 edges, 520688 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17142956 markings, 45301836 edges, 503737 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 19494904 markings, 51709414 edges, 470390 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21818052 markings, 58056805 edges, 464630 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 24209418 markings, 64544469 edges, 478273 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26448305 markings, 70712400 edges, 447777 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28765948 markings, 77023416 edges, 463529 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 31010259 markings, 83175321 edges, 448862 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33212693 markings, 89253013 edges, 440487 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35356943 markings, 95167047 edges, 428850 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37546723 markings, 101197181 edges, 437956 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39657087 markings, 107089219 edges, 422073 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41748914 markings, 112919442 edges, 418365 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43904982 markings, 118894492 edges, 431214 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 45986020 markings, 124675257 edges, 416208 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48105203 markings, 130567251 edges, 423837 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 50214961 markings, 136431805 edges, 421952 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 52358073 markings, 142377699 edges, 428622 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 54416197 markings, 148132525 edges, 411625 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 56477258 markings, 153921865 edges, 412212 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 58549658 markings, 159704716 edges, 414480 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 60634060 markings, 165530945 edges, 416880 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 62678477 markings, 171270801 edges, 408883 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 64803761 markings, 177216775 edges, 425057 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 66870733 markings, 183040608 edges, 413394 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 68971588 markings, 188918396 edges, 420171 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 70981106 markings, 194548714 edges, 401904 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 72987850 markings, 200190776 edges, 401349 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 75008985 markings, 205890324 edges, 404227 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 77041598 markings, 211613111 edges, 406523 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 79106308 markings, 217432819 edges, 412942 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 81117689 markings, 223077526 edges, 402276 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 83159862 markings, 228792301 edges, 408435 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 85188350 markings, 234528945 edges, 405698 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 87219194 markings, 240271798 edges, 406169 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 89242194 markings, 245966957 edges, 404600 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 91265229 markings, 251709785 edges, 404607 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 93280692 markings, 257426998 edges, 403093 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 95322633 markings, 263168035 edges, 408388 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 97364987 markings, 268898034 edges, 408471 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 99359560 markings, 274547290 edges, 398915 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 101375544 markings, 280255727 edges, 403197 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 103399871 markings, 285930889 edges, 404865 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 105426335 markings, 291626995 edges, 405293 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 107376821 markings, 297243472 edges, 390097 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 109341954 markings, 302835443 edges, 393027 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 111368855 markings, 308539420 edges, 405380 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 113390387 markings, 314249205 edges, 404306 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 115416106 markings, 320006551 edges, 405144 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 117401457 markings, 325648112 edges, 397070 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 119420940 markings, 331369116 edges, 403897 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 121410392 markings, 337029789 edges, 397890 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 123443396 markings, 342787099 edges, 406601 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 125437843 markings, 348471247 edges, 398889 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 127419145 markings, 354158503 edges, 396260 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 129419400 markings, 359814357 edges, 400051 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 130359890 markings, 362475090 edges, 188098 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 131916672 markings, 366876396 edges, 311356 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 132759261 markings, 369327998 edges, 168518 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 133296009 markings, 370853568 edges, 107350 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 134020673 markings, 372899676 edges, 144933 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 135255773 markings, 376401736 edges, 247020 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 137070928 markings, 381551121 edges, 363031 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 138448940 markings, 385436415 edges, 275602 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 139967743 markings, 389761496 edges, 303761 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 141113968 markings, 393014383 edges, 229245 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 141783291 markings, 394953252 edges, 133865 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 143436300 markings, 399721024 edges, 330602 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 144438499 markings, 402575077 edges, 200440 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 145415738 markings, 405360654 edges, 195448 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 146319965 markings, 407956249 edges, 180845 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 147544738 markings, 411453293 edges, 244955 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 148085492 markings, 412979180 edges, 108151 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 149253472 markings, 416310809 edges, 233596 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 149921739 markings, 418197118 edges, 133653 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 151076867 markings, 421510906 edges, 231026 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 152606346 markings, 425854793 edges, 305896 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 152628909 markings, 425920031 edges, 4513 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 153002217 markings, 426969813 edges, 74662 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 154623528 markings, 431586130 edges, 324262 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 156054747 markings, 435678053 edges, 286244 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 157087973 markings, 438650758 edges, 206645 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 157113211 markings, 438725347 edges, 5048 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 158146448 markings, 441683811 edges, 206647 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 158596203 markings, 442958250 edges, 89951 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 158998976 markings, 444108443 edges, 80555 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 159682514 markings, 446039835 edges, 136708 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 160556306 markings, 448526653 edges, 174758 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 161095743 markings, 450057135 edges, 107887 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 161411107 markings, 450960057 edges, 63073 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 161515265 markings, 451264592 edges, 20832 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 161563741 markings, 451401596 edges, 9695 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 161563741 markings, 451401596 edges, 0 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 161614079 markings, 451546407 edges, 10068 markings/sec, 485 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((p9 <= 0))) AND ((p1 <= p3) AND ((p14 <= p13) AND E (((p8 <= p15) U (p5 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p14 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p13)
lola: processed formula length: 12
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: (p1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p3)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p9 <= 0)))
lola: processed formula length: 17
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p9 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 121 markings, 120 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((p8 <= p15) U (p5 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p8 <= p15) U (p5 <= p0)))
lola: processed formula length: 30
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 <= p0)
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 /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
sara: try reading problem file CTLCardinality-19-0.sara.
sara: try reading problem file CTLCardinality-18-0.sara.
lola: ...considering subproblem: (A (G (((p8 <= p0) AND (1 <= p0)))) OR (A (G ((p13 + 1 <= p5))) OR ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((p8 <= p0) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p8 <= p0) AND (1 <= p0))))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 + 1 <= p8) OR (p0 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p13 + 1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p13 + 1 <= p5)))
lola: processed formula length: 23
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 <= p13)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p8) AND (2 <= p4) AND ((1 <= p4) OR (3 <= p6) OR ((p7 <= p15) AND (2 <= p11))))
lola: processed formula length: 88
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic




lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no unknown yes no yes yes yes yes yes no no yes
lola:
preliminary result: yes no no no unknown yes no yes yes yes yes yes no no yes
lola: memory consumption: 3784 KB
lola: time consumption: 1035 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="Kanban-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 Kanban-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 r184-oct2-158987928600499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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