Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815300059.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FMS-PT-00500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815300059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.3K Apr 1 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 1 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 1 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00500-CTLCardinality-00
FORMULA_NAME FMS-PT-00500-CTLCardinality-01
FORMULA_NAME FMS-PT-00500-CTLCardinality-02
FORMULA_NAME FMS-PT-00500-CTLCardinality-03
FORMULA_NAME FMS-PT-00500-CTLCardinality-04
FORMULA_NAME FMS-PT-00500-CTLCardinality-05
FORMULA_NAME FMS-PT-00500-CTLCardinality-06
FORMULA_NAME FMS-PT-00500-CTLCardinality-07
FORMULA_NAME FMS-PT-00500-CTLCardinality-08
FORMULA_NAME FMS-PT-00500-CTLCardinality-09
FORMULA_NAME FMS-PT-00500-CTLCardinality-10
FORMULA_NAME FMS-PT-00500-CTLCardinality-11
FORMULA_NAME FMS-PT-00500-CTLCardinality-12
FORMULA_NAME FMS-PT-00500-CTLCardinality-13
FORMULA_NAME FMS-PT-00500-CTLCardinality-14
FORMULA_NAME FMS-PT-00500-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591140625290

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:30:28] [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-02 23:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:30:28] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-02 23:30:28] [INFO ] Transformed 22 places.
[2020-06-02 23:30:28] [INFO ] Transformed 20 transitions.
[2020-06-02 23:30:28] [INFO ] Parsed PT model containing 22 places and 20 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Incomplete random walk after 100158 steps, including 0 resets, run finished after 107 ms. (steps per millisecond=936 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 20 rows 22 cols
[2020-06-02 23:30:28] [INFO ] Computed 6 place invariants in 6 ms
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2020-06-02 23:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-02 23:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:30:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-06-02 23:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:30:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-02 23:30:29] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 14 ms.
[2020-06-02 23:30:29] [INFO ] Added : 4 causal constraints over 1 iterations in 29 ms. Result :sat
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-02 23:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 23:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:30:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-02 23:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:30:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 23:30:29] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-02 23:30:29] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-02 23:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-02 23:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:30:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-02 23:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:30:29] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-02 23:30:29] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 5 ms.
[2020-06-02 23:30:29] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
[2020-06-02 23:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-02 23:30:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 23:30:29] [INFO ] Flatten gal took : 31 ms
[2020-06-02 23:30:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 23:30:29] [INFO ] Flatten gal took : 8 ms
FORMULA FMS-PT-00500-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:30:29] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-02 23:30:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ FMS-PT-00500 @ 3570 seconds

FORMULA FMS-PT-00500-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00500-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1093
rslt: Output for CTLCardinality @ FMS-PT-00500

{
"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": "Tue Jun 2 23:30:30 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG((EX((p1 <= p19)) OR EG((p1 <= p4))))",
"processed_size": 39,
"rewrites": 17
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 2268377,
"markings": 1513131,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"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": "E (X (E (((2 <= p20) U (3 <= p3)))))",
"processed_size": 36,
"rewrites": 17
},
"result":
{
"edges": 244975445,
"markings": 126237981,
"produced_by": "state space / EXEU",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until_from_successors"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"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 <= p21)))",
"processed_size": 18,
"rewrites": 15
},
"result":
{
"edges": 12,
"markings": 13,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"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": 5,
"visible_transitions": 0
},
"processed": "E (F (((p11 + 1 <= p6) AND (p12 + 1 <= p3) AND (p6 + 1 <= p4))))",
"processed_size": 64,
"rewrites": 15
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 426
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((AG((p2 <= p15)) AND (p17 <= p14)))",
"processed_size": 38,
"rewrites": 16
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 240640010,
"markings": 124105774,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 460
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(((p1 + 1 <= p21) AND (p1 <= 0)) U AG((p13 <= p2)))",
"processed_size": 52,
"rewrites": 16
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 14738021,
"markings": 8249141,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p8 + 1 <= p19) OR (p13 <= 0))))",
"processed_size": 40,
"rewrites": 16
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"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 <= p13)",
"processed_size": 10,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1144
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p7) OR (p9 <= p10) OR ((1 <= p20) AND (p13 <= p3)))))",
"processed_size": 68,
"rewrites": 16
},
"result":
{
"edges": 504,
"markings": 505,
"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": 6,
"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": 1144
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1144
},
"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": "(p0 <= 2)",
"processed_size": 9,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2289
},
"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 <= p3)",
"processed_size": 9,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p0 <= 2)",
"processed_size": 9,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p4 <= p15)))",
"processed_size": 19,
"rewrites": 15
},
"result":
{
"edges": 498,
"markings": 499,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 20,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p3)",
"processed_size": 9,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p17 <= 0) AND (p20 <= 0))",
"processed_size": 27,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((p19 <= p15)))",
"processed_size": 20,
"rewrites": 15
},
"result":
{
"edges": 2502,
"markings": 2502,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3708,
"runtime": 2477.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) OR **) : ((E(F(**)) AND (E(F(**)) AND **)) OR (** AND A(G(*)))) : A(G((E(X(**)) OR E(G(**))))) : E(G((A(G(**)) AND **))) : A(G(**)) : E((** U A(G(**)))) : E((** U A(G(**)))) : E(X(E((** U **)))) : A((** U A(G(**)))) : (E((** U **)) AND (E(G(**)) OR (** OR (A(F(**)) AND (** AND **))))) : E(F(**)) : (A(G(**)) OR **) : E(F(**)) : (A(G(*)) OR (** OR (E(X(**)) AND A(G(**)))))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no yes no no no unknown unknown yes no unknown yes no yes no ",
"value": "no yes no no no unknown unknown yes no unknown yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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: (NOT(E (F (((p19 <= p8) AND (1 <= p13))))) OR (3 <= p2)) : (((E (F ((3 <= p1))) AND E (F ((p4 <= p15)))) AND (3 <= p20)) OR ((p0 <= 2) AND NOT(E (F ((p1 <= p2)))))) : A (G ((E (X ((p1 <= p19))) OR E (G ((p1 <= p4)))))) : E (G ((A (G ((p2 <= p15))) AND (p17 <= p14)))) : A (G (((p12 <= p7) OR (p9 <= p7)))) : E ((((p11 <= p9)) U A (G ((p16 <= p9))))) : E ((((p0 <= 1) AND (p3 + 1 <= p10)) U A (G ((p0 <= p5))))) : E (X (E (((2 <= p20) U (3 <= p3))))) : A ((((p1 + 1 <= p21) AND (p1 <= 0)) U A (G ((p13 <= p2))))) : (E (((p11 <= p12) U (2 <= p14))) AND ((E (G ((p19 <= p15))) OR (1 <= p3)) OR ((A (F ((1 <= p4))) AND (p17 <= 0)) AND (p20 <= 0)))) : A (F (E (F ((3 <= p21))))) : (A (G (((2 <= p7) OR (p9 <= p10) OR ((1 <= p20) AND (p13 <= p3))))) OR (1 <= p13)) : E (F (((p11 + 1 <= p6) AND (p12 + 1 <= p3) AND (p6 + 1 <= p4)))) : ((NOT(E (F ((1 <= p11)))) OR (2 <= p13)) OR (E (X ((p16 <= p11))) AND A (G ((p19 <= p15)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((p1 <= p19))) OR E (G ((p1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX((p1 <= p19)) OR EG((p1 <= p4))))
lola: processed formula length: 39
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1513131 markings, 2268377 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((2 <= p20) U (3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((2 <= p20) U (3 <= p3)))))
lola: processed formula length: 36
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 3774637 markings, 6036538 edges, 754927 markings/sec, 0 secs
lola: sara is running 5 secs || 6984914 markings, 12218780 edges, 642055 markings/sec, 5 secs
lola: sara is running 10 secs || 10076433 markings, 18391765 edges, 618304 markings/sec, 10 secs
lola: sara is running 15 secs || 12949747 markings, 24131580 edges, 574663 markings/sec, 15 secs
lola: sara is running 20 secs || 15812232 markings, 29849793 edges, 572497 markings/sec, 20 secs
lola: sara is running 25 secs || 18609533 markings, 35436522 edges, 559460 markings/sec, 25 secs
lola: sara is running 30 secs || 21521788 markings, 41601500 edges, 582451 markings/sec, 30 secs
lola: sara is running 35 secs || 24138519 markings, 47264425 edges, 523346 markings/sec, 35 secs
lola: sara is running 40 secs || 26663155 markings, 52728473 edges, 504927 markings/sec, 40 secs
lola: sara is running 45 secs || 29579783 markings, 58598679 edges, 583326 markings/sec, 45 secs
lola: sara is running 50 secs || 32613016 markings, 64654137 edges, 606647 markings/sec, 50 secs
lola: sara is running 55 secs || 35641747 markings, 70581538 edges, 605746 markings/sec, 55 secs
lola: sara is running 60 secs || 39144845 markings, 76465578 edges, 700620 markings/sec, 60 secs
lola: sara is running 65 secs || 42779652 markings, 82719899 edges, 726961 markings/sec, 65 secs
lola: sara is running 70 secs || 46203144 markings, 88432201 edges, 684698 markings/sec, 70 secs
lola: sara is running 75 secs || 49777369 markings, 94462109 edges, 714845 markings/sec, 75 secs
lola: sara is running 80 secs || 53279455 markings, 100330444 edges, 700417 markings/sec, 80 secs
lola: sara is running 85 secs || 56387461 markings, 106426576 edges, 621601 markings/sec, 85 secs
lola: sara is running 90 secs || 59755019 markings, 112515697 edges, 673512 markings/sec, 90 secs
lola: sara is running 95 secs || 63062910 markings, 118619318 edges, 661578 markings/sec, 95 secs
lola: sara is running 100 secs || 65781577 markings, 124251911 edges, 543733 markings/sec, 100 secs
lola: sara is running 105 secs || 68414788 markings, 129707653 edges, 526642 markings/sec, 105 secs
lola: sara is running 110 secs || 70983796 markings, 135030961 edges, 513802 markings/sec, 110 secs
lola: sara is running 115 secs || 73546353 markings, 140340038 edges, 512511 markings/sec, 115 secs
lola: sara is running 120 secs || 76142102 markings, 145445641 edges, 519150 markings/sec, 120 secs
lola: sara is running 125 secs || 79787730 markings, 151845455 edges, 729126 markings/sec, 125 secs
lola: sara is running 130 secs || 82651099 markings, 157454521 edges, 572674 markings/sec, 130 secs
lola: sara is running 135 secs || 85452078 markings, 163040108 edges, 560196 markings/sec, 135 secs
lola: sara is running 140 secs || 89000581 markings, 168995152 edges, 709701 markings/sec, 140 secs
lola: sara is running 145 secs || 92159789 markings, 175198949 edges, 631842 markings/sec, 145 secs
lola: sara is running 150 secs || 95149876 markings, 181339584 edges, 598017 markings/sec, 150 secs
lola: sara is running 155 secs || 98109233 markings, 187423824 edges, 591871 markings/sec, 155 secs
lola: sara is running 160 secs || 101028675 markings, 193422473 edges, 583888 markings/sec, 160 secs
lola: sara is running 165 secs || 103871319 markings, 199264429 edges, 568529 markings/sec, 165 secs
lola: sara is running 170 secs || 106668791 markings, 205023096 edges, 559494 markings/sec, 170 secs
lola: sara is running 175 secs || 109569059 markings, 210982064 edges, 580054 markings/sec, 175 secs
lola: sara is running 180 secs || 112469299 markings, 216940791 edges, 580048 markings/sec, 180 secs
lola: sara is running 185 secs || 115147641 markings, 222440093 edges, 535668 markings/sec, 185 secs
lola: sara is running 190 secs || 118140723 markings, 228520367 edges, 598616 markings/sec, 190 secs
lola: sara is running 195 secs || 121016299 markings, 234397411 edges, 575115 markings/sec, 195 secs
lola: sara is running 200 secs || 124034063 markings, 240556658 edges, 603553 markings/sec, 200 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EXEU
lola: There is a path where Predicate Phi holds until Predicate Psi from some successor.
lola: 126237981 markings, 244975445 edges
lola: ========================================
lola: subprocess 2 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p11 <= 0))) OR ((2 <= p13) OR (E (X ((p16 <= p11))) AND A (G ((p19 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p13)
lola: processed formula length: 10
lola: 14 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 3 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p11 <= 0)))
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 ((p11 <= 0)))
lola: processed formula length: 18
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)
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: (1 <= p11)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: lola: state equation: calling and running sara========================================

lola: subprocess 4 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p19 <= p15)))
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 ((p19 <= p15)))
lola: processed formula length: 20
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)
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: (p15 + 1 <= p19)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 305 seconds at most (--localtimelimit=0)
lola: sara: try reading problem file CTLCardinality-3-0.sara.
========================================
lola: ...considering subproblem: E (F ((3 <= p21)))
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 <= p21)))
lola: processed formula length: 18
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
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 <= p21)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas

lola: ========================================
lola: subprocess 4 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p12 <= p7) OR (p9 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p12 <= p7) OR (p9 <= p7))))
lola: processed formula length: 36
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)
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: ((p7 + 1 <= p12) AND (p7 + 1 <= p9))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1531 markings, 1535 edges
lola: ========================================
lola: subprocess 5 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p11 + 1 <= p6) AND (p12 + 1 <= p3) AND (p6 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p11 + 1 <= p6) AND (p12 + 1 <= p3) AND (p6 + 1 <= p4))))
lola: processed formula length: 64
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p11 + 1 <= p6) AND (p12 + 1 <= p3) AND (p6 + 1 <= p4))
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: 12 markings, 11 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p11 <= p9)) U A (G ((p16 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p11 <= p9)) U AG((p16 <= p9)))
lola: processed formula length: 34
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: 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: 3622632 markings, 6726645 edges, 724526 markings/sec, 0 secs
lola: 6955926 markings, 12917122 edges, 666659 markings/sec, 5 secs
lola: 9996009 markings, 19663173 edges, 608017 markings/sec, 10 secs
lola: 12396458 markings, 26258656 edges, 480090 markings/sec, 15 secs
lola: 15151324 markings, 32585428 edges, 550973 markings/sec, 20 secs
lola: 18563408 markings, 38921262 edges, 682417 markings/sec, 25 secs
lola: 21693435 markings, 44734230 edges, 626005 markings/sec, 30 secs
lola: 24349672 markings, 51311818 edges, 531247 markings/sec, 35 secs
lola: 26587139 markings, 57459574 edges, 447493 markings/sec, 40 secs
lola: 29720573 markings, 64071588 edges, 626687 markings/sec, 45 secs
lola: 32978470 markings, 70121148 edges, 651579 markings/sec, 50 secs
lola: 36048882 markings, 75823455 edges, 614082 markings/sec, 55 secs
lola: 39533145 markings, 82300914 edges, 696853 markings/sec, 60 secs
lola: 42635803 markings, 88062434 edges, 620532 markings/sec, 65 secs
lola: 45504090 markings, 93891461 edges, 573657 markings/sec, 70 secs
lola: 47724421 markings, 99991958 edges, 444066 markings/sec, 75 secs
lola: 49744938 markings, 105543597 edges, 404103 markings/sec, 80 secs
lola: 52070235 markings, 111922784 edges, 465059 markings/sec, 85 secs
lola: 54102725 markings, 117506941 edges, 406498 markings/sec, 90 secs
lola: 56098411 markings, 122937082 edges, 399137 markings/sec, 95 secs
lola: 59667321 markings, 129565619 edges, 713782 markings/sec, 100 secs
lola: 62955260 markings, 135670554 edges, 657588 markings/sec, 105 secs
lola: 65869300 markings, 142097011 edges, 582808 markings/sec, 110 secs
lola: 68105718 markings, 148241805 edges, 447284 markings/sec, 115 secs
lola: 70705182 markings, 154458857 edges, 519893 markings/sec, 120 secs
lola: 74036549 markings, 160645607 edges, 666273 markings/sec, 125 secs
lola: 77124013 markings, 166379085 edges, 617493 markings/sec, 130 secs
lola: 80580404 markings, 172796207 edges, 691278 markings/sec, 135 secs
lola: 83763119 markings, 178707453 edges, 636543 markings/sec, 140 secs
lola: 86779140 markings, 184307519 edges, 603204 markings/sec, 145 secs
lola: 90187520 markings, 190644909 edges, 681676 markings/sec, 150 secs
lola: 93184469 markings, 196209731 edges, 599390 markings/sec, 155 secs
lola: 96162737 markings, 201748035 edges, 595654 markings/sec, 160 secs
lola: 99507484 markings, 207957931 edges, 668949 markings/sec, 165 secs
lola: 102471141 markings, 213462037 edges, 592731 markings/sec, 170 secs
lola: 105193093 markings, 219326062 edges, 544390 markings/sec, 175 secs
lola: 107344423 markings, 225237094 edges, 430266 markings/sec, 180 secs
lola: 109392109 markings, 230684536 edges, 409537 markings/sec, 185 secs
lola: 112688355 markings, 236805471 edges, 659249 markings/sec, 190 secs
lola: 115644507 markings, 242294115 edges, 591230 markings/sec, 195 secs
lola: 118657382 markings, 247897325 edges, 602575 markings/sec, 200 secs
lola: 121939252 markings, 253990921 edges, 656374 markings/sec, 205 secs
lola: 124883303 markings, 259458643 edges, 588810 markings/sec, 210 secs
lola: 127575833 markings, 265498990 edges, 538506 markings/sec, 215 secs
lola: 129673345 markings, 271262173 edges, 419502 markings/sec, 220 secs
lola: 131894901 markings, 276830793 edges, 444311 markings/sec, 225 secs
lola: 135111262 markings, 282803742 edges, 643272 markings/sec, 230 secs
lola: 137999399 markings, 288166349 edges, 577627 markings/sec, 235 secs
lola: 141038550 markings, 293816874 edges, 607830 markings/sec, 240 secs
lola: 143979507 markings, 299280202 edges, 588191 markings/sec, 245 secs
lola: 145732155 markings, 302534735 edges, 350530 markings/sec, 250 secs
lola: 147706214 markings, 306199160 edges, 394812 markings/sec, 255 secs
lola: 149555150 markings, 310625970 edges, 369787 markings/sec, 260 secs
lola: 150399205 markings, 312945024 edges, 168811 markings/sec, 265 secs
lola: 152014061 markings, 317382004 edges, 322971 markings/sec, 270 secs
lola: 153334151 markings, 320984236 edges, 264018 markings/sec, 275 secs
lola: 155990125 markings, 325916145 edges, 531195 markings/sec, 280 secs
lola: 158127267 markings, 329884900 edges, 427428 markings/sec, 285 secs
lola: 160098140 markings, 333545887 edges, 394175 markings/sec, 290 secs
lola: 161699620 markings, 336519919 edges, 320296 markings/sec, 295 secs
lola: 164535713 markings, 341793511 edges, 567219 markings/sec, 300 secs
lola: 165824653 markings, 344187003 edges, 257788 markings/sec, 305 secs
lola: 168476840 markings, 349111894 edges, 530437 markings/sec, 310 secs
lola: 170613083 markings, 353283875 edges, 427249 markings/sec, 315 secs
lola: 172650904 markings, 358882755 edges, 407564 markings/sec, 320 secs
lola: 173537480 markings, 361318752 edges, 177315 markings/sec, 325 secs
lola: 174943633 markings, 365182320 edges, 281231 markings/sec, 330 secs
lola: 176386413 markings, 368116506 edges, 288556 markings/sec, 335 secs
lola: 177327733 markings, 369863454 edges, 188264 markings/sec, 340 secs
lola: 177501469 markings, 370187319 edges, 34747 markings/sec, 345 secs
lola: 177599579 markings, 370369513 edges, 19622 markings/sec, 350 secs
lola: 177599648 markings, 370369582 edges, 14 markings/sec, 355 secs
lola: 177599694 markings, 370369629 edges, 9 markings/sec, 360 secs
lola: 177599740 markings, 370369674 edges, 9 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p0 <= 1) AND (p3 + 1 <= p10)) U A (G ((p0 <= p5)))))
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(((p0 <= 1) AND (p3 + 1 <= p10)) U AG((p0 <= p5)))
lola: processed formula length: 51
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: 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: 4069345 markings, 6526678 edges, 813869 markings/sec, 0 secs
lola: 7552711 markings, 11331494 edges, 696673 markings/sec, 5 secs
lola: 11471000 markings, 16572793 edges, 783658 markings/sec, 10 secs
lola: 15436280 markings, 21876532 edges, 793056 markings/sec, 15 secs
lola: 19400367 markings, 27178982 edges, 792817 markings/sec, 20 secs
lola: 23409228 markings, 32540549 edges, 801772 markings/sec, 25 secs
lola: 27370436 markings, 37842891 edges, 792242 markings/sec, 30 secs
lola: 31381914 markings, 43208430 edges, 802296 markings/sec, 35 secs
lola: 35369724 markings, 48541993 edges, 797562 markings/sec, 40 secs
lola: 39201066 markings, 53667409 edges, 766268 markings/sec, 45 secs
lola: 43019731 markings, 58775874 edges, 763733 markings/sec, 50 secs
lola: 46835589 markings, 63880627 edges, 763172 markings/sec, 55 secs
lola: 50740940 markings, 69108290 edges, 781070 markings/sec, 60 secs
lola: 54778042 markings, 74507706 edges, 807420 markings/sec, 65 secs
lola: 58809440 markings, 79899789 edges, 806280 markings/sec, 70 secs
lola: 62740936 markings, 85158387 edges, 786299 markings/sec, 75 secs
lola: 66702625 markings, 90461250 edges, 792338 markings/sec, 80 secs
lola: 70686275 markings, 95789775 edges, 796730 markings/sec, 85 secs
lola: 74718800 markings, 101183069 edges, 806505 markings/sec, 90 secs
lola: 78624521 markings, 106407525 edges, 781144 markings/sec, 95 secs
lola: 82500988 markings, 111596890 edges, 775293 markings/sec, 100 secs
lola: 86296714 markings, 116674468 edges, 759145 markings/sec, 105 secs
lola: 90061203 markings, 121710806 edges, 752898 markings/sec, 110 secs
lola: 93752308 markings, 126646908 edges, 738221 markings/sec, 115 secs
lola: 97771427 markings, 132024915 edges, 803824 markings/sec, 120 secs
lola: 101766339 markings, 137368075 edges, 798982 markings/sec, 125 secs
lola: 105758773 markings, 142708268 edges, 798487 markings/sec, 130 secs
lola: 109677909 markings, 147954341 edges, 783827 markings/sec, 135 secs
lola: 113728372 markings, 153371519 edges, 810093 markings/sec, 140 secs
lola: 117384969 markings, 158264042 edges, 731319 markings/sec, 145 secs
lola: 121415420 markings, 163654723 edges, 806090 markings/sec, 150 secs
lola: 125370170 markings, 168944677 edges, 790950 markings/sec, 155 secs
lola: 129209357 markings, 174080155 edges, 767837 markings/sec, 160 secs
lola: 133083809 markings, 179262993 edges, 774890 markings/sec, 165 secs
lola: 136866179 markings, 184324800 edges, 756474 markings/sec, 170 secs
lola: 140680376 markings, 189429105 edges, 762839 markings/sec, 175 secs
lola: 144602090 markings, 194675004 edges, 784343 markings/sec, 180 secs
lola: 148643586 markings, 200080491 edges, 808299 markings/sec, 185 secs
lola: 152613407 markings, 205390536 edges, 793964 markings/sec, 190 secs
lola: 156523491 markings, 210620539 edges, 782017 markings/sec, 195 secs
lola: 160313453 markings, 215690727 edges, 757992 markings/sec, 200 secs
lola: 164248114 markings, 220957571 edges, 786932 markings/sec, 205 secs
lola: 168259638 markings, 226322883 edges, 802305 markings/sec, 210 secs
lola: 172123382 markings, 231491501 edges, 772749 markings/sec, 215 secs
lola: 176022430 markings, 236707128 edges, 779810 markings/sec, 220 secs
lola: 179835434 markings, 241808103 edges, 762601 markings/sec, 225 secs
lola: 183651209 markings, 246912486 edges, 763155 markings/sec, 230 secs
lola: 187423992 markings, 251959776 edges, 754557 markings/sec, 235 secs
lola: 191225710 markings, 257045520 edges, 760344 markings/sec, 240 secs
lola: 195106774 markings, 262238521 edges, 776213 markings/sec, 245 secs
lola: 199064240 markings, 267534261 edges, 791493 markings/sec, 250 secs
lola: 202954026 markings, 272737586 edges, 777957 markings/sec, 255 secs
lola: 206912859 markings, 278032910 edges, 791767 markings/sec, 260 secs
lola: 210806666 markings, 283241264 edges, 778761 markings/sec, 265 secs
lola: 214648084 markings, 288380083 edges, 768284 markings/sec, 270 secs
lola: 218554763 markings, 293605730 edges, 781336 markings/sec, 275 secs
lola: 222336280 markings, 298664757 edges, 756303 markings/sec, 280 secs
lola: 225201651 markings, 302498974 edges, 573074 markings/sec, 285 secs
lola: 225201651 markings, 302498974 edges, 0 markings/sec, 290 secs
lola: 228165019 markings, 306463589 edges, 592674 markings/sec, 295 secs
lola: 229078884 markings, 307685233 edges, 182773 markings/sec, 300 secs
lola: 232353390 markings, 312068501 edges, 654901 markings/sec, 305 secs
lola: 234274644 markings, 314636722 edges, 384251 markings/sec, 310 secs
lola: 236694308 markings, 317872825 edges, 483933 markings/sec, 315 secs
lola: 239895173 markings, 322157950 edges, 640173 markings/sec, 320 secs
lola: 239900417 markings, 322165062 edges, 1049 markings/sec, 325 secs
lola: 243013714 markings, 326329428 edges, 622659 markings/sec, 330 secs
lola: 243413383 markings, 326862277 edges, 79934 markings/sec, 335 secs
lola: 246654694 markings, 331200827 edges, 648262 markings/sec, 340 secs
lola: 249206109 markings, 334612936 edges, 510283 markings/sec, 345 secs
lola: 252591440 markings, 339140017 edges, 677066 markings/sec, 350 secs
lola: 254948747 markings, 342296894 edges, 471461 markings/sec, 355 secs
lola: 257228308 markings, 345346467 edges, 455912 markings/sec, 360 secs
lola: 259301087 markings, 348116592 edges, 414556 markings/sec, 365 secs
lola: 261579051 markings, 351164097 edges, 455593 markings/sec, 370 secs
lola: 264165472 markings, 354626349 edges, 517284 markings/sec, 375 secs
lola: 267011067 markings, 358434174 edges, 569119 markings/sec, 380 secs
lola: 269847286 markings, 362225437 edges, 567244 markings/sec, 385 secs
lola: 272271538 markings, 365471669 edges, 484850 markings/sec, 390 secs
lola: 274483326 markings, 368426946 edges, 442358 markings/sec, 395 secs
lola: 275029276 markings, 369158539 edges, 109190 markings/sec, 400 secs
lola: 275032415 markings, 369162746 edges, 628 markings/sec, 405 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((p2 <= p15))) AND (p17 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG((p2 <= p15)) AND (p17 <= p14)))
lola: processed formula length: 38
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: 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: 3862044 markings, 6181248 edges, 772409 markings/sec, 0 secs
lola: 7097108 markings, 12436156 edges, 647013 markings/sec, 5 secs
lola: 10389130 markings, 19009515 edges, 658404 markings/sec, 10 secs
lola: 13575771 markings, 25374631 edges, 637328 markings/sec, 15 secs
lola: 16579780 markings, 31375383 edges, 600802 markings/sec, 20 secs
lola: 19553385 markings, 37321162 edges, 594721 markings/sec, 25 secs
lola: 22457629 markings, 43607003 edges, 580849 markings/sec, 30 secs
lola: 25090351 markings, 49304642 edges, 526544 markings/sec, 35 secs
lola: 27946460 markings, 55330705 edges, 571222 markings/sec, 40 secs
lola: 31006129 markings, 61448796 edges, 611934 markings/sec, 45 secs
lola: 34242397 markings, 67910060 edges, 647254 markings/sec, 50 secs
lola: 37855133 markings, 74313108 edges, 722547 markings/sec, 55 secs
lola: 41543159 markings, 80706343 edges, 737605 markings/sec, 60 secs
lola: 45350534 markings, 87058134 edges, 761475 markings/sec, 65 secs
lola: 48882380 markings, 93017667 edges, 706369 markings/sec, 70 secs
lola: 52603923 markings, 99251728 edges, 744309 markings/sec, 75 secs
lola: 55983601 markings, 105550531 edges, 675936 markings/sec, 80 secs
lola: 59543041 markings, 112215080 edges, 711888 markings/sec, 85 secs
lola: 63148066 markings, 118747666 edges, 721005 markings/sec, 90 secs
lola: 66013952 markings, 124685199 edges, 573177 markings/sec, 95 secs
lola: 68789580 markings, 130437494 edges, 555126 markings/sec, 100 secs
lola: 71512755 markings, 136078738 edges, 544635 markings/sec, 105 secs
lola: 74223152 markings, 141694882 edges, 542079 markings/sec, 110 secs
lola: 77434655 markings, 147985696 edges, 642301 markings/sec, 115 secs
lola: 81120916 markings, 154362293 edges, 737252 markings/sec, 120 secs
lola: 84002632 markings, 160126354 edges, 576343 markings/sec, 125 secs
lola: 87212718 markings, 166100152 edges, 642017 markings/sec, 130 secs
lola: 90698299 markings, 172236933 edges, 697116 markings/sec, 135 secs
lola: 94002034 markings, 178926386 edges, 660747 markings/sec, 140 secs
lola: 97191326 markings, 185479524 edges, 637858 markings/sec, 145 secs
lola: 100273153 markings, 191812995 edges, 616365 markings/sec, 150 secs
lola: 103373785 markings, 198187441 edges, 620126 markings/sec, 155 secs
lola: 106448709 markings, 204507727 edges, 614985 markings/sec, 160 secs
lola: 109535189 markings, 210851977 edges, 617296 markings/sec, 165 secs
lola: 112290715 markings, 216516376 edges, 551105 markings/sec, 170 secs
lola: 113561718 markings, 219134054 edges, 254201 markings/sec, 175 secs
lola: 115163357 markings, 222419194 edges, 320328 markings/sec, 180 secs
lola: 116064800 markings, 224241516 edges, 180289 markings/sec, 185 secs
lola: 117503530 markings, 227156541 edges, 287746 markings/sec, 190 secs
lola: 118695994 markings, 229598836 edges, 238493 markings/sec, 195 secs
lola: 119999524 markings, 232263366 edges, 260706 markings/sec, 200 secs
lola: 121987911 markings, 236332748 edges, 397677 markings/sec, 205 secs
lola: 123121207 markings, 238643380 edges, 226659 markings/sec, 210 secs
lola: 124105774 markings, 240640010 edges, 196913 markings/sec, 215 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 220 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 225 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 230 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 235 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 240 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 245 secs
lola: 124105774 markings, 240640010 edges, 0 markings/sec, 250 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 124105774 markings, 240640010 edges
lola: ========================================
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p1 + 1 <= p21) AND (p1 <= 0)) U A (G ((p13 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p1 + 1 <= p21) AND (p1 <= 0)) U AG((p13 <= p2)))
lola: processed formula length: 52
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: 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: 4015374 markings, 6436779 edges, 803075 markings/sec, 0 secs
lola: 7375261 markings, 12992417 edges, 671977 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8249141 markings, 14738021 edges
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p8 + 1 <= p19) OR (p13 <= 0)))) OR (3 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p2)
lola: processed formula length: 9
lola: 14 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 11 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p8 + 1 <= p19) OR (p13 <= 0))))
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 (((p8 + 1 <= p19) OR (p13 <= 0))))
lola: processed formula length: 40
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p19 <= p8) AND (1 <= p13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((2 <= p7) OR (p9 <= p10) OR ((1 <= p20) AND (p13 <= p3))))) OR (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 14 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 1144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p7) OR (p9 <= p10) OR ((1 <= p20) AND (p13 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= p7) OR (p9 <= p10) OR ((1 <= p20) AND (p13 <= p3)))))
lola: processed formula length: 68
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)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 505 markings, 504 edges
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: ((p7 <= 1) AND (p10 + 1 <= p9) AND ((p20 <= 0) OR (p3 + 1 <= p13)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((3 <= p1))) AND (E (F ((p4 <= p15))) AND (3 <= p20))) OR ((p0 <= 2) AND A (G ((p2 + 1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= 2)
lola: processed formula length: 9
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 2289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p20)
lola: processed formula length: 10
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p2 + 1 <= p1)))
lola: processed formula length: 22
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)
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: (p1 <= p2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p4 <= p15)))
lola: processed formula length: 19
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= p15)
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-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 499 markings, 498 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 2289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p11 <= p12) U (2 <= p14))) AND (E (G ((p19 <= p15))) OR ((1 <= p3) OR (A (F ((1 <= p4))) AND ((p17 <= 0) AND (p20 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4)))
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: (p4 <= 0)
lola: processed formula length: 9
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (1 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p19 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p19 <= p15)))
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p15 + 1 <= p19)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2502 markings, 2502 edges
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p11 <= p12) U (2 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p11 <= p12) U (2 <= p14)))
lola: processed formula length: 31
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.

lola: state equation 0: solution produced
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no no no unknown unknown yes no unknown yes no yes no
lola: memory consumption: 67520 KB
lola: time consumption: 1282 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p11 <= p9)) U A (G ((p16 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p11 <= p9)) U AG((p16 <= p9)))
lola: processed formula length: 34
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: 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: 3634398 markings, 6748760 edges, 726880 markings/sec, 0 secs
lola: 6965337 markings, 12934027 edges, 666188 markings/sec, 5 secs
lola: 10001893 markings, 19679311 edges, 607311 markings/sec, 10 secs
lola: 12395533 markings, 26256128 edges, 478728 markings/sec, 15 secs
lola: 15327821 markings, 32912202 edges, 586458 markings/sec, 20 secs
lola: 18755173 markings, 39276600 edges, 685470 markings/sec, 25 secs
lola: 21940594 markings, 45192225 edges, 637084 markings/sec, 30 secs
lola: 24594823 markings, 51985396 edges, 530846 markings/sec, 35 secs
lola: 26833118 markings, 58135362 edges, 447659 markings/sec, 40 secs
lola: 30101139 markings, 64778355 edges, 653604 markings/sec, 45 secs
lola: 33329401 markings, 70773013 edges, 645652 markings/sec, 50 secs
lola: 36417225 markings, 76514109 edges, 617565 markings/sec, 55 secs
lola: 39848655 markings, 82886942 edges, 686286 markings/sec, 60 secs
lola: 42917827 markings, 88586187 edges, 613834 markings/sec, 65 secs
lola: 45724557 markings, 94497221 edges, 561346 markings/sec, 70 secs
lola: 47890049 markings, 100447077 edges, 433098 markings/sec, 75 secs
lola: 49914504 markings, 106000162 edges, 404891 markings/sec, 80 secs
lola: 52200835 markings, 112281603 edges, 457266 markings/sec, 85 secs
lola: 54191583 markings, 117751088 edges, 398150 markings/sec, 90 secs
lola: 56212846 markings, 123150592 edges, 404253 markings/sec, 95 secs
lola: 59732250 markings, 129685071 edges, 703881 markings/sec, 100 secs
lola: 62971646 markings, 135701823 edges, 647879 markings/sec, 105 secs
lola: 65845230 markings, 142030885 edges, 574717 markings/sec, 110 secs
lola: 68079013 markings, 148168497 edges, 446757 markings/sec, 115 secs
lola: 70667592 markings, 154388269 edges, 517716 markings/sec, 120 secs
lola: 74004133 markings, 160584781 edges, 667308 markings/sec, 125 secs
lola: 77095630 markings, 166326393 edges, 618299 markings/sec, 130 secs
lola: 80545353 markings, 172731107 edges, 689945 markings/sec, 135 secs
lola: 83720091 markings, 178626752 edges, 634948 markings/sec, 140 secs
lola: 86727602 markings, 184212636 edges, 601502 markings/sec, 145 secs
lola: 90126434 markings, 190530370 edges, 679766 markings/sec, 150 secs
lola: 93116470 markings, 196083840 edges, 598007 markings/sec, 155 secs
lola: 96081295 markings, 201596198 edges, 592965 markings/sec, 160 secs
lola: 99428519 markings, 207812486 edges, 669445 markings/sec, 165 secs
lola: 102388806 markings, 213309439 edges, 592057 markings/sec, 170 secs
lola: 105105868 markings, 219086383 edges, 543412 markings/sec, 175 secs
lola: 107273783 markings, 225042979 edges, 433583 markings/sec, 180 secs
lola: 109256790 markings, 230432292 edges, 396601 markings/sec, 185 secs
lola: 112576837 markings, 236598629 edges, 664009 markings/sec, 190 secs
lola: 115529653 markings, 242081456 edges, 590563 markings/sec, 195 secs
lola: 118527059 markings, 247655123 edges, 599481 markings/sec, 200 secs
lola: 121844716 markings, 253815422 edges, 663531 markings/sec, 205 secs
lola: 124808600 markings, 259319009 edges, 592777 markings/sec, 210 secs
lola: 127526307 markings, 265362980 edges, 543541 markings/sec, 215 secs
lola: 129644543 markings, 271183007 edges, 423647 markings/sec, 220 secs
lola: 131884216 markings, 276811094 edges, 447935 markings/sec, 225 secs
lola: 135117931 markings, 282816417 edges, 646743 markings/sec, 230 secs
lola: 138017505 markings, 288199977 edges, 579915 markings/sec, 235 secs
lola: 141081202 markings, 293896448 edges, 612739 markings/sec, 240 secs
lola: 144162505 markings, 299619942 edges, 616261 markings/sec, 245 secs
lola: 146485210 markings, 303933083 edges, 464541 markings/sec, 250 secs
lola: 147417687 markings, 305664177 edges, 186495 markings/sec, 255 secs
lola: 149432184 markings, 310288056 edges, 402899 markings/sec, 260 secs
lola: 150770684 markings, 313965745 edges, 267700 markings/sec, 265 secs
lola: 152038309 markings, 317448712 edges, 253525 markings/sec, 270 secs
lola: 152775842 markings, 319475194 edges, 147507 markings/sec, 275 secs
lola: 154220718 markings, 322630530 edges, 288975 markings/sec, 280 secs
lola: 155968369 markings, 325876154 edges, 349530 markings/sec, 285 secs
lola: 157899613 markings, 329462047 edges, 386249 markings/sec, 290 secs
lola: 159984503 markings, 333333721 edges, 416978 markings/sec, 295 secs
lola: 161498690 markings, 336145887 edges, 302837 markings/sec, 300 secs
lola: 163372385 markings, 339633216 edges, 374739 markings/sec, 305 secs
lola: 164823059 markings, 342327106 edges, 290135 markings/sec, 310 secs
lola: 167016108 markings, 346399595 edges, 438610 markings/sec, 315 secs
lola: 168536509 markings, 349222782 edges, 304080 markings/sec, 320 secs
lola: 170618810 markings, 353299545 edges, 416460 markings/sec, 325 secs
lola: 172169091 markings, 357558882 edges, 310056 markings/sec, 330 secs
lola: 173497143 markings, 361207961 edges, 265610 markings/sec, 335 secs
lola: 174858225 markings, 364947703 edges, 272216 markings/sec, 340 secs
lola: 177231598 markings, 369686207 edges, 474675 markings/sec, 345 secs
lola: 177562488 markings, 370299392 edges, 66178 markings/sec, 350 secs
lola: 177571527 markings, 370317438 edges, 1808 markings/sec, 355 secs
lola: 177571612 markings, 370317522 edges, 17 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p0 <= 1) AND (p3 + 1 <= p10)) U A (G ((p0 <= p5)))))
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(((p0 <= 1) AND (p3 + 1 <= p10)) U AG((p0 <= p5)))
lola: processed formula length: 51
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: 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: 4069047 markings, 6526081 edges, 813809 markings/sec, 0 secs
lola: 7524725 markings, 11291700 edges, 691136 markings/sec, 5 secs
lola: 11264706 markings, 16293958 edges, 747996 markings/sec, 10 secs
lola: 14580884 markings, 20732783 edges, 663236 markings/sec, 15 secs
lola: 18444930 markings, 25901522 edges, 772809 markings/sec, 20 secs
lola: 22130452 markings, 30832653 edges, 737104 markings/sec, 25 secs
lola: 26174736 markings, 36241572 edges, 808857 markings/sec, 30 secs
lola: 30096573 markings, 41487690 edges, 784367 markings/sec, 35 secs
lola: 33814734 markings, 46461996 edges, 743632 markings/sec, 40 secs
lola: 37686742 markings, 51641670 edges, 774402 markings/sec, 45 secs
lola: 41562324 markings, 56825705 edges, 775116 markings/sec, 50 secs
lola: 45343845 markings, 61884739 edges, 756304 markings/sec, 55 secs
lola: 49336230 markings, 67228612 edges, 798477 markings/sec, 60 secs
lola: 53297916 markings, 72527466 edges, 792337 markings/sec, 65 secs
lola: 57206099 markings, 77755367 edges, 781637 markings/sec, 70 secs
lola: 61102067 markings, 82966707 edges, 779194 markings/sec, 75 secs
lola: 64945799 markings, 88108713 edges, 768746 markings/sec, 80 secs
lola: 68726795 markings, 93166722 edges, 756199 markings/sec, 85 secs
lola: 72565972 markings, 98302454 edges, 767835 markings/sec, 90 secs
lola: 76355511 markings, 103372008 edges, 757908 markings/sec, 95 secs
lola: 80137028 markings, 108431035 edges, 756303 markings/sec, 100 secs
lola: 83919548 markings, 113491069 edges, 756504 markings/sec, 105 secs
lola: 87592381 markings, 118405343 edges, 734567 markings/sec, 110 secs
lola: 91454935 markings, 123572182 edges, 772511 markings/sec, 115 secs
lola: 95284393 markings, 128698579 edges, 765892 markings/sec, 120 secs
lola: 99382064 markings, 134179021 edges, 819534 markings/sec, 125 secs
lola: 103450517 markings, 139620418 edges, 813691 markings/sec, 130 secs
lola: 107436619 markings, 144955626 edges, 797220 markings/sec, 135 secs
lola: 111475730 markings, 150358039 edges, 807822 markings/sec, 140 secs
lola: 115496605 markings, 155735864 edges, 804175 markings/sec, 145 secs
lola: 119456971 markings, 161033237 edges, 792073 markings/sec, 150 secs
lola: 123409563 markings, 166323819 edges, 790518 markings/sec, 155 secs
lola: 127120010 markings, 171287958 edges, 742089 markings/sec, 160 secs
lola: 131071353 markings, 176573303 edges, 790269 markings/sec, 165 secs
lola: 135109683 markings, 181974296 edges, 807666 markings/sec, 170 secs
lola: 139075372 markings, 187278901 edges, 793138 markings/sec, 175 secs
lola: 142873846 markings, 192360347 edges, 759695 markings/sec, 180 secs
lola: 146887524 markings, 197732377 edges, 802736 markings/sec, 185 secs
lola: 150897292 markings, 203095568 edges, 801954 markings/sec, 190 secs
lola: 154875124 markings, 208416122 edges, 795566 markings/sec, 195 secs
lola: 158800444 markings, 213666711 edges, 785064 markings/sec, 200 secs
lola: 162678467 markings, 218857907 edges, 775605 markings/sec, 205 secs
lola: 166364485 markings, 223785779 edges, 737204 markings/sec, 210 secs
lola: 170318674 markings, 229078645 edges, 790838 markings/sec, 215 secs
lola: 174268804 markings, 234362177 edges, 790026 markings/sec, 220 secs
lola: 178186992 markings, 239603325 edges, 783638 markings/sec, 225 secs
lola: 182075440 markings, 244804671 edges, 777690 markings/sec, 230 secs
lola: 185870055 markings, 249881305 edges, 758923 markings/sec, 235 secs
lola: 189627382 markings, 254907629 edges, 751465 markings/sec, 240 secs
lola: 193510969 markings, 260102797 edges, 776717 markings/sec, 245 secs
lola: 197376271 markings, 265274484 edges, 773060 markings/sec, 250 secs
lola: 201306717 markings, 270534256 edges, 786089 markings/sec, 255 secs
lola: 205219266 markings, 275767951 edges, 782510 markings/sec, 260 secs
lola: 209123939 markings, 280991091 edges, 780935 markings/sec, 265 secs
lola: 213009279 markings, 286188499 edges, 777068 markings/sec, 270 secs
lola: 216875797 markings, 291360446 edges, 773304 markings/sec, 275 secs
lola: 220746438 markings, 296538321 edges, 774128 markings/sec, 280 secs
lola: 224543516 markings, 301619633 edges, 759416 markings/sec, 285 secs
lola: 228043059 markings, 306301021 edges, 699909 markings/sec, 290 secs
lola: 230510955 markings, 309601421 edges, 493579 markings/sec, 295 secs
lola: 233095459 markings, 313061117 edges, 516901 markings/sec, 300 secs
lola: 236452250 markings, 317550227 edges, 671358 markings/sec, 305 secs
lola: 237950115 markings, 319554041 edges, 299573 markings/sec, 310 secs
lola: 240372068 markings, 322793567 edges, 484391 markings/sec, 315 secs
lola: 242654410 markings, 325846822 edges, 456468 markings/sec, 320 secs
lola: 245196672 markings, 329250197 edges, 508452 markings/sec, 325 secs
lola: 248307312 markings, 333411074 edges, 622128 markings/sec, 330 secs
lola: 251920397 markings, 338245621 edges, 722617 markings/sec, 335 secs
lola: 255365579 markings, 342852498 edges, 689036 markings/sec, 340 secs
lola: 257642711 markings, 345898669 edges, 455426 markings/sec, 345 secs
lola: 260729470 markings, 350027954 edges, 617352 markings/sec, 350 secs
lola: 263071298 markings, 353160420 edges, 468366 markings/sec, 355 secs
lola: 265452009 markings, 356349130 edges, 476142 markings/sec, 360 secs
lola: 268471832 markings, 360384621 edges, 603965 markings/sec, 365 secs
lola: 270584968 markings, 363212497 edges, 422627 markings/sec, 370 secs
lola: 273377887 markings, 366950095 edges, 558584 markings/sec, 375 secs
lola: 273709904 markings, 367392535 edges, 66403 markings/sec, 380 secs
lola: 274169950 markings, 368009363 edges, 92009 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((E (F ((3 <= p1))) AND (E (F ((p4 <= p15))) AND (3 <= p20))) OR ((p0 <= 2) AND A (G ((p2 + 1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p0 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= 2)
lola: processed formula length: 9
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (3 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p20)
lola: processed formula length: 10
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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 ((3 <= p1)))
lola: processed formula length: 17
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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 <= p1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p2 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p2 + 1 <= p1)))
lola: processed formula length: 22
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)
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: (p1 <= p2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p4 <= p15)))
lola: processed formula length: 19
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= p15)
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: 499 markings, 498 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
sara: try reading problem file CTLCardinality-18-0.sara.
lola: ...considering subproblem: (E (((p11 <= p12) U (2 <= p14))) AND (E (G ((p19 <= p15))) OR ((1 <= p3) OR (A (F ((1 <= p4))) AND ((p17 <= 0) AND (p20 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p17 <= 0) AND (p20 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p17 <= 0) AND (p20 <= 0))
lola: processed formula length: 27
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p19 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p19 <= p15)))
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p15 + 1 <= p19)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2502 markings, 2502 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((p11 <= p12) U (2 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p11 <= p12) U (2 <= p14)))
lola: processed formula length: 31
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p14)
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-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-20-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 3340973 markings, 5564910 edges, 668195 markings/sec, 0 secs
lola: sara is running 5 secs || 6343962 markings, 11433362 edges, 600598 markings/sec, 5 secs
lola: sara is running 10 secs || 9513963 markings, 17096234 edges, 634000 markings/sec, 10 secs
lola: sara is running 15 secs || 12609876 markings, 22713144 edges, 619183 markings/sec, 15 secs
lola: sara is running 20 secs || 15425957 markings, 28187876 edges, 563216 markings/sec, 20 secs
lola: sara is running 25 secs || 18647742 markings, 33555165 edges, 644357 markings/sec, 25 secs
lola: sara is running 30 secs || 21880562 markings, 38942365 edges, 646564 markings/sec, 30 secs
lola: sara is running 35 secs || 24463434 markings, 43922058 edges, 516574 markings/sec, 35 secs
lola: sara is running 40 secs || 27069367 markings, 49131526 edges, 521187 markings/sec, 40 secs
lola: sara is running 45 secs || 29569857 markings, 54131492 edges, 500098 markings/sec, 45 secs
lola: sara is running 50 secs || 32513894 markings, 59425357 edges, 588807 markings/sec, 50 secs
lola: sara is running 55 secs || 35473985 markings, 64695505 edges, 592018 markings/sec, 55 secs
lola: sara is running 60 secs || 38125484 markings, 69998057 edges, 530300 markings/sec, 60 secs
lola: sara is running 65 secs || 41401957 markings, 75465042 edges, 655295 markings/sec, 65 secs
lola: sara is running 70 secs || 44685179 markings, 80934402 edges, 656644 markings/sec, 70 secs
lola: sara is running 75 secs || 47862027 markings, 86228311 edges, 635370 markings/sec, 75 secs
lola: sara is running 80 secs || 50994327 markings, 91448060 edges, 626460 markings/sec, 80 secs
lola: sara is running 85 secs || 53937481 markings, 96670805 edges, 588631 markings/sec, 85 secs
lola: sara is running 90 secs || 56450433 markings, 101696287 edges, 502590 markings/sec, 90 secs
lola: sara is running 95 secs || 59520849 markings, 106877953 edges, 614083 markings/sec, 95 secs
lola: sara is running 100 secs || 62664265 markings, 112116423 edges, 628683 markings/sec, 100 secs
lola: sara is running 105 secs || 65534761 markings, 117402284 edges, 574099 markings/sec, 105 secs
lola: sara is running 110 secs || 68152545 markings, 122479945 edges, 523557 markings/sec, 110 secs
lola: sara is running 115 secs || 71163781 markings, 127496142 edges, 602247 markings/sec, 115 secs
lola: sara is running 120 secs || 74249170 markings, 132637783 edges, 617078 markings/sec, 120 secs
lola: sara is running 125 secs || 76956061 markings, 137791850 edges, 541378 markings/sec, 125 secs
lola: sara is running 130 secs || 79635191 markings, 142825776 edges, 535826 markings/sec, 130 secs
lola: sara is running 135 secs || 82565286 markings, 147708952 edges, 586019 markings/sec, 135 secs
lola: sara is running 140 secs || 85750043 markings, 153014144 edges, 636951 markings/sec, 140 secs
lola: sara is running 145 secs || 88474760 markings, 158386226 edges, 544943 markings/sec, 145 secs
lola: sara is running 150 secs || 91396833 markings, 163631948 edges, 584415 markings/sec, 150 secs
lola: sara is running 155 secs || 94500381 markings, 168803719 edges, 620710 markings/sec, 155 secs
lola: sara is running 160 secs || 97291841 markings, 173587948 edges, 558292 markings/sec, 160 secs
lola: sara is running 165 secs || 99797160 markings, 178598057 edges, 501064 markings/sec, 165 secs
lola: sara is running 170 secs || 102721132 markings, 183704294 edges, 584794 markings/sec, 170 secs
lola: sara is running 175 secs || 105796811 markings, 188829849 edges, 615136 markings/sec, 175 secs
lola: sara is running 180 secs || 108723886 markings, 194028967 edges, 585415 markings/sec, 180 secs
lola: sara is running 185 secs || 111221989 markings, 199024753 edges, 499621 markings/sec, 185 secs
lola: sara is running 190 secs || 114287286 markings, 204174640 edges, 613059 markings/sec, 190 secs
lola: sara is running 195 secs || 117338106 markings, 209258539 edges, 610164 markings/sec, 195 secs
lola: sara is running 200 secs || 120113516 markings, 214395291 edges, 555082 markings/sec, 200 secs
lola: sara is running 205 secs || 122611738 markings, 219239871 edges, 499644 markings/sec, 205 secs
lola: sara is running 210 secs || 125543017 markings, 224122894 edges, 586256 markings/sec, 210 secs
lola: sara is running 215 secs || 128678636 markings, 229348282 edges, 627124 markings/sec, 215 secs
lola: sara is running 220 secs || 131420778 markings, 234606921 edges, 548428 markings/sec, 220 secs
lola: sara is running 225 secs || 134214759 markings, 239761311 edges, 558796 markings/sec, 225 secs
lola: sara is running 230 secs || 137198750 markings, 244734083 edges, 596798 markings/sec, 230 secs
lola: sara is running 235 secs || 140147028 markings, 249667193 edges, 589656 markings/sec, 235 secs
lola: sara is running 240 secs || 142501010 markings, 254374546 edges, 470796 markings/sec, 240 secs
lola: sara is running 245 secs || 145292337 markings, 259402896 edges, 558265 markings/sec, 245 secs
lola: sara is running 250 secs || 148305886 markings, 264424892 edges, 602710 markings/sec, 250 secs
lola: sara is running 255 secs || 151225794 markings, 269441782 edges, 583982 markings/sec, 255 secs
lola: sara is running 260 secs || 153717018 markings, 274423728 edges, 498245 markings/sec, 260 secs
lola: sara is running 265 secs || 156592764 markings, 279410753 edges, 575149 markings/sec, 265 secs
lola: sara is running 270 secs || 159557274 markings, 284351020 edges, 592902 markings/sec, 270 secs
lola: sara is running 275 secs || 162152884 markings, 288923112 edges, 519122 markings/sec, 275 secs
lola: sara is running 280 secs || 164441483 markings, 293499928 edges, 457720 markings/sec, 280 secs
lola: sara is running 285 secs || 167235907 markings, 298318540 edges, 558885 markings/sec, 285 secs
lola: sara is running 290 secs || 170312642 markings, 303445713 edges, 615347 markings/sec, 290 secs
lola: sara is running 295 secs || 173247003 markings, 308748581 edges, 586872 markings/sec, 295 secs
lola: sara is running 300 secs || 175827673 markings, 313804180 edges, 516134 markings/sec, 300 secs
lola: sara is running 305 secs || 178724533 markings, 318629853 edges, 579372 markings/sec, 305 secs
lola: sara is running 310 secs || 180396223 markings, 321416608 edges, 334338 markings/sec, 310 secs
lola: sara is running 315 secs || 182322153 markings, 324624864 edges, 385186 markings/sec, 315 secs
lola: sara is running 320 secs || 184043848 markings, 327989574 edges, 344339 markings/sec, 320 secs
lola: sara is running 325 secs || 185772533 markings, 331446656 edges, 345737 markings/sec, 325 secs
lola: sara is running 330 secs || 187768298 markings, 334863475 edges, 399153 markings/sec, 330 secs
lola: sara is running 335 secs || 189617371 markings, 337945567 edges, 369815 markings/sec, 335 secs
lola: sara is running 340 secs || 191925481 markings, 341790646 edges, 461622 markings/sec, 340 secs
lola: sara is running 345 secs || 193677421 markings, 344914271 edges, 350388 markings/sec, 345 secs
lola: sara is running 350 secs || 195586864 markings, 348732808 edges, 381889 markings/sec, 350 secs
lola: sara is running 355 secs || 197862703 markings, 352841992 edges, 455168 markings/sec, 355 secs
lola: sara is running 360 secs || 200110405 markings, 356588509 edges, 449540 markings/sec, 360 secs
lola: sara is running 365 secs || 202372873 markings, 360357348 edges, 452494 markings/sec, 365 secs
lola: sara is running 370 secs || 204351314 markings, 363929397 edges, 395688 markings/sec, 370 secs
lola: sara is running 375 secs || 206245333 markings, 367717120 edges, 378804 markings/sec, 375 secs
lola: sara is running 380 secs || 208643539 markings, 371959298 edges, 479641 markings/sec, 380 secs
lola: sara is running 385 secs || 210468504 markings, 375000208 edges, 364993 markings/sec, 385 secs
lola: sara is running 390 secs || 212915450 markings, 379077829 edges, 489389 markings/sec, 390 secs
lola: sara is running 395 secs || 215292240 markings, 383488600 edges, 475358 markings/sec, 395 secs
lola: sara is running 400 secs || 216926906 markings, 386757658 edges, 326933 markings/sec, 400 secs
lola: sara is running 405 secs || 218826417 markings, 390075672 edges, 379902 markings/sec, 405 secs
lola: sara is running 410 secs || 219881416 markings, 391833294 edges, 211000 markings/sec, 410 secs
lola: sara is running 415 secs || 219959525 markings, 391963445 edges, 15622 markings/sec, 415 secs
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: RESULT
lola:
SUMMARY: no yes no no no unknown unknown yes no unknown yes no yes no
lola:
preliminary result: no yes no no no unknown unknown yes no unknown yes no yes no
lola: memory consumption: 3708 KB
lola: time consumption: 2477 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-00500"
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 FMS-PT-00500, 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 r170-smll-158987815300059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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