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-158987881900115.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-05track28LR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.3K Mar 31 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 20:52 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:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 06:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 12 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 108K 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-05track28LR-CTLCardinality-00
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-01
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-02
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-03
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-04
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-05
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-06
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-07
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-08
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-09
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-10
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-11
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-12
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-13
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-14
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591203250555

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:54:12] [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 16:54:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:54:12] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2020-06-03 16:54:12] [INFO ] Transformed 34 places.
[2020-06-03 16:54:12] [INFO ] Transformed 250 transitions.
[2020-06-03 16:54:12] [INFO ] Parsed PT model containing 34 places and 250 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100000 steps, including 6402 resets, run finished after 422 ms. (steps per millisecond=236 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1]
[2020-06-03 16:54:12] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2020-06-03 16:54:12] [INFO ] Computed 0 place invariants in 14 ms
[2020-06-03 16:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:12] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-03 16:54:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:13] [INFO ] [Nat]Absence check using state equation in 119 ms returned unsat
[2020-06-03 16:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:13] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2020-06-03 16:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:13] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2020-06-03 16:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:13] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 16:54:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:13] [INFO ] [Nat]Absence check using state equation in 614 ms returned unsat
[2020-06-03 16:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:14] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-06-03 16:54:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:14] [INFO ] [Nat]Absence check using state equation in 147 ms returned unsat
[2020-06-03 16:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:14] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-03 16:54:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:14] [INFO ] [Nat]Absence check using state equation in 153 ms returned unsat
[2020-06-03 16:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:14] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2020-06-03 16:54:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:14] [INFO ] [Nat]Absence check using state equation in 254 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 16:54:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 16:54:15] [INFO ] Flatten gal took : 60 ms
[2020-06-03 16:54:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 16:54:15] [INFO ] Flatten gal took : 21 ms
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:54:15] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 16:54:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DNAwalker-PT-05track28LR @ 3570 seconds

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-05track28LR-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3021
rslt: Output for CTLCardinality @ DNAwalker-PT-05track28LR

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"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": "EG(EX((p20 <= p5)))",
"processed_size": 19,
"rewrites": 14
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(((p14 <= 2) AND (p3 <= p10) AND (2 <= p0)))",
"processed_size": 46,
"rewrites": 13
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"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": "A(EX((p33 <= p27)) U EG((p29 <= p24)))",
"processed_size": 38,
"rewrites": 15
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 4,
"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": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(AX((p3 <= p0)))",
"processed_size": 18,
"rewrites": 14
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 4,
"markings": 4,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "EF(AX(((2 <= p33) AND (p0 <= p6))))",
"processed_size": 35,
"rewrites": 14
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 29180,
"markings": 5845,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG(((p26 + 1 <= p17) AND AX((p5 <= p25))))",
"processed_size": 42,
"rewrites": 14
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 1620,
"markings": 1269,
"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": 405
},
"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 ((p27 <= p21)))",
"processed_size": 20,
"rewrites": 13
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 649
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p14 <= 0) OR (1 <= p5) OR (p19 <= p28))",
"processed_size": 43,
"rewrites": 15
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 811
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": "((1 <= p5) OR (1 <= p27) OR ((p20 <= p10) AND (2 <= p17)))",
"processed_size": 60,
"rewrites": 15
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 57
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1082
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G (((p11 <= p17) AND ((p0 + 1 <= p25) OR (1 <= p1) OR (1 <= p26)))))",
"processed_size": 73,
"rewrites": 13
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 62
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1623
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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((AG((p22 <= p23)) AND ((2 <= p31) OR (1 <= p12))))",
"processed_size": 54,
"rewrites": 14
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 340561066,
"markings": 52567562,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3021
},
"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": "(p21 <= p8)",
"processed_size": 11,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p6 <= 1)))",
"processed_size": 17,
"rewrites": 13
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28908,
"runtime": 549.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G(E(X(**)))) OR **) : E(G(**)) : A(F(**)) : E(X(**)) : A((E(X(**)) U E(G(**)))) : A(F(A(X(**)))) : A(F(**)) : E(F(A(X(**)))) : E(G(**)) : (E(G(**)) OR **) : E(G(**)) : E(G(**)) : A(F((A(G(**)) AND **))) : E(G((** AND A(X(**)))))"
},
"net":
{
"arcs": 728,
"conflict_clusters": 7,
"places": 34,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 250
},
"result":
{
"preliminary_value": "yes yes no yes yes no no yes yes yes yes yes no no ",
"value": "yes yes no yes yes no no yes yes yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 284/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1088
lola: finding significant places
lola: 34 places, 250 transitions, 34 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: (E (G (E (X ((p20 <= p5))))) OR (p0 <= p25)) : E (G (((p11 <= p17) AND ((p0 + 1 <= p25) OR (1 <= p1) OR (1 <= p26))))) : A (F (((p5 <= 0) AND (p27 <= 0) AND ((p10 + 1 <= p20) OR (p17 <= 1))))) : (E (X (((p14 <= 2) AND (p3 <= p10) AND (2 <= p0)))) AND E (G ((0 <= 0)))) : A ((E (X ((p33 <= p27))) U E (G ((p29 <= p24))))) : A (((0 <= 0) U A (X ((p3 <= p0))))) : A (F (((1 <= p14) AND (p5 <= 0) AND (p28 + 1 <= p19)))) : E (F (A (X (((2 <= p33) AND (p0 <= p6)))))) : E (G (E (G (((1 <= p29) OR (p14 <= p7)))))) : (E (G ((p6 <= 1))) OR (p21 <= p8)) : E (G (E (G (((p8 <= p5) OR (1 <= p26)))))) : A ((E (G ((1 <= 0))) U E (G ((p27 <= p21))))) : A (F ((A (G ((p22 <= p23))) AND ((2 <= p31) OR (1 <= p12))))) : E (G (((p26 + 1 <= p17) AND A (X ((p5 <= p25))))))
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: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((p20 <= p5))))) OR (p0 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= p25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= p25)
lola: processed formula length: 11
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p20 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((p20 <= p5)))
lola: processed formula length: 19
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p14 <= 2) AND (p3 <= p10) AND (2 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p14 <= 2) AND (p3 <= p10) AND (2 <= p0)))
lola: processed formula length: 46
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p33 <= p27))) U E (G ((p29 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p33 <= p27)) U EG((p29 <= p24)))
lola: processed formula length: 38
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p3 <= p0)))))
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((p3 <= p0)))
lola: processed formula length: 18
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((2 <= p33) AND (p0 <= p6))))))
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(((2 <= p33) AND (p0 <= p6))))
lola: processed formula length: 35
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 5845 markings, 29180 edges
lola: ========================================
lola: subprocess 5 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p26 + 1 <= p17) AND A (X ((p5 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(((p26 + 1 <= p17) AND AX((p5 <= p25))))
lola: processed formula length: 42
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1269 markings, 1620 edges
lola: ========================================
lola: subprocess 6 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p27 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p27 <= p21)))
lola: processed formula length: 20
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (p21 + 1 <= p27)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p29) OR (p14 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p29) OR (p14 <= p7))))
lola: processed formula length: 36
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: ((p29 <= 0) AND (p7 + 1 <= p14))
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 / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 9 edges
lola: subprocess 8 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p8 <= p5) OR (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p8 <= p5) OR (1 <= p26))))
lola: processed formula length: 35
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: ((p5 + 1 <= p8) AND (p26 <= 0))
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-7-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p14) AND (p5 <= 0) AND (p28 + 1 <= p19))))
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: ((p14 <= 0) OR (1 <= p5) OR (p19 <= p28))
lola: processed formula length: 43
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p14) AND (p5 <= 0) AND (p28 + 1 <= p19))
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 3 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p5 <= 0) AND (p27 <= 0) AND ((p10 + 1 <= p20) OR (p17 <= 1)))))
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: ((1 <= p5) OR (1 <= p27) OR ((p20 <= p10) AND (2 <= p17)))
lola: processed formula length: 60
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p5 <= 0) AND (p27 <= 0) AND ((p10 + 1 <= p20) OR (p17 <= 1)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 1082 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p11 <= p17) AND ((p0 + 1 <= p25) OR (1 <= p1) OR (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p11 <= p17) AND ((p0 + 1 <= p25) OR (1 <= p1) OR (1 <= p26)))))
lola: processed formula length: 73
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 1623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p22 <= p23))) AND ((2 <= p31) OR (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG((p22 <= p23)) AND ((2 <= p31) OR (1 <= p12))))
lola: processed formula length: 54
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1184183 markings, 7663756 edges, 236837 markings/sec, 0 secs
lola: 2442568 markings, 15962945 edges, 251677 markings/sec, 5 secs
lola: 3728156 markings, 24158825 edges, 257118 markings/sec, 10 secs
lola: 4951172 markings, 32160193 edges, 244603 markings/sec, 15 secs
lola: 6236889 markings, 40536669 edges, 257143 markings/sec, 20 secs
lola: 7485095 markings, 48596146 edges, 249641 markings/sec, 25 secs
lola: 8705665 markings, 56406804 edges, 244114 markings/sec, 30 secs
lola: 9927825 markings, 64342434 edges, 244432 markings/sec, 35 secs
lola: 11146660 markings, 72345538 edges, 243767 markings/sec, 40 secs
lola: 12367144 markings, 80402175 edges, 244097 markings/sec, 45 secs
lola: 13595209 markings, 88419363 edges, 245613 markings/sec, 50 secs
lola: 14832676 markings, 96340082 edges, 247493 markings/sec, 55 secs
lola: 16040795 markings, 104233500 edges, 241624 markings/sec, 60 secs
lola: 17264096 markings, 112331652 edges, 244660 markings/sec, 65 secs
lola: 18476969 markings, 120112732 edges, 242575 markings/sec, 70 secs
lola: 19674513 markings, 127813797 edges, 239509 markings/sec, 75 secs
lola: 20876055 markings, 135686794 edges, 240308 markings/sec, 80 secs
lola: 22075272 markings, 143634930 edges, 239843 markings/sec, 85 secs
lola: 23285092 markings, 151628966 edges, 241964 markings/sec, 90 secs
lola: 24482891 markings, 159549531 edges, 239560 markings/sec, 95 secs
lola: 25707257 markings, 167470786 edges, 244873 markings/sec, 100 secs
lola: 26916151 markings, 175335652 edges, 241779 markings/sec, 105 secs
lola: 28124346 markings, 183351679 edges, 241639 markings/sec, 110 secs
lola: 29297678 markings, 191009131 edges, 234666 markings/sec, 115 secs
lola: 30477575 markings, 198681022 edges, 235979 markings/sec, 120 secs
lola: 31664072 markings, 206507480 edges, 237299 markings/sec, 125 secs
lola: 32846759 markings, 214329198 edges, 236537 markings/sec, 130 secs
lola: 34027986 markings, 222135831 edges, 236245 markings/sec, 135 secs
lola: 35182142 markings, 229794044 edges, 230831 markings/sec, 140 secs
lola: 36376386 markings, 237500737 edges, 238849 markings/sec, 145 secs
lola: 37526136 markings, 245149698 edges, 229950 markings/sec, 150 secs
lola: 38722990 markings, 252999226 edges, 239371 markings/sec, 155 secs
lola: 39864367 markings, 260532290 edges, 228275 markings/sec, 160 secs
lola: 40976954 markings, 267983187 edges, 222517 markings/sec, 165 secs
lola: 42135794 markings, 275510685 edges, 231768 markings/sec, 170 secs
lola: 43253956 markings, 282995249 edges, 223632 markings/sec, 175 secs
lola: 44497416 markings, 290817830 edges, 248692 markings/sec, 180 secs
lola: 45693224 markings, 298083524 edges, 239162 markings/sec, 185 secs
lola: 46728225 markings, 304381618 edges, 207000 markings/sec, 190 secs
lola: 47521463 markings, 309178821 edges, 158648 markings/sec, 195 secs
lola: 48393717 markings, 314470892 edges, 174451 markings/sec, 200 secs
lola: 49324589 markings, 320207245 edges, 186174 markings/sec, 205 secs
lola: 50277337 markings, 326046278 edges, 190550 markings/sec, 210 secs
lola: 51329162 markings, 332782140 edges, 210365 markings/sec, 215 secs
lola: 52447478 markings, 339711464 edges, 223663 markings/sec, 220 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 52567562 markings, 340561066 edges
lola: ========================================
lola: subprocess 13 will run for 3021 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p6 <= 1))) OR (p21 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3021 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p21 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 <= p8)
lola: processed formula length: 11
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((p6 <= 1))) OR (p21 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p21 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 <= p8)
lola: processed formula length: 11
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p6 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p6 <= 1)))
lola: processed formula length: 17
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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 <= p6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no no yes yes yes yes yes no no
lola:
preliminary result: yes yes no yes yes no no yes yes yes yes yes no no
lola: memory consumption: 28908 KB
lola: time consumption: 549 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-05track28LR"
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-05track28LR, 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-158987881900115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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