Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882400443.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Diffusion2D-PT-D10N150, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882400443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 4.2K Mar 31 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 29 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 255K 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 Diffusion2D-PT-D10N150-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D10N150-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591221167125

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:52:48] [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 21:52:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:52:48] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2020-06-03 21:52:48] [INFO ] Transformed 100 places.
[2020-06-03 21:52:48] [INFO ] Transformed 684 transitions.
[2020-06-03 21:52:48] [INFO ] Parsed PT model containing 100 places and 684 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Incomplete random walk after 100103 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=2383 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1]
// Phase 1: matrix 684 rows 100 cols
[2020-06-03 21:52:48] [INFO ] Computed 1 place invariants in 13 ms
[2020-06-03 21:52:49] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2020-06-03 21:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:52:49] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-06-03 21:52:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:52:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 21:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:52:49] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-03 21:52:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 50 ms.
[2020-06-03 21:53:03] [INFO ] Added : 595 causal constraints over 119 iterations in 14117 ms. Result :sat
[2020-06-03 21:53:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned unsat
[2020-06-03 21:53:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2020-06-03 21:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:03] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-03 21:53:03] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 50 ms.
[2020-06-03 21:53:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:53:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2020-06-03 21:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:04] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2020-06-03 21:53:04] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 61 ms.
[2020-06-03 21:53:18] [INFO ] Added : 610 causal constraints over 122 iterations in 14616 ms. Result :sat
[2020-06-03 21:53:18] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2020-06-03 21:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:19] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-03 21:53:19] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 55 ms.
[2020-06-03 21:53:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:53:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2020-06-03 21:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:19] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2020-06-03 21:53:19] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 44 ms.
[2020-06-03 21:53:32] [INFO ] Added : 605 causal constraints over 121 iterations in 13477 ms. Result :sat
[2020-06-03 21:53:32] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2020-06-03 21:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:33] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-03 21:53:33] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 44 ms.
[2020-06-03 21:53:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:53:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2020-06-03 21:53:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:33] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-06-03 21:53:33] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 43 ms.
[2020-06-03 21:53:48] [INFO ] Added : 668 causal constraints over 134 iterations in 15234 ms. Result :sat
[2020-06-03 21:53:48] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2020-06-03 21:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:49] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-03 21:53:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 44 ms.
[2020-06-03 21:53:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:53:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2020-06-03 21:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:53:49] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 21:53:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 55 ms.
[2020-06-03 21:54:01] [INFO ] Added : 590 causal constraints over 118 iterations in 12100 ms. Result :sat
[2020-06-03 21:54:01] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2020-06-03 21:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:01] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-03 21:54:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:54:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 21:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:01] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-03 21:54:01] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 44 ms.
[2020-06-03 21:54:21] [INFO ] Added : 668 causal constraints over 134 iterations in 19136 ms. Result :sat
[2020-06-03 21:54:21] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2020-06-03 21:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:21] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 21:54:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 54 ms.
[2020-06-03 21:54:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:54:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 21:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:21] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2020-06-03 21:54:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 69 ms.
[2020-06-03 21:54:37] [INFO ] Added : 668 causal constraints over 134 iterations in 15587 ms. Result :sat
[2020-06-03 21:54:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2020-06-03 21:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:37] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 21:54:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:54:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2020-06-03 21:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:37] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-03 21:54:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 45 ms.
[2020-06-03 21:54:53] [INFO ] Added : 668 causal constraints over 134 iterations in 15455 ms. Result :sat
[2020-06-03 21:54:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2020-06-03 21:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:53] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 21:54:53] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 46 ms.
[2020-06-03 21:54:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:54:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2020-06-03 21:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:54:53] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-03 21:54:53] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints in 43 ms.
[2020-06-03 21:55:04] [INFO ] Added : 590 causal constraints over 118 iterations in 10897 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 21:55:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 21:55:04] [INFO ] Flatten gal took : 90 ms
[2020-06-03 21:55:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 21:55:04] [INFO ] Flatten gal took : 34 ms
FORMULA Diffusion2D-PT-D10N150-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:55:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 21:55:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D10N150 @ 3570 seconds

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N150-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2516
rslt: Output for CTLCardinality @ Diffusion2D-PT-D10N150

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 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": "(p35 + 1 <= p79)",
"processed_size": 16,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 32
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((p5 <= p37))",
"processed_size": 15,
"rewrites": 12
},
"net":
{
"conflict_clusters": 100,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p12)))",
"processed_size": 18,
"rewrites": 12
},
"result":
{
"edges": 4603,
"markings": 1471,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

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

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

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

{
"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": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p22 <= p96) AND (2 <= p1))))",
"processed_size": 36,
"rewrites": 12
},
"result":
{
"edges": 215,
"markings": 83,
"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": 2,
"problems": 2
},
"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": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p6 <= 1) OR (p20 <= 0) OR ((p61 <= 2) AND (p6 <= 1)))))",
"processed_size": 65,
"rewrites": 13
},
"result":
{
"edges": 90,
"markings": 48,
"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": 6,
"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": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((p81 + 1 <= p82) AND (p23 + 1 <= p61) AND (p74 + 1 <= p38))))",
"processed_size": 68,
"rewrites": 12
},
"result":
{
"edges": 1071,
"markings": 359,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((2 <= p46) AND (p97 <= p69))",
"processed_size": 29,
"rewrites": 14
},
"result":
{
"edges": 315,
"markings": 313,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 609
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E(EF((1 <= p14)) U ((p45 <= p11) AND (1 <= p32) AND (p30 + 1 <= p47)))",
"processed_size": 70,
"rewrites": 13
},
"net":
{
"conflict_clusters": 100,
"singleton_clusters": 0
},
"result":
{
"edges": 25423186,
"markings": 3027387,
"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": 754
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 754
},
"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": "(p94 + 1 <= p1)",
"processed_size": 15,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1006
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p59 <= 2) OR (p55 <= 1))))",
"processed_size": 35,
"rewrites": 13
},
"result":
{
"edges": 365,
"markings": 143,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1006
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F ((p34 + 1 <= p9)) OR ((p28 <= p94) OR (p63 <= p61))))",
"processed_size": 59,
"rewrites": 23
},
"result":
{
"edges": 49456,
"markings": 23022,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p69 <= p79) OR (p50 <= p39) OR (p39 + 1 <= p23))))",
"processed_size": 60,
"rewrites": 13
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((2 <= p18) U (1 <= p8)))",
"processed_size": 28,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((2 <= p18) U (1 <= p8)))",
"processed_size": 28,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p61 <= 0) OR (p21 <= p62) OR (p96 <= p81))))",
"processed_size": 54,
"rewrites": 13
},
"result":
{
"edges": 1866,
"markings": 633,
"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"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3944,
"runtime": 1054.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((E(F(**)) U **)) : E((** U A(G(**)))) : (A(G(**)) OR (A((** U **)) AND **)) : E(F(**)) : (A(F(**)) AND (E(X(**)) OR (E(F(**)) AND A(X(**))))) : A(G(*)) : E(F(E(G(**)))) : E(F(**)) : E(F(*)) : (** OR A(G(*))) : E(F(**)) : E(F((E(G(**)) AND (** AND **)))) : E(F(**)) : (A(G(**)) OR (A((** U **)) AND A((** U **)))) : E(F(**))"
},
"net":
{
"arcs": 1368,
"conflict_clusters": 100,
"places": 100,
"places_significant": 99,
"singleton_clusters": 0,
"transitions": 684
},
"result":
{
"preliminary_value": "yes unknown no yes yes no yes yes yes no yes yes yes no yes ",
"value": "yes unknown no yes yes no yes yes yes no yes yes yes 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: 784/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 684 transitions, 99 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 ((E (F ((1 <= p14))) U ((p45 <= p11) AND (1 <= p32) AND (p30 + 1 <= p47)))) : E ((((p15 <= 2) OR (3 <= p54)) U A (G ((1 <= p62))))) : (A (G (((p69 <= p79) OR (p50 <= p39) OR (p39 + 1 <= p23)))) OR (A (((p10 <= p79) U (2 <= p9))) AND (1 <= p62))) : A (F (E (F (((3 <= p68) OR (2 <= p91)))))) : (A (F ((p79 <= p35))) AND (E (X (((p74 <= p56) AND (3 <= p76)))) OR (E (F ((2 <= p17))) AND A (X ((p5 <= p37)))))) : NOT(E (F (((2 <= p6) AND (1 <= p20) AND ((3 <= p61) OR (2 <= p6)))))) : E (F (E (G (((2 <= p46) AND (p97 <= p69)))))) : E (F ((3 <= p12))) : NOT(A (G (((p5 <= 0) OR (p17 <= 2))))) : ((p94 + 1 <= p1) OR NOT(E (F (((3 <= p59) AND (2 <= p55)))))) : E (F (((p81 + 1 <= p82) AND (p23 + 1 <= p61) AND (p74 + 1 <= p38)))) : E (F (((E (G ((p9 <= p34))) AND (p94 + 1 <= p28)) AND (p61 + 1 <= p63)))) : E (F (((p22 <= p96) AND (2 <= p1)))) : (A (G (((p61 <= 0) OR (p21 <= p62) OR (p96 <= p81)))) OR (A (((2 <= p90) U (p7 <= p37))) AND A (((2 <= p18) U (1 <= p8))))) : E (F ((3 <= p78)))
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p79 <= p35))) AND (E (X (((p74 <= p56) AND (3 <= p76)))) OR (E (F ((2 <= p17))) AND A (X ((p5 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p79 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p35 + 1 <= p79)
lola: processed formula length: 16
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p79 <= p35)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p17)))
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 <= p17)))
lola: processed formula length: 18
lola: 12 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 <= p17)
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: 93 markings, 227 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p5 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p5 <= p37))
lola: processed formula length: 15
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p12)))
lola: processed formula length: 18
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= 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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1471 markings, 4603 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p78)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p78)))
lola: processed formula length: 18
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p78)
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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p5) AND (3 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p5) AND (3 <= p17))))
lola: processed formula length: 34
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (3 <= p17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 961 markings, 2852 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p68) OR (2 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p68) OR (2 <= p91))))
lola: processed formula length: 35
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p68) OR (2 <= p91))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= p96) AND (2 <= 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 (((p22 <= p96) AND (2 <= p1))))
lola: processed formula length: 36
lola: 12 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: ((p22 <= p96) AND (2 <= p1))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 215 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6 <= 1) OR (p20 <= 0) OR ((p61 <= 2) AND (p6 <= 1)))))
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 (((p6 <= 1) OR (p20 <= 0) OR ((p61 <= 2) AND (p6 <= 1)))))
lola: processed formula length: 65
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p6) AND (1 <= p20) AND ((3 <= p61) OR (2 <= p6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 48 markings, 90 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p81 + 1 <= p82) AND (p23 + 1 <= p61) AND (p74 + 1 <= p38))))
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 (((p81 + 1 <= p82) AND (p23 + 1 <= p61) AND (p74 + 1 <= p38))))
lola: processed formula length: 68
lola: 12 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: ((p81 + 1 <= p82) AND (p23 + 1 <= p61) AND (p74 + 1 <= p38))
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: 359 markings, 1071 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((2 <= p46) AND (p97 <= p69))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((2 <= p46) AND (p97 <= p69))
lola: processed formula length: 29
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
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 1
lola: formula 1: ((2 <= p46) AND (p97 <= p69))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p46 <= 1) OR (p69 + 1 <= p97))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 313 markings, 315 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p15 <= 2) OR (3 <= p54)) U A (G ((1 <= p62)))))
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(((p15 <= 2) OR (3 <= p54)) U AG((1 <= p62)))
lola: processed formula length: 47
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 862125 markings, 4173940 edges, 172425 markings/sec, 0 secs
lola: 1810336 markings, 8737551 edges, 189642 markings/sec, 5 secs
lola: 2819611 markings, 13596037 edges, 201855 markings/sec, 10 secs
lola: 3879234 markings, 18691043 edges, 211925 markings/sec, 15 secs
lola: 4911621 markings, 23652127 edges, 206477 markings/sec, 20 secs
lola: 5920763 markings, 28500548 edges, 201828 markings/sec, 25 secs
lola: 6844213 markings, 32927640 edges, 184690 markings/sec, 30 secs
lola: 7695282 markings, 37015177 edges, 170214 markings/sec, 35 secs
lola: 8595493 markings, 41339029 edges, 180042 markings/sec, 40 secs
lola: 9495186 markings, 45660656 edges, 179939 markings/sec, 45 secs
lola: 10434690 markings, 50172325 edges, 187901 markings/sec, 50 secs
lola: 11282457 markings, 54245115 edges, 169553 markings/sec, 55 secs
lola: 12150010 markings, 58377523 edges, 173511 markings/sec, 60 secs
lola: 12981600 markings, 62289409 edges, 166318 markings/sec, 65 secs
lola: 13839607 markings, 66331588 edges, 171601 markings/sec, 70 secs
lola: 14763922 markings, 70670259 edges, 184863 markings/sec, 75 secs
lola: 15680307 markings, 74980340 edges, 183277 markings/sec, 80 secs
lola: 16484567 markings, 78730241 edges, 160852 markings/sec, 85 secs
lola: 17283367 markings, 82458758 edges, 159760 markings/sec, 90 secs
lola: 18093313 markings, 86241290 edges, 161989 markings/sec, 95 secs
lola: 18917996 markings, 90107455 edges, 164937 markings/sec, 100 secs
lola: 19753516 markings, 94046682 edges, 167104 markings/sec, 105 secs
lola: 20597492 markings, 98004440 edges, 168795 markings/sec, 110 secs
lola: 21480776 markings, 102169493 edges, 176657 markings/sec, 115 secs
lola: 22369817 markings, 106338849 edges, 177808 markings/sec, 120 secs
lola: 23246203 markings, 110432175 edges, 175277 markings/sec, 125 secs
lola: 24084488 markings, 114363658 edges, 167657 markings/sec, 130 secs
lola: 24922113 markings, 118279060 edges, 167525 markings/sec, 135 secs
lola: 25767634 markings, 122219855 edges, 169104 markings/sec, 140 secs
lola: 26655013 markings, 126364720 edges, 177476 markings/sec, 145 secs
lola: 27534896 markings, 130474325 edges, 175977 markings/sec, 150 secs
lola: 28417301 markings, 134605783 edges, 176481 markings/sec, 155 secs
lola: 29300088 markings, 138739055 edges, 176557 markings/sec, 160 secs
lola: 30193674 markings, 142933201 edges, 178717 markings/sec, 165 secs
lola: 31062241 markings, 146959634 edges, 173713 markings/sec, 170 secs
lola: 31937843 markings, 151042014 edges, 175120 markings/sec, 175 secs
lola: 32767376 markings, 154883510 edges, 165907 markings/sec, 180 secs
lola: 33580863 markings, 158663030 edges, 162697 markings/sec, 185 secs
lola: 34446805 markings, 162677665 edges, 173188 markings/sec, 190 secs
lola: 35321302 markings, 166747383 edges, 174899 markings/sec, 195 secs
lola: 36191639 markings, 170815332 edges, 174067 markings/sec, 200 secs
lola: 37055187 markings, 174835805 edges, 172710 markings/sec, 205 secs
lola: 37944809 markings, 178997557 edges, 177924 markings/sec, 210 secs
lola: 38814959 markings, 183053147 edges, 174030 markings/sec, 215 secs
lola: 39661251 markings, 186976666 edges, 169258 markings/sec, 220 secs
lola: 40396398 markings, 190386462 edges, 147029 markings/sec, 225 secs
lola: 41147492 markings, 193871804 edges, 150219 markings/sec, 230 secs
lola: 41900757 markings, 197376330 edges, 150653 markings/sec, 235 secs
lola: 42695302 markings, 201069644 edges, 158909 markings/sec, 240 secs
lola: 43541860 markings, 204995296 edges, 169312 markings/sec, 245 secs
lola: 44318490 markings, 208605729 edges, 155326 markings/sec, 250 secs
lola: 45075345 markings, 212107756 edges, 151371 markings/sec, 255 secs
lola: 45857854 markings, 215743609 edges, 156502 markings/sec, 260 secs
lola: 46691488 markings, 219615801 edges, 166727 markings/sec, 265 secs
lola: 47442421 markings, 223087240 edges, 150187 markings/sec, 270 secs
lola: 48203958 markings, 226620749 edges, 152307 markings/sec, 275 secs
lola: 48979998 markings, 230227775 edges, 155208 markings/sec, 280 secs
lola: 49831364 markings, 234182270 edges, 170273 markings/sec, 285 secs
lola: 50604593 markings, 237788970 edges, 154646 markings/sec, 290 secs
lola: 51465858 markings, 241789693 edges, 172253 markings/sec, 295 secs
lola: 52318489 markings, 245731705 edges, 170526 markings/sec, 300 secs
lola: 53195387 markings, 249840790 edges, 175380 markings/sec, 305 secs
lola: 53944448 markings, 253354183 edges, 149812 markings/sec, 310 secs
lola: 54702862 markings, 256899074 edges, 151683 markings/sec, 315 secs
lola: 55438364 markings, 260277704 edges, 147100 markings/sec, 320 secs
lola: 56200171 markings, 263800859 edges, 152361 markings/sec, 325 secs
lola: 57000918 markings, 267533712 edges, 160149 markings/sec, 330 secs
lola: 57840845 markings, 271449831 edges, 167985 markings/sec, 335 secs
lola: 58661640 markings, 275259498 edges, 164159 markings/sec, 340 secs
lola: 59492641 markings, 279130913 edges, 166200 markings/sec, 345 secs
lola: 60326533 markings, 283012102 edges, 166778 markings/sec, 350 secs
lola: 61162057 markings, 286887993 edges, 167105 markings/sec, 355 secs
lola: 61979313 markings, 290698634 edges, 163451 markings/sec, 360 secs
lola: 62769776 markings, 294356475 edges, 158093 markings/sec, 365 secs
lola: 63611945 markings, 298264646 edges, 168434 markings/sec, 370 secs
lola: 64460810 markings, 302224298 edges, 169773 markings/sec, 375 secs
lola: 65156032 markings, 305452551 edges, 139044 markings/sec, 380 secs
lola: 65983618 markings, 309300827 edges, 165517 markings/sec, 385 secs
lola: 66644487 markings, 312383405 edges, 132174 markings/sec, 390 secs
lola: 67206755 markings, 314997040 edges, 112454 markings/sec, 395 secs
lola: 67982106 markings, 318588221 edges, 155070 markings/sec, 400 secs
lola: 68798104 markings, 322395767 edges, 163200 markings/sec, 405 secs
lola: 69211052 markings, 324327062 edges, 82590 markings/sec, 410 secs
lola: 69820530 markings, 327154070 edges, 121896 markings/sec, 415 secs
lola: 70593494 markings, 330756324 edges, 154593 markings/sec, 420 secs
lola: 71283394 markings, 333945080 edges, 137980 markings/sec, 425 secs
lola: 71991604 markings, 337241861 edges, 141642 markings/sec, 430 secs
lola: 72745298 markings, 340717754 edges, 150739 markings/sec, 435 secs
lola: 73359530 markings, 343566021 edges, 122846 markings/sec, 440 secs
lola: 74063941 markings, 346833195 edges, 140882 markings/sec, 445 secs
lola: 74582896 markings, 349243646 edges, 103791 markings/sec, 450 secs
lola: 75085226 markings, 351565334 edges, 100466 markings/sec, 455 secs
lola: 75610155 markings, 354006588 edges, 104986 markings/sec, 460 secs
lola: 76270746 markings, 357067217 edges, 132118 markings/sec, 465 secs
lola: 76800644 markings, 359534286 edges, 105980 markings/sec, 470 secs
lola: 77322035 markings, 361954148 edges, 104278 markings/sec, 475 secs
lola: 77828940 markings, 364306040 edges, 101381 markings/sec, 480 secs
lola: 78331386 markings, 366638259 edges, 100489 markings/sec, 485 secs
lola: 78857465 markings, 369074752 edges, 105216 markings/sec, 490 secs
lola: 79330374 markings, 371277194 edges, 94582 markings/sec, 495 secs
lola: 79818832 markings, 373556350 edges, 97692 markings/sec, 500 secs
lola: 80126596 markings, 374996202 edges, 61553 markings/sec, 505 secs
lola: 80203800 markings, 375354039 edges, 15441 markings/sec, 510 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= p14))) U ((p45 <= p11) AND (1 <= p32) AND (p30 + 1 <= p47))))
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((1 <= p14)) U ((p45 <= p11) AND (1 <= p32) AND (p30 + 1 <= p47)))
lola: processed formula length: 70
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 580503 markings, 4862947 edges, 116101 markings/sec, 0 secs
lola: 1164033 markings, 9744821 edges, 116706 markings/sec, 5 secs
lola: 1695528 markings, 14236759 edges, 106299 markings/sec, 10 secs
lola: 2224391 markings, 18677791 edges, 105773 markings/sec, 15 secs
lola: 2789146 markings, 23424333 edges, 112951 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3027387 markings, 25423186 edges
lola: ========================================
lola: subprocess 11 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p94 + 1 <= p1) OR A (G (((p59 <= 2) OR (p55 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p94 + 1 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p94 + 1 <= p1)
lola: processed formula length: 15
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p59 <= 2) OR (p55 <= 1))))
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 (((p59 <= 2) OR (p55 <= 1))))
lola: processed formula length: 35
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((3 <= p59) AND (2 <= p55))
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: 143 markings, 365 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p9 <= p34))) AND ((p94 + 1 <= p28) AND (p61 + 1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p34 + 1 <= p9)) OR ((p28 <= p94) OR (p63 <= p61))))
lola: processed formula length: 59
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 23022 markings, 49456 edges
lola: ========================================
lola: subprocess 13 will run for 1509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p69 <= p79) OR (p50 <= p39) OR (p39 + 1 <= p23)))) OR (A (((p10 <= p79) U (2 <= p9))) AND (1 <= p62)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p62)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p62)
lola: processed formula length: 10
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 3018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p69 <= p79) OR (p50 <= p39) OR (p39 + 1 <= p23))))
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 (((p69 <= p79) OR (p50 <= p39) OR (p39 + 1 <= p23))))
lola: processed formula length: 60
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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: ((p79 + 1 <= p69) AND (p39 + 1 <= p50) AND (p23 <= p39))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 3018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p61 <= 0) OR (p21 <= p62) OR (p96 <= p81)))) OR (A (((2 <= p90) U (p7 <= p37))) AND A (((2 <= p18) U (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p18) U (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((2 <= p18) U (1 <= p8)))
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p18)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p15 <= 2) OR (3 <= p54)) U A (G ((1 <= p62)))))
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(((p15 <= 2) OR (3 <= p54)) U AG((1 <= p62)))
lola: processed formula length: 47
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 988301 markings, 4781536 edges, 197660 markings/sec, 0 secs
lola: 1997498 markings, 9639307 edges, 201839 markings/sec, 5 secs
lola: 2889830 markings, 13933874 edges, 178466 markings/sec, 10 secs
lola: 3802013 markings, 18318632 edges, 182437 markings/sec, 15 secs
lola: 4677629 markings, 22526011 edges, 175123 markings/sec, 20 secs
lola: 5545024 markings, 26695451 edges, 173479 markings/sec, 25 secs
lola: 6493753 markings, 31240774 edges, 189746 markings/sec, 30 secs
lola: 7455323 markings, 35861242 edges, 192314 markings/sec, 35 secs
lola: 8386289 markings, 40334679 edges, 186193 markings/sec, 40 secs
lola: 9376297 markings, 45089286 edges, 198002 markings/sec, 45 secs
lola: 10362936 markings, 49828849 edges, 197328 markings/sec, 50 secs
lola: 11348534 markings, 54562607 edges, 197120 markings/sec, 55 secs
lola: 12313449 markings, 59152296 edges, 192983 markings/sec, 60 secs
lola: 13199754 markings, 63319131 edges, 177261 markings/sec, 65 secs
lola: 14095517 markings, 67531369 edges, 179153 markings/sec, 70 secs
lola: 15016986 markings, 71859018 edges, 184294 markings/sec, 75 secs
lola: 15924326 markings, 76112800 edges, 181468 markings/sec, 80 secs
lola: 16825777 markings, 80334506 edges, 180290 markings/sec, 85 secs
lola: 17709743 markings, 84454865 edges, 176793 markings/sec, 90 secs
lola: 18539951 markings, 88316834 edges, 166042 markings/sec, 95 secs
lola: 19460709 markings, 92659116 edges, 184152 markings/sec, 100 secs
lola: 20361649 markings, 96901510 edges, 180188 markings/sec, 105 secs
lola: 21240370 markings, 101023488 edges, 175744 markings/sec, 110 secs
lola: 22149533 markings, 105312013 edges, 181833 markings/sec, 115 secs
lola: 22976045 markings, 109175565 edges, 165302 markings/sec, 120 secs
lola: 23739130 markings, 112740481 edges, 152617 markings/sec, 125 secs
lola: 24551787 markings, 116558484 edges, 162531 markings/sec, 130 secs
lola: 25316052 markings, 120106809 edges, 152853 markings/sec, 135 secs
lola: 26079226 markings, 123674629 edges, 152635 markings/sec, 140 secs
lola: 26859039 markings, 127316432 edges, 155963 markings/sec, 145 secs
lola: 27656694 markings, 131050896 edges, 159531 markings/sec, 150 secs
lola: 28522874 markings, 135103334 edges, 173236 markings/sec, 155 secs
lola: 29395054 markings, 139184390 edges, 174436 markings/sec, 160 secs
lola: 30280778 markings, 143345222 edges, 177145 markings/sec, 165 secs
lola: 31136859 markings, 147303619 edges, 171216 markings/sec, 170 secs
lola: 32006948 markings, 151365581 edges, 174018 markings/sec, 175 secs
lola: 32858935 markings, 155306938 edges, 170397 markings/sec, 180 secs
lola: 33711599 markings, 159270686 edges, 170533 markings/sec, 185 secs
lola: 34571604 markings, 163265614 edges, 172001 markings/sec, 190 secs
lola: 35428553 markings, 167244014 edges, 171390 markings/sec, 195 secs
lola: 36276315 markings, 171209241 edges, 169552 markings/sec, 200 secs
lola: 37113761 markings, 175114057 edges, 167489 markings/sec, 205 secs
lola: 37958363 markings, 179061282 edges, 168920 markings/sec, 210 secs
lola: 38798356 markings, 182974972 edges, 167999 markings/sec, 215 secs
lola: 39636130 markings, 186857939 edges, 167555 markings/sec, 220 secs
lola: 40475128 markings, 190745202 edges, 167800 markings/sec, 225 secs
lola: 41330919 markings, 194719380 edges, 171158 markings/sec, 230 secs
lola: 42183861 markings, 198686578 edges, 170588 markings/sec, 235 secs
lola: 43031394 markings, 202633208 edges, 169507 markings/sec, 240 secs
lola: 43877902 markings, 206570925 edges, 169302 markings/sec, 245 secs
lola: 44722699 markings, 210475534 edges, 168959 markings/sec, 250 secs
lola: 45576133 markings, 214434570 edges, 170687 markings/sec, 255 secs
lola: 46442400 markings, 218461968 edges, 173253 markings/sec, 260 secs
lola: 47279677 markings, 222338901 edges, 167455 markings/sec, 265 secs
lola: 48112835 markings, 226193033 edges, 166632 markings/sec, 270 secs
lola: 48954299 markings, 230107205 edges, 168293 markings/sec, 275 secs
lola: 49793803 markings, 234006479 edges, 167901 markings/sec, 280 secs
lola: 50640919 markings, 237959727 edges, 169423 markings/sec, 285 secs
lola: 51470577 markings, 241811948 edges, 165932 markings/sec, 290 secs
lola: 52294876 markings, 245619889 edges, 164860 markings/sec, 295 secs
lola: 53155689 markings, 249652870 edges, 172163 markings/sec, 300 secs
lola: 53999037 markings, 253607831 edges, 168670 markings/sec, 305 secs
lola: 54830617 markings, 257487309 edges, 166316 markings/sec, 310 secs
lola: 55648387 markings, 261251692 edges, 163554 markings/sec, 315 secs
lola: 56457619 markings, 264990140 edges, 161846 markings/sec, 320 secs
lola: 57335039 markings, 269100978 edges, 175484 markings/sec, 325 secs
lola: 58180841 markings, 273023198 edges, 169160 markings/sec, 330 secs
lola: 59028967 markings, 276971838 edges, 169625 markings/sec, 335 secs
lola: 59884631 markings, 280953663 edges, 171133 markings/sec, 340 secs
lola: 60726243 markings, 284864954 edges, 168322 markings/sec, 345 secs
lola: 61513876 markings, 288528397 edges, 157527 markings/sec, 350 secs
lola: 62241246 markings, 291906111 edges, 145474 markings/sec, 355 secs
lola: 62979869 markings, 295331865 edges, 147725 markings/sec, 360 secs
lola: 63819961 markings, 299243025 edges, 168018 markings/sec, 365 secs
lola: 64649698 markings, 303091534 edges, 165947 markings/sec, 370 secs
lola: 65442538 markings, 306786506 edges, 158568 markings/sec, 375 secs
lola: 66290578 markings, 310740184 edges, 169608 markings/sec, 380 secs
lola: 67038891 markings, 314216860 edges, 149663 markings/sec, 385 secs
lola: 67742198 markings, 317492394 edges, 140661 markings/sec, 390 secs
lola: 68516924 markings, 321085922 edges, 154945 markings/sec, 395 secs
lola: 69174111 markings, 324153272 edges, 131437 markings/sec, 400 secs
lola: 69937231 markings, 327693833 edges, 152624 markings/sec, 405 secs
lola: 70635365 markings, 330950605 edges, 139627 markings/sec, 410 secs
lola: 71177772 markings, 333445021 edges, 108481 markings/sec, 415 secs
lola: 71872043 markings, 336684093 edges, 138854 markings/sec, 420 secs
lola: 72640895 markings, 340233016 edges, 153770 markings/sec, 425 secs
lola: 73441335 markings, 343946522 edges, 160088 markings/sec, 430 secs
lola: 74056098 markings, 346797374 edges, 122953 markings/sec, 435 secs
lola: 74610329 markings, 349369394 edges, 110846 markings/sec, 440 secs
lola: 75184677 markings, 352027002 edges, 114870 markings/sec, 445 secs
lola: 75793194 markings, 354844006 edges, 121703 markings/sec, 450 secs
lola: 76408201 markings, 357707349 edges, 123001 markings/sec, 455 secs
lola: 76928202 markings, 360129336 edges, 104000 markings/sec, 460 secs
lola: 77471824 markings, 362646564 edges, 108724 markings/sec, 465 secs
lola: 77956056 markings, 364894704 edges, 96846 markings/sec, 470 secs
lola: 78464588 markings, 367245314 edges, 101706 markings/sec, 475 secs
lola: 78952857 markings, 369523807 edges, 97654 markings/sec, 480 secs
lola: 79313386 markings, 371197046 edges, 72106 markings/sec, 485 secs
lola: 79813943 markings, 373533236 edges, 100111 markings/sec, 490 secs
lola: 80117845 markings, 374954759 edges, 60780 markings/sec, 495 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (((p61 <= 0) OR (p21 <= p62) OR (p96 <= p81)))) OR (A (((2 <= p90) U (p7 <= p37))) AND A (((2 <= p18) U (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((2 <= p18) U (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((2 <= p18) U (1 <= p8)))
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p18)
lola: state equation task get result unparse finished id 0
lola: 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p61 <= 0) OR (p21 <= p62) OR (p96 <= p81))))
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 (((p61 <= 0) OR (p21 <= p62) OR (p96 <= p81))))
lola: processed formula length: 54
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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: ((1 <= p61) AND (p62 + 1 <= p21) AND (p81 + 1 <= p96))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: sara: try reading problem file CTLCardinality-16-0.sara.try reading problem file CTLCardinality-17-0.sara.

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 633 markings, 1866 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no yes yes no yes yes yes no yes yes yes no yes
lola:
preliminary result: yes unknown no yes yes no yes yes yes no yes yes yes no yes
lola: memory consumption: 3944 KB
lola: time consumption: 1054 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
sara: place or transition ordering is non-deterministic

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="Diffusion2D-PT-D10N150"
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 Diffusion2D-PT-D10N150, 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 r178-tajo-158987882400443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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