Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.0K Apr 12 17:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 17:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 20:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 20:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 37K Mar 24 05:38 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 SimpleLoadBal-PT-02-CTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591252675126

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:37:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 06:37:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:37:56] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2020-06-04 06:37:56] [INFO ] Transformed 32 places.
[2020-06-04 06:37:56] [INFO ] Transformed 45 transitions.
[2020-06-04 06:37:56] [INFO ] Parsed PT model containing 32 places and 45 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 142 ms. (steps per millisecond=704 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-04 06:37:56] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
// Phase 1: matrix 35 rows 32 cols
[2020-06-04 06:37:56] [INFO ] Computed 13 place invariants in 3 ms
[2020-06-04 06:37:56] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned unsat
[2020-06-04 06:37:56] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2020-06-04 06:37:56] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-04 06:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:37:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-04 06:37:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-06-04 06:37:56] [INFO ] [Real]Added 13 Read/Feed constraints in 3 ms returned sat
[2020-06-04 06:37:56] [INFO ] Computed and/alt/rep : 43/334/33 causal constraints in 4 ms.
[2020-06-04 06:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:37:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-06-04 06:37:56] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-04 06:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:37:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-04 06:37:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2020-06-04 06:37:56] [INFO ] Computed and/alt/rep : 43/334/33 causal constraints in 4 ms.
[2020-06-04 06:37:56] [INFO ] Added : 33 causal constraints over 7 iterations in 70 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 06:37:57] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 06:37:57] [INFO ] Flatten gal took : 26 ms
[2020-06-04 06:37:57] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 06:37:57] [INFO ] Flatten gal took : 8 ms
FORMULA SimpleLoadBal-PT-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:37:57] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 06:37:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SimpleLoadBal-PT-02 @ 3570 seconds

FORMULA SimpleLoadBal-PT-02-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ SimpleLoadBal-PT-02

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 06:37:57 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p25) AND (1 <= p27) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p25) AND (1 <= p26) AND (1 <= p29) AND (1 <= p28) AND (1 <= p31)))))",
"processed_size": 161,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 33
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EX(((1 <= p8) AND (1 <= p18))))",
"processed_size": 34,
"rewrites": 23
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p24 <= 0) OR (p27 <= 0) OR (p30 <= 0))",
"processed_size": 42,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"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": "AX(AX(((p24 <= 0) OR (p26 <= 0) OR (p29 <= 0))))",
"processed_size": 50,
"rewrites": 23
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((p8 <= 0) OR (p18 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND ((p25 <= 0) OR (p28 <= 0) OR (p31 <= 0)))",
"processed_size": 137,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 72,
"problems": 24
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AX((((p14 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p19 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR (p31 <= 0) OR (1 <= p13) OR ((1 <= p10) AND (1 <= p16))) OR ((AX(((1 <= p11) AND (1 <= p17))) AND (1 <= p0)) OR ((1 <= p21) AND (1 <= p25) AND (1 <= p26) AND (1 <= p31) AND (1 <= p9) AND (1 <= p19)))))",
"processed_size": 298,
"rewrites": 23
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"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": "EX(((p15 <= 0) OR (p25 <= 0) OR (p30 <= 0)))",
"processed_size": 46,
"rewrites": 22
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "AF(EG(((1 <= p15) AND (1 <= p22) AND (1 <= p31))))",
"processed_size": 50,
"rewrites": 23
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 18,
"markings": 9,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"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": "E(AG(((p2 <= 0) OR (p6 <= 0))) R ((p23 <= 0) OR (p28 <= 0) OR (p30 <= 0)))",
"processed_size": 77,
"rewrites": 23
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 31,
"markings": 13,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0))",
"processed_size": 42,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0))",
"processed_size": 42,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p9 <= 0) OR (p19 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)))))",
"processed_size": 98,
"rewrites": 23
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28756,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((A(G(*)) R *)) : (A(F(E(X(**)))) OR E(G(**))) : (A(X(A(X(*)))) AND **) : A(X(*)) : A(F(E(G(**)))) : A(X(A(G(**)))) : A(X((** OR ((A(X(**)) AND **) OR **)))) : E(X(*)) : (A(G(*)) AND **)"
},
"net":
{
"arcs": 252,
"conflict_clusters": 9,
"places": 32,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "yes no no yes no no yes yes no ",
"value": "yes no no yes no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 77/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32
lola: finding significant places
lola: 32 places, 45 transitions, 19 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 CTLFireability.xml
lola: NOT(A ((E (F (((1 <= p2) AND (1 <= p6)))) U ((1 <= p23) AND (1 <= p28) AND (1 <= p30))))) : (A (F (E (X (((1 <= p8) AND (1 <= p18)))))) OR E (G ((((1 <= p25) AND (1 <= p27) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p25) AND (1 <= p26) AND (1 <= p29) AND (1 <= p28) AND (1 <= p31)))))) : (NOT(E (X (E (X (((1 <= p24) AND (1 <= p26) AND (1 <= p29))))))) AND ((p24 <= 0) OR (p27 <= 0) OR (p30 <= 0))) : NOT(E (X ((((1 <= p23) AND (1 <= p27) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p25) AND (1 <= p28) AND (1 <= p29)))))) : A (F (E (G (((1 <= p15) AND (1 <= p22) AND (1 <= p31)))))) : A (X (A (G ((((1 <= p8) AND (1 <= p18)) OR ((1 <= p20) AND (1 <= p25) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p31))))))) : A (X (((((p14 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p19 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR (p31 <= 0) OR (1 <= p13) OR ((1 <= p10) AND (1 <= p16))) OR (A (X (((1 <= p11) AND (1 <= p17)))) AND (1 <= p0))) OR ((1 <= p21) AND (1 <= p25) AND (1 <= p26) AND (1 <= p31) AND (1 <= p9) AND (1 <= p19))))) : NOT(A (X (((1 <= p15) AND (1 <= p25) AND (1 <= p30))))) : (NOT(E (F ((((1 <= p9) AND (1 <= p19)) OR ((1 <= p20) AND (1 <= p25) AND (1 <= p28) AND (1 <= p29)))))) AND ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X (((1 <= p8) AND (1 <= p18)))))) OR E (G ((((1 <= p25) AND (1 <= p27) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p25) AND (1 <= p26) AND (1 <= p29) AND (1 <= p28) AND (1 <= p31))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p25) AND (1 <= p27) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p25) AND (1 <= p26) AND (1 <= p29) AND (1 <= p28) AND (1 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p25) AND (1 <= p27) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p25) AND (1 <= p26) AND (1 <= p29) AND (1 <= p28) AND (1 <= p31)))))
lola: processed formula length: 161
lola: 22 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
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: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p25 <= 0) OR (p27 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p25 <= 0) OR (p26 <= 0) OR (p29 <= 0) OR (p28 <= 0) OR (p31 <= 0)))
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((1 <= p8) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((1 <= p8) AND (1 <= p18))))
lola: processed formula length: 34
lola: 23 rewrites
lola: closed formula file CTLFireability.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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (X (((p24 <= 0) OR (p26 <= 0) OR (p29 <= 0)))))) AND ((p24 <= 0) OR (p27 <= 0) OR (p30 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p24 <= 0) OR (p27 <= 0) OR (p30 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p24 <= 0) OR (p27 <= 0) OR (p30 <= 0))
lola: processed formula length: 42
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (((p24 <= 0) OR (p26 <= 0) OR (p29 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AX(((p24 <= 0) OR (p26 <= 0) OR (p29 <= 0))))
lola: processed formula length: 50
lola: 23 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p23 <= 0) OR (p27 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p23 <= 0) OR (p27 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0))))
lola: processed formula length: 110
lola: 22 rewrites
lola: closed formula file CTLFireability.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 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((((1 <= p8) AND (1 <= p18)) OR ((1 <= p20) AND (1 <= p25) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p31)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p8 <= 0) OR (p18 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND ((p25 <= 0) OR (p28 <= 0) OR (p31 <= 0)))
lola: processed formula length: 137
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef 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: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: (((p8 <= 0) OR (p18 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND ((p25 <= 0) OR (p28 <= 0) OR (p31 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p14 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p19 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR (p31 <= 0) OR (1 <= p13) OR ((1 <= p10) AND (1 <= p16))) OR ((A (X (((1 <= p11) AND (1 <= p17)))) AND (1 <= p0)) OR ((1 <= p21) AND (1 <= p25) AND (1 <= p26) AND (1 <= p31) AND (1 <= p9) AND (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p14 <= 0) OR (p22 <= 0) OR (p28 <= 0) OR (p19 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR (p31 <= 0) OR (1 <= p13) OR ((1 <= p10) AND (1 <= p16))) OR ((AX(((1 <= p11) AND (1 <= p17))) AND (1 <= p0)) OR ((1 <= p21) AND (1 <= p25) AND (1 <= p26) AND (1 <= p31) AND (1 <= p9) AND (1 <= p19)))))
lola: processed formula length: 298
lola: 23 rewrites
lola: closed formula file CTLFireability.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 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p15 <= 0) OR (p25 <= 0) OR (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p15 <= 0) OR (p25 <= 0) OR (p30 <= 0)))
lola: processed formula length: 46
lola: 22 rewrites
lola: closed formula file CTLFireability.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 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p15) AND (1 <= p22) AND (1 <= p31))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p15) AND (1 <= p22) AND (1 <= p31))))
lola: processed formula length: 50
lola: 23 rewrites
lola: closed formula file CTLFireability.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: 9 markings, 18 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G (((p2 <= 0) OR (p6 <= 0)))) R ((p23 <= 0) OR (p28 <= 0) OR (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: processed formula: E(AG(((p2 <= 0) OR (p6 <= 0))) R ((p23 <= 0) OR (p28 <= 0) OR (p30 <= 0)))
lola: processed formula length: 77
lola: 23 rewrites
lola: closed formula file CTLFireability.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: 13 markings, 31 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p9 <= 0) OR (p19 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0))))) AND ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0))
lola: processed formula length: 42
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((((p9 <= 0) OR (p19 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0))))) AND ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p23 <= 0) OR (p27 <= 0) OR (p29 <= 0))
lola: processed formula length: 42
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p9 <= 0) OR (p19 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p9 <= 0) OR (p19 <= 0)) AND ((p20 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p29 <= 0)))))
lola: processed formula length: 98
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p9) AND (1 <= p19)) OR ((1 <= p20) AND (1 <= p25) AND (1 <= p28) AND (1 <= p29)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes yes no
lola:
preliminary result: yes no no yes no no yes yes no
lola: memory consumption: 28756 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="SimpleLoadBal-PT-02"
export BK_EXAMINATION="CTLFireability"
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 SimpleLoadBal-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939200596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-02.tgz
mv SimpleLoadBal-PT-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;