Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.2K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:13 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.1K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591213178166

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

FORMULA Kanban-PT-01000-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-01000-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Kanban-PT-01000-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Kanban-PT-01000-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2719
rslt: Output for CTLCardinality @ Kanban-PT-01000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 19:39:42 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E(EX((p1 <= p10)) U (p9 + 1 <= p12))",
"processed_size": 36,
"rewrites": 19
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 31988,
"markings": 29987,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "EF(AX((1 <= p10)))",
"processed_size": 18,
"rewrites": 19
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 6024,
"markings": 6017,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 + 1 <= p3)))",
"processed_size": 22,
"rewrites": 18
},
"result":
{
"edges": 1004,
"markings": 1005,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (((2 <= p4) U (2 <= p10)))",
"processed_size": 28,
"rewrites": 20
},
"result":
{
"edges": 6019,
"markings": 6012,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"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",
"workflow": "stateequation"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1568
},
"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 ((p8 <= p9)))",
"processed_size": 18,
"rewrites": 19
},
"result":
{
"edges": 10995,
"markings": 8998,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E ((((p1 + 1 <= p10) OR (p2 <= p3) OR (3 <= p9)) U ((p0 <= 1) AND ((3 <= p4) OR (p0 <= p10)))))",
"processed_size": 98,
"rewrites": 20
},
"result":
{
"edges": 3994,
"markings": 3995,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p9 <= p8) AND (1 <= p15))))",
"processed_size": 35,
"rewrites": 18
},
"result":
{
"edges": 10988,
"markings": 8993,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((p7 <= p12) U (p2 <= p15)))",
"processed_size": 31,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3472,
"runtime": 851.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E((E(X(**)) U **)) : E(F(*)) : (A(G(**)) AND **) : E(F(**)) : (A(X(**)) AND E(F(**))) : E((** U **)) : A(F(A(G(*)))) : E((** U A(G(**)))) : E(F(A(X(**)))) : E((** U **)) : E(F(E(G(**)))) : E(F(*)) : A(G(*)) : (A(F(**)) AND (E(F(**)) AND A((** U **))))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no yes yes no yes yes yes no unknown yes yes yes yes no yes ",
"value": "no yes yes no yes yes yes no unknown yes yes yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (G ((p5 + 1 <= p0))) : E ((E (X ((p1 <= p10))) U (p9 + 1 <= p12))) : NOT(A (G (A (G ((p8 <= p13)))))) : (E (G (A (G ((p8 <= p9))))) AND (p7 <= p15)) : E (F ((p4 + 1 <= p3))) : (A (X (((2 <= p15) OR (3 <= p9) OR (p6 <= p8)))) AND E (F (((p13 <= 1) AND (p2 <= 2))))) : E ((((p1 + 1 <= p10) OR (p2 <= p3) OR (3 <= p9)) U ((p0 <= 1) AND ((3 <= p4) OR (p0 <= p10))))) : NOT(E (G (E (F ((p4 <= p8)))))) : E ((((p5 <= p9) OR (p5 <= p12) OR (p10 <= p14)) U A (G ((p10 <= p11))))) : E (F (A (X ((1 <= p10))))) : E (((2 <= p4) U (2 <= p10))) : E (F (E (G (((3 <= p3) OR (3 <= p2)))))) : NOT(A (G ((p8 <= p4)))) : NOT(E (F (((p7 <= p12) AND (2 <= p11) AND (1 <= p15))))) : ((A (F (((2 <= p6) OR (p15 <= p12)))) AND E (F (((p9 <= p8) AND (1 <= p15))))) AND A (((p7 <= p12) U (p2 <= p15))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p1 <= p10))) U (p9 + 1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p1 <= p10)) U (p9 + 1 <= p12))
lola: processed formula length: 36
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 29987 markings, 31988 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((2 <= p15) OR (3 <= p9) OR (p6 <= p8)))) AND E (F (((p13 <= 1) AND (p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p13 <= 1) AND (p2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p13 <= 1) AND (p2 <= 2))))
lola: processed formula length: 34
lola: 18 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2998 markings, 2997 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p15) OR (3 <= p9) OR (p6 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((2 <= p15) OR (3 <= p9) OR (p6 <= p8)))
lola: processed formula length: 45
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((1 <= p10)))
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6017 markings, 6024 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 + 1 <= p3)))
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 + 1 <= p3)))
lola: processed formula length: 22
lola: 18 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 + 1 <= 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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1005 markings, 1004 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p5 + 1 <= p0)))
lola: processed formula length: 22
lola: 19 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: (p0 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1001 markings, 1000 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p13 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p13 + 1 <= p8)))
lola: processed formula length: 23
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p13 + 1 <= p8)
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: 3009 markings, 3009 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 + 1 <= p8)))
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 + 1 <= p8)))
lola: processed formula length: 22
lola: 18 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1007 markings, 1006 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p12 + 1 <= p7) OR (p11 <= 1) OR (p15 <= 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 (((p12 + 1 <= p7) OR (p11 <= 1) OR (p15 <= 0))))
lola: processed formula length: 55
lola: 19 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: ((p7 <= p12) AND (2 <= p11) AND (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((3 <= p3) OR (3 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((3 <= p3) OR (3 <= p2))
lola: processed formula length: 25
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 <= 2) AND (p2 <= 2))
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-8-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((3 <= p3) OR (3 <= p2))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 1014 markings, 1014 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p5 <= p9) OR (p5 <= p12) OR (p10 <= p14)) U A (G ((p10 <= p11)))))
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(((p5 <= p9) OR (p5 <= p12) OR (p10 <= p14)) U AG((p10 <= p11)))
lola: processed formula length: 67
lola: 19 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: 2220231 markings, 8793447 edges, 444046 markings/sec, 0 secs
lola: 4079786 markings, 16702766 edges, 371911 markings/sec, 5 secs
lola: 5910599 markings, 24869005 edges, 366163 markings/sec, 10 secs
lola: 7520347 markings, 32178104 edges, 321950 markings/sec, 15 secs
lola: 8790511 markings, 38201825 edges, 254033 markings/sec, 20 secs
lola: 10377454 markings, 45339731 edges, 317389 markings/sec, 25 secs
lola: 12287935 markings, 53337977 edges, 382096 markings/sec, 30 secs
lola: 14444482 markings, 61898886 edges, 431309 markings/sec, 35 secs
lola: 16221109 markings, 69878807 edges, 355325 markings/sec, 40 secs
lola: 17962133 markings, 77637453 edges, 348205 markings/sec, 45 secs
lola: 19351494 markings, 84087034 edges, 277872 markings/sec, 50 secs
lola: 20576616 markings, 89882365 edges, 245024 markings/sec, 55 secs
lola: 22215392 markings, 97152537 edges, 327755 markings/sec, 60 secs
lola: 24276434 markings, 105458747 edges, 412208 markings/sec, 65 secs
lola: 26264462 markings, 113632100 edges, 397606 markings/sec, 70 secs
lola: 28015574 markings, 121441674 edges, 350222 markings/sec, 75 secs
lola: 29642738 markings, 128745945 edges, 325433 markings/sec, 80 secs
lola: 30927189 markings, 134785671 edges, 256890 markings/sec, 85 secs
lola: 32218673 markings, 140814939 edges, 258297 markings/sec, 90 secs
lola: 33816965 markings, 147905522 edges, 319658 markings/sec, 95 secs
lola: 35925134 markings, 156266034 edges, 421634 markings/sec, 100 secs
lola: 37828728 markings, 164217983 edges, 380719 markings/sec, 105 secs
lola: 39556480 markings, 171922238 edges, 345550 markings/sec, 110 secs
lola: 41159363 markings, 179117051 edges, 320577 markings/sec, 115 secs
lola: 42403233 markings, 185011773 edges, 248774 markings/sec, 120 secs
lola: 43759944 markings, 191296513 edges, 271342 markings/sec, 125 secs
lola: 45423176 markings, 198517584 edges, 332646 markings/sec, 130 secs
lola: 47516328 markings, 206824756 edges, 418630 markings/sec, 135 secs
lola: 49325498 markings, 214498196 edges, 361834 markings/sec, 140 secs
lola: 51032815 markings, 222111088 edges, 341463 markings/sec, 145 secs
lola: 52586189 markings, 229107038 edges, 310675 markings/sec, 150 secs
lola: 53786648 markings, 234797794 edges, 240092 markings/sec, 155 secs
lola: 55082794 markings, 240797079 edges, 259229 markings/sec, 160 secs
lola: 56707407 markings, 247866463 edges, 324923 markings/sec, 165 secs
lola: 58821004 markings, 256255344 edges, 422719 markings/sec, 170 secs
lola: 60673294 markings, 264112144 edges, 370458 markings/sec, 175 secs
lola: 62432771 markings, 271958411 edges, 351895 markings/sec, 180 secs
lola: 64015286 markings, 279108889 edges, 316503 markings/sec, 185 secs
lola: 65194438 markings, 284699832 edges, 235830 markings/sec, 190 secs
lola: 66552668 markings, 290957966 edges, 271646 markings/sec, 195 secs
lola: 68278470 markings, 298359707 edges, 345160 markings/sec, 200 secs
lola: 70354896 markings, 306600166 edges, 415285 markings/sec, 205 secs
lola: 72129453 markings, 314209451 edges, 354911 markings/sec, 210 secs
lola: 73822170 markings, 321757034 edges, 338543 markings/sec, 215 secs
lola: 75367445 markings, 328746968 edges, 309055 markings/sec, 220 secs
lola: 76566653 markings, 334433469 edges, 239842 markings/sec, 225 secs
lola: 77924382 markings, 340677681 edges, 271546 markings/sec, 230 secs
lola: 79645630 markings, 348040398 edges, 344250 markings/sec, 235 secs
lola: 81695391 markings, 356173867 edges, 409952 markings/sec, 240 secs
lola: 83488278 markings, 363871460 edges, 358577 markings/sec, 245 secs
lola: 85181149 markings, 371419651 edges, 338574 markings/sec, 250 secs
lola: 86706512 markings, 378322968 edges, 305073 markings/sec, 255 secs
lola: 87892349 markings, 383946368 edges, 237167 markings/sec, 260 secs
lola: 89265178 markings, 390259595 edges, 274566 markings/sec, 265 secs
lola: 90982502 markings, 397599546 edges, 343465 markings/sec, 270 secs
lola: 93047137 markings, 405792013 edges, 412927 markings/sec, 275 secs
lola: 94812750 markings, 413378399 edges, 353123 markings/sec, 280 secs
lola: 96523951 markings, 421010670 edges, 342240 markings/sec, 285 secs
lola: 98080890 markings, 428066291 edges, 311388 markings/sec, 290 secs
lola: 99270731 markings, 433708918 edges, 237968 markings/sec, 295 secs
lola: 100603670 markings, 439830211 edges, 266588 markings/sec, 300 secs
lola: 102354603 markings, 447299488 edges, 350187 markings/sec, 305 secs
lola: 104296587 markings, 455002170 edges, 388397 markings/sec, 310 secs
lola: 106028113 markings, 462399175 edges, 346305 markings/sec, 315 secs
lola: 107694051 markings, 469823771 edges, 333188 markings/sec, 320 secs
lola: 109144923 markings, 476342289 edges, 290174 markings/sec, 325 secs
lola: 109650376 markings, 478734233 edges, 101091 markings/sec, 330 secs
lola: 109650376 markings, 478734233 edges, 0 markings/sec, 335 secs
lola: 110293185 markings, 481783200 edges, 128562 markings/sec, 340 secs
lola: 110939166 markings, 484847322 edges, 129196 markings/sec, 345 secs
lola: 112133171 markings, 490259007 edges, 238801 markings/sec, 350 secs
lola: 113574108 markings, 496389307 edges, 288187 markings/sec, 355 secs
lola: 115038227 markings, 502199697 edges, 292824 markings/sec, 360 secs
lola: 116254617 markings, 507041887 edges, 243278 markings/sec, 365 secs
lola: 117798785 markings, 513908794 edges, 308834 markings/sec, 370 secs
lola: 119262756 markings, 520429566 edges, 292794 markings/sec, 375 secs
lola: 120591455 markings, 526425031 edges, 265740 markings/sec, 380 secs
lola: 121676955 markings, 531571357 edges, 217100 markings/sec, 385 secs
lola: 122782814 markings, 536734901 edges, 221172 markings/sec, 390 secs
lola: 124114780 markings, 542628663 edges, 266393 markings/sec, 395 secs
lola: 125807950 markings, 549492419 edges, 338634 markings/sec, 400 secs
lola: 127583396 markings, 556569355 edges, 355089 markings/sec, 405 secs
lola: 129119374 markings, 563399350 edges, 307196 markings/sec, 410 secs
lola: 130620771 markings, 570088879 edges, 300279 markings/sec, 415 secs
lola: 131992870 markings, 576296127 edges, 274420 markings/sec, 420 secs
lola: 133109517 markings, 581590393 edges, 223329 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p4) U (2 <= p10)))
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 (((2 <= p4) U (2 <= p10)))
lola: processed formula length: 28
lola: 20 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 <= p10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 6012 markings, 6019 edges
lola: ========================================
lola: subprocess 11 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p8 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p4 <= p8)
lola: processed formula length: 10
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p4 <= p8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (p8 + 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: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 6004 markings, 6004 edges
lola: ========================================
lola: subprocess 12 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p8 <= p9))) AND (p7 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p7 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p7 <= p15)
lola: processed formula length: 11
lola: 17 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 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p8 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p8 <= p9)))
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p9 + 1 <= p8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8998 markings, 10995 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-11-1.sara.
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E ((((p1 + 1 <= p10) OR (p2 <= p3) OR (3 <= p9)) U ((p0 <= 1) AND ((3 <= p4) OR (p0 <= p10)))))
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 ((((p1 + 1 <= p10) OR (p2 <= p3) OR (3 <= p9)) U ((p0 <= 1) AND ((3 <= p4) OR (p0 <= p10)))))
lola: processed formula length: 98
lola: 20 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: ((p0 <= 1) AND ((3 <= p4) OR (p0 <= p10)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 3995 markings, 3994 edges
lola: ========================================
lola: subprocess 14 will run for 3135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((2 <= p6) OR (p15 <= p12)))) AND (E (F (((p9 <= p8) AND (1 <= p15)))) AND A (((p7 <= p12) U (p2 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9 <= p8) AND (1 <= 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 (((p9 <= p8) AND (1 <= p15))))
lola: processed formula length: 35
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p9 <= p8) AND (1 <= p15))
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-14-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: 8993 markings, 10988 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p7 <= p12) U (p2 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p7 <= p12) U (p2 <= p15)))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
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: (p7 <= p12)
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 /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p5 <= p9) OR (p5 <= p12) OR (p10 <= p14)) U A (G ((p10 <= p11)))))
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(((p5 <= p9) OR (p5 <= p12) OR (p10 <= p14)) U AG((p10 <= p11)))
lola: processed formula length: 67
lola: 19 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: 2269022 markings, 8988054 edges, 453804 markings/sec, 0 secs
lola: 4162410 markings, 17072215 edges, 378678 markings/sec, 5 secs
lola: 5930971 markings, 24961219 edges, 353712 markings/sec, 10 secs
lola: 7514037 markings, 32148407 edges, 316613 markings/sec, 15 secs
lola: 8754626 markings, 38031555 edges, 248118 markings/sec, 20 secs
lola: 10277284 markings, 44891200 edges, 304532 markings/sec, 25 secs
lola: 12138197 markings, 52738639 edges, 372183 markings/sec, 30 secs
lola: 14253975 markings, 61135474 edges, 423156 markings/sec, 35 secs
lola: 16044086 markings, 69083205 edges, 358022 markings/sec, 40 secs
lola: 17768771 markings, 76769416 edges, 344937 markings/sec, 45 secs
lola: 19196899 markings, 83353806 edges, 285626 markings/sec, 50 secs
lola: 20405442 markings, 89087499 edges, 241709 markings/sec, 55 secs
lola: 22046324 markings, 96392796 edges, 328176 markings/sec, 60 secs
lola: 24029315 markings, 104471719 edges, 396598 markings/sec, 65 secs
lola: 26045733 markings, 112649123 edges, 403284 markings/sec, 70 secs
lola: 27737044 markings, 120246928 edges, 338262 markings/sec, 75 secs
lola: 29434125 markings, 127808758 edges, 339416 markings/sec, 80 secs
lola: 30771483 markings, 134046677 edges, 267472 markings/sec, 85 secs
lola: 32031737 markings, 139975866 edges, 252051 markings/sec, 90 secs
lola: 33638533 markings, 147103769 edges, 321359 markings/sec, 95 secs
lola: 35677062 markings, 155273797 edges, 407706 markings/sec, 100 secs
lola: 37610863 markings, 163238222 edges, 386760 markings/sec, 105 secs
lola: 39270378 markings, 170638366 edges, 331903 markings/sec, 110 secs
lola: 40875804 markings, 177842789 edges, 321085 markings/sec, 115 secs
lola: 42164334 markings, 183878047 edges, 257706 markings/sec, 120 secs
lola: 43382567 markings, 189602049 edges, 243647 markings/sec, 125 secs
lola: 44969566 markings, 196640461 edges, 317400 markings/sec, 130 secs
lola: 47004527 markings, 204795714 edges, 406992 markings/sec, 135 secs
lola: 48925511 markings, 212700610 edges, 384197 markings/sec, 140 secs
lola: 50631899 markings, 220312237 edges, 341278 markings/sec, 145 secs
lola: 52248550 markings, 227567661 edges, 323330 markings/sec, 150 secs
lola: 53530519 markings, 233583176 edges, 256394 markings/sec, 155 secs
lola: 54791014 markings, 239486535 edges, 252099 markings/sec, 160 secs
lola: 56363202 markings, 246458941 edges, 314438 markings/sec, 165 secs
lola: 58416260 markings, 254652505 edges, 410612 markings/sec, 170 secs
lola: 60363044 markings, 262717805 edges, 389357 markings/sec, 175 secs
lola: 62114471 markings, 270527654 edges, 350285 markings/sec, 180 secs
lola: 63746186 markings, 277853011 edges, 326343 markings/sec, 185 secs
lola: 65015631 markings, 283851956 edges, 253889 markings/sec, 190 secs
lola: 66357206 markings, 290079533 edges, 268315 markings/sec, 195 secs
lola: 68002410 markings, 297258575 edges, 329041 markings/sec, 200 secs
lola: 70108145 markings, 305616158 edges, 421147 markings/sec, 205 secs
lola: 71922337 markings, 313280811 edges, 362838 markings/sec, 210 secs
lola: 73616189 markings, 320832790 edges, 338770 markings/sec, 215 secs
lola: 75178127 markings, 327851545 edges, 312388 markings/sec, 220 secs
lola: 76397999 markings, 333633052 edges, 243974 markings/sec, 225 secs
lola: 77659637 markings, 339488458 edges, 252328 markings/sec, 230 secs
lola: 79188832 markings, 346268739 edges, 305839 markings/sec, 235 secs
lola: 81225471 markings, 354313296 edges, 407328 markings/sec, 240 secs
lola: 83081890 markings, 362047885 edges, 371284 markings/sec, 245 secs
lola: 84774969 markings, 369595238 edges, 338616 markings/sec, 250 secs
lola: 86345684 markings, 376646714 edges, 314143 markings/sec, 255 secs
lola: 87586227 markings, 382493954 edges, 248109 markings/sec, 260 secs
lola: 88849953 markings, 388394209 edges, 252745 markings/sec, 265 secs
lola: 90393688 markings, 395239150 edges, 308747 markings/sec, 270 secs
lola: 92433253 markings, 403356969 edges, 407913 markings/sec, 275 secs
lola: 94304927 markings, 411098146 edges, 374335 markings/sec, 280 secs
lola: 95986295 markings, 418595467 edges, 336274 markings/sec, 285 secs
lola: 97565302 markings, 425682640 edges, 315801 markings/sec, 290 secs
lola: 98830355 markings, 431619620 edges, 253011 markings/sec, 295 secs
lola: 100068871 markings, 437427579 edges, 247703 markings/sec, 300 secs
lola: 101619689 markings, 444303838 edges, 310164 markings/sec, 305 secs
lola: 103596544 markings, 452221649 edges, 395371 markings/sec, 310 secs
lola: 105504936 markings, 460045614 edges, 381678 markings/sec, 315 secs
lola: 107169602 markings, 467471863 edges, 332933 markings/sec, 320 secs
lola: 108766293 markings, 474636353 edges, 319338 markings/sec, 325 secs
lola: 110040732 markings, 480586034 edges, 254888 markings/sec, 330 secs
lola: 111189144 markings, 486020141 edges, 229682 markings/sec, 335 secs
lola: 112724020 markings, 492823446 edges, 306975 markings/sec, 340 secs
lola: 114500280 markings, 500049936 edges, 355252 markings/sec, 345 secs
lola: 116284021 markings, 507159831 edges, 356748 markings/sec, 350 secs
lola: 117841903 markings, 514102819 edges, 311576 markings/sec, 355 secs
lola: 119338978 markings, 520771608 edges, 299415 markings/sec, 360 secs
lola: 120708746 markings, 526980101 edges, 273954 markings/sec, 365 secs
lola: 121823506 markings, 532266082 edges, 222952 markings/sec, 370 secs
lola: 123049477 markings, 537933147 edges, 245194 markings/sec, 375 secs
lola: 124454850 markings, 544155863 edges, 281075 markings/sec, 380 secs
lola: 126354458 markings, 551675546 edges, 379922 markings/sec, 385 secs
lola: 128059601 markings, 558638053 edges, 341029 markings/sec, 390 secs
lola: 129327278 markings, 564333830 edges, 253535 markings/sec, 395 secs
lola: 130840473 markings, 571071198 edges, 302639 markings/sec, 400 secs
lola: 132162936 markings, 577101748 edges, 264493 markings/sec, 405 secs
lola: 133138109 markings, 581726203 edges, 195035 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F (((2 <= p6) OR (p15 <= p12)))) AND (E (F (((p9 <= p8) AND (1 <= p15)))) AND A (((p7 <= p12) U (p2 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((p9 <= p8) AND (1 <= 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 (((p9 <= p8) AND (1 <= p15))))
lola: processed formula length: 35
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p9 <= p8) AND (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8993 markings, 10988 edges
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p6) OR (p15 <= p12))))
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: ((p6 <= 1) AND (p12 + 1 <= p15))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p6) OR (p15 <= p12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
sara: try reading problem file CTLCardinality-16-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((p7 <= p12) U (p2 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p7 <= p12) U (p2 <= p15)))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no unknown yes yes yes yes no yes
lola:
preliminary result: no yes yes no yes yes yes no unknown yes yes yes yes no yes
lola: memory consumption: 3472 KB
lola: time consumption: 851 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json

rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 16291872 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16291108 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-01000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Kanban-PT-01000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928700539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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