Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-08ringLL-CTLCardinality-00
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-01
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-02
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-03
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-04
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-05
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-06
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-07
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-08
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-09
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-10
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-11
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-12
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-13
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-14
FORMULA_NAME DNAwalker-PT-08ringLL-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591205387135

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:29:49] [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 17:29:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:29:49] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2020-06-03 17:29:49] [INFO ] Transformed 27 places.
[2020-06-03 17:29:49] [INFO ] Transformed 260 transitions.
[2020-06-03 17:29:49] [INFO ] Parsed PT model containing 27 places and 260 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 60 ms.
Incomplete random walk after 100000 steps, including 8101 resets, run finished after 320 ms. (steps per millisecond=312 ) properties seen :[1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]
[2020-06-03 17:29:50] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:29:50] [INFO ] Computed 0 place invariants in 10 ms
[2020-06-03 17:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:50] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2020-06-03 17:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:50] [INFO ] [Real]Absence check using state equation in 105 ms returned unsat
[2020-06-03 17:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:50] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-03 17:29:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:50] [INFO ] [Nat]Absence check using state equation in 202 ms returned unsat
[2020-06-03 17:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:50] [INFO ] [Real]Absence check using state equation in 59 ms returned unsat
[2020-06-03 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:51] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 17:29:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:29:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:51] [INFO ] [Nat]Absence check using state equation in 316 ms returned unsat
[2020-06-03 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:51] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2020-06-03 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:51] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2020-06-03 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:51] [INFO ] [Real]Absence check using state equation in 258 ms returned unsat
[2020-06-03 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:51] [INFO ] [Real]Absence check using state equation in 136 ms returned unsat
[2020-06-03 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:52] [INFO ] [Real]Absence check using state equation in 167 ms returned unsat
[2020-06-03 17:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:52] [INFO ] [Real]Absence check using state equation in 131 ms returned unsat
[2020-06-03 17:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:52] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-06-03 17:29:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:52] [INFO ] [Nat]Absence check using state equation in 199 ms returned unsat
[2020-06-03 17:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 17:29:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:29:53] [INFO ] [Nat]Absence check using state equation in 203 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 14 simplifications.
[2020-06-03 17:29:53] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 17:29:53] [INFO ] Flatten gal took : 78 ms
[2020-06-03 17:29:53] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 17:29:53] [INFO ] Flatten gal took : 30 ms
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:29:53] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 17 ms.
[2020-06-03 17:29:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DNAwalker-PT-08ringLL @ 3570 seconds

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2790
rslt: Output for CTLCardinality @ DNAwalker-PT-08ringLL

{
"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 17:29:54 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p4 <= p18) OR (1 <= p1))",
"processed_size": 27,
"rewrites": 9
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 40
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((2 <= p4) OR (p8 <= p20) OR ((1 <= p23) AND (3 <= p16)))",
"processed_size": 59,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((p17 <= 0))",
"processed_size": 14,
"rewrites": 8
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 517
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((1 <= p4))",
"processed_size": 13,
"rewrites": 8
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(EX((p23 <= p10)))",
"processed_size": 20,
"rewrites": 9
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 237024906,
"markings": 27950678,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 487
},
"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": "(p5 <= p15)",
"processed_size": 11,
"rewrites": 10
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 731
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG(((p1 + 1 <= p14) AND EF((2 <= p15))))",
"processed_size": 40,
"rewrites": 9
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 167088167,
"markings": 24291226,
"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": 930
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": "E(((p15 + 1 <= p0) AND (p25 <= 2)) U AG((p21 <= p0)))",
"processed_size": 53,
"rewrites": 9
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 27702,
"markings": 12393,
"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": 1395
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1395
},
"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 ((p2 <= p25)))",
"processed_size": 19,
"rewrites": 8
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2790
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p5 <= p25)",
"processed_size": 11,
"rewrites": 10
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 43
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((1 <= p4)))",
"processed_size": 17,
"rewrites": 8
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27544,
"runtime": 780.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(X(**)))) : A(G((** OR A(X(**))))) : E(X(E(G(**)))) : E(F(E(G(**)))) : A(F((A(X(**)) AND **))) : (A(X(**)) OR (A(X(**)) AND **)) : E(G((** AND E(F(**))))) : E(G(**)) : (A(G(**)) OR E(G(**))) : E((** U A(G(**)))) : (A(F(**)) OR (E(G(**)) OR (** AND DEADLOCK))) : TRUE"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "yes yes yes yes no no no yes yes no yes yes ",
"value": "yes yes yes yes no no no yes yes no yes 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: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: A (G (E (X ((p23 <= p10))))) : A (G (((p0 <= p18) OR A (X ((1 <= p25)))))) : E (X (E (G (((p4 <= p18) OR (1 <= p1)))))) : E (F (E (G ((p5 <= p15))))) : A (F ((A (X ((p25 <= p17))) AND (p2 + 1 <= p12)))) : (A (X ((1 <= p4))) OR (A (X ((p17 <= 0))) AND ((2 <= p4) OR (p8 <= p20) OR ((1 <= p23) AND (3 <= p16))))) : E (G (((p1 + 1 <= p14) AND E (F ((2 <= p15)))))) : E (G ((((p21 <= 1) OR (p12 + 1 <= p10)) AND ((3 <= p9) OR (p15 <= p14))))) : (A (G (A (G ((p20 <= p11))))) OR E (G ((p2 <= p25)))) : E ((((p15 + 1 <= p0) AND (p25 <= 2)) U A (G ((p21 <= p0))))) : ((A (F ((p25 + 1 <= p5))) OR E (G ((1 <= p4)))) OR ((p7 + 1 <= p24) AND A (X ((1 <= 0))))) : E (G ((0 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 <= p18) OR A (X ((1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((p0 <= p18) OR AX((1 <= p25))))
lola: processed formula length: 35
lola: 9 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: 1227375 markings, 9350027 edges, 245475 markings/sec, 0 secs
lola: 2306097 markings, 17865163 edges, 215744 markings/sec, 5 secs
lola: 3255077 markings, 25377058 edges, 189796 markings/sec, 10 secs
lola: 4174028 markings, 32796760 edges, 183790 markings/sec, 15 secs
lola: 5168317 markings, 40873558 edges, 198858 markings/sec, 20 secs
lola: 5978817 markings, 47649647 edges, 162100 markings/sec, 25 secs
lola: 6907131 markings, 54844051 edges, 185663 markings/sec, 30 secs
lola: 7649494 markings, 60874136 edges, 148473 markings/sec, 35 secs
lola: 8485031 markings, 67835139 edges, 167107 markings/sec, 40 secs
lola: 9213641 markings, 73780336 edges, 145722 markings/sec, 45 secs
lola: 10058450 markings, 80690325 edges, 168962 markings/sec, 50 secs
lola: 10802609 markings, 86984112 edges, 148832 markings/sec, 55 secs
lola: 11621683 markings, 94132142 edges, 163815 markings/sec, 60 secs
lola: 12348917 markings, 100721241 edges, 145447 markings/sec, 65 secs
lola: 13114902 markings, 107120061 edges, 153197 markings/sec, 70 secs
lola: 13860434 markings, 113006085 edges, 149106 markings/sec, 75 secs
lola: 14558191 markings, 118728318 edges, 139551 markings/sec, 80 secs
lola: 15232081 markings, 124347791 edges, 134778 markings/sec, 85 secs
lola: 15875981 markings, 129590252 edges, 128780 markings/sec, 90 secs
lola: 16721819 markings, 136509720 edges, 169168 markings/sec, 95 secs
lola: 17436855 markings, 142706587 edges, 143007 markings/sec, 100 secs
lola: 18275635 markings, 150021765 edges, 167756 markings/sec, 105 secs
lola: 18903479 markings, 155467681 edges, 125569 markings/sec, 110 secs
lola: 19731817 markings, 162582949 edges, 165668 markings/sec, 115 secs
lola: 20582552 markings, 169639258 edges, 170147 markings/sec, 120 secs
lola: 21345715 markings, 176192106 edges, 152633 markings/sec, 125 secs
lola: 22124010 markings, 182957555 edges, 155659 markings/sec, 130 secs
lola: 22888213 markings, 189576868 edges, 152841 markings/sec, 135 secs
lola: 23738305 markings, 196924177 edges, 170018 markings/sec, 140 secs
lola: 24406353 markings, 203310249 edges, 133610 markings/sec, 145 secs
lola: 25235603 markings, 210852224 edges, 165850 markings/sec, 150 secs
lola: 26008164 markings, 218065962 edges, 154512 markings/sec, 155 secs
lola: 26785029 markings, 225812783 edges, 155373 markings/sec, 160 secs
lola: 27625283 markings, 233877728 edges, 168051 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27950678 markings, 237024906 edges
lola: ========================================
lola: subprocess 2 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p4 <= p18) OR (1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((p4 <= p18) OR (1 <= p1))
lola: processed formula length: 27
lola: 9 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4 <= p18) OR (1 <= p1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((p25 <= p17))) AND (p2 + 1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX((p25 <= p17)) AND (p2 + 1 <= p12)))
lola: processed formula length: 42
lola: 9 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= p4))) OR (A (X ((p17 <= 0))) AND ((2 <= p4) OR (p8 <= p20) OR ((1 <= p23) AND (3 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p4) OR (p8 <= p20) OR ((1 <= p23) AND (3 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p4) OR (p8 <= p20) OR ((1 <= p23) AND (3 <= p16)))
lola: processed formula length: 59
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p17 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p17 <= 0))
lola: processed formula length: 14
lola: 8 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p4))
lola: processed formula length: 13
lola: 8 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p23 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((p23 <= p10)))
lola: processed formula length: 20
lola: 9 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: 1190045 markings, 9057878 edges, 238009 markings/sec, 0 secs
lola: 2208744 markings, 17097670 edges, 203740 markings/sec, 5 secs
lola: 3158628 markings, 24584614 edges, 189977 markings/sec, 10 secs
lola: 4103576 markings, 32146421 edges, 188990 markings/sec, 15 secs
lola: 4998908 markings, 39599890 edges, 179066 markings/sec, 20 secs
lola: 5838058 markings, 46626670 edges, 167830 markings/sec, 25 secs
lola: 6825004 markings, 54170205 edges, 197389 markings/sec, 30 secs
lola: 7675382 markings, 61084917 edges, 170076 markings/sec, 35 secs
lola: 8458223 markings, 67609292 edges, 156568 markings/sec, 40 secs
lola: 9184981 markings, 73555041 edges, 145352 markings/sec, 45 secs
lola: 10078443 markings, 80881596 edges, 178692 markings/sec, 50 secs
lola: 10907221 markings, 87808326 edges, 165756 markings/sec, 55 secs
lola: 11736402 markings, 95216430 edges, 165836 markings/sec, 60 secs
lola: 12470589 markings, 101966290 edges, 146837 markings/sec, 65 secs
lola: 13368569 markings, 109045548 edges, 179596 markings/sec, 70 secs
lola: 14163652 markings, 115483365 edges, 159017 markings/sec, 75 secs
lola: 14982792 markings, 122268061 edges, 163828 markings/sec, 80 secs
lola: 15700193 markings, 128275623 edges, 143480 markings/sec, 85 secs
lola: 16575533 markings, 135320984 edges, 175068 markings/sec, 90 secs
lola: 17294250 markings, 141596731 edges, 143743 markings/sec, 95 secs
lola: 18074498 markings, 148363303 edges, 156050 markings/sec, 100 secs
lola: 18797615 markings, 154457656 edges, 144623 markings/sec, 105 secs
lola: 19499993 markings, 160607365 edges, 140476 markings/sec, 110 secs
lola: 20213895 markings, 166428984 edges, 142780 markings/sec, 115 secs
lola: 20710413 markings, 170786741 edges, 99304 markings/sec, 120 secs
lola: 21321373 markings, 175974385 edges, 122192 markings/sec, 125 secs
lola: 21904417 markings, 181070518 edges, 116609 markings/sec, 130 secs
lola: 22394682 markings, 185439690 edges, 98053 markings/sec, 135 secs
lola: 23149218 markings, 191949844 edges, 150907 markings/sec, 140 secs
lola: 23839131 markings, 197865877 edges, 137983 markings/sec, 145 secs
lola: 24458149 markings, 203723959 edges, 123804 markings/sec, 150 secs
lola: 25192522 markings, 210427022 edges, 146875 markings/sec, 155 secs
lola: 25831928 markings, 216254905 edges, 127881 markings/sec, 160 secs
lola: 26442878 markings, 222483575 edges, 122190 markings/sec, 165 secs
lola: 27119724 markings, 229049638 edges, 135369 markings/sec, 170 secs
lola: 27851464 markings, 236076327 edges, 146348 markings/sec, 175 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27950678 markings, 237024906 edges
lola: ========================================
lola: subprocess 6 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p5 <= p15)))))
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: (p5 <= p15)
lola: processed formula length: 11
lola: 10 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: SUBRESULT
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: (p5 <= p15)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result unparse finished id 1
lola: The predicate is possibly preserved from a reachable marking.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result rewrite finished id 0
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p21 <= 1) OR (p12 + 1 <= p10)) AND ((3 <= p9) OR (p15 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p21 <= 1) OR (p12 + 1 <= p10)) AND ((3 <= p9) OR (p15 <= p14)))))
lola: processed formula length: 76
lola: 8 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: (((2 <= p21) AND (p10 <= p12)) OR ((p9 <= 2) AND (p14 + 1 <= p15)))
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-7-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: 12 markings, 12 edges
lola: lola: ========================================
subprocess 8 will run for 731 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1 + 1 <= p14) AND E (F ((2 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(((p1 + 1 <= p14) AND EF((2 <= p15))))
lola: processed formula length: 40
lola: 9 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: 1351229 markings, 8575239 edges, 270246 markings/sec, 0 secs
lola: 2374737 markings, 15156614 edges, 204702 markings/sec, 5 secs
lola: 3466898 markings, 22394333 edges, 218432 markings/sec, 10 secs
lola: 4579786 markings, 29637021 edges, 222578 markings/sec, 15 secs
lola: 5485035 markings, 35580203 edges, 181050 markings/sec, 20 secs
lola: 6311320 markings, 40819252 edges, 165257 markings/sec, 25 secs
lola: 7274521 markings, 47254086 edges, 192640 markings/sec, 30 secs
lola: 8099168 markings, 52830765 edges, 164929 markings/sec, 35 secs
lola: 8962889 markings, 58679258 edges, 172744 markings/sec, 40 secs
lola: 9921356 markings, 65406055 edges, 191693 markings/sec, 45 secs
lola: 10743848 markings, 71108938 edges, 164498 markings/sec, 50 secs
lola: 11682311 markings, 77225329 edges, 187693 markings/sec, 55 secs
lola: 12468665 markings, 82514077 edges, 157271 markings/sec, 60 secs
lola: 13230063 markings, 87518543 edges, 152280 markings/sec, 65 secs
lola: 14054237 markings, 93181688 edges, 164835 markings/sec, 70 secs
lola: 14843832 markings, 98421119 edges, 157919 markings/sec, 75 secs
lola: 15638497 markings, 104323915 edges, 158933 markings/sec, 80 secs
lola: 16325705 markings, 108767025 edges, 137442 markings/sec, 85 secs
lola: 17268299 markings, 115044646 edges, 188519 markings/sec, 90 secs
lola: 18132220 markings, 120896127 edges, 172784 markings/sec, 95 secs
lola: 19024514 markings, 127395487 edges, 178459 markings/sec, 100 secs
lola: 19914884 markings, 133619636 edges, 178074 markings/sec, 105 secs
lola: 20795687 markings, 139902309 edges, 176161 markings/sec, 110 secs
lola: 21701891 markings, 146558608 edges, 181241 markings/sec, 115 secs
lola: 22589593 markings, 153735827 edges, 177540 markings/sec, 120 secs
lola: 23468555 markings, 161325419 edges, 175792 markings/sec, 125 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 24291226 markings, 167088167 edges
lola: ========================================
lola: subprocess 9 will run for 930 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p15 + 1 <= p0) AND (p25 <= 2)) U A (G ((p21 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p15 + 1 <= p0) AND (p25 <= 2)) U AG((p21 <= p0)))
lola: processed formula length: 53
lola: 9 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: 12393 markings, 27702 edges
lola: ========================================
lola: subprocess 10 will run for 1395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p20 <= p11))) OR E (G ((p2 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p2 <= p25)))
lola: processed formula length: 19
lola: 8 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p25 + 1 <= p2)
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 2790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p25 + 1 <= p5))) OR (E (G ((1 <= p4))) OR ((p7 + 1 <= p24) AND DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p25 + 1 <= p5)))
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: (p5 <= p25)
lola: processed formula length: 11
lola: 10 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: (p25 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p4)))
lola: processed formula length: 17
lola: 8 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: (p4 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no yes yes no yes yes
lola:
preliminary result: yes yes yes yes no no no yes yes no yes yes
lola: memory consumption: 27544 KB
lola: time consumption: 780 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="DNAwalker-PT-08ringLL"
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 DNAwalker-PT-08ringLL, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987881900139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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