Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700124.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NQueens-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.5K Apr 8 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 6 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 60K 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 NQueens-PT-08-CTLFireability-00
FORMULA_NAME NQueens-PT-08-CTLFireability-01
FORMULA_NAME NQueens-PT-08-CTLFireability-02
FORMULA_NAME NQueens-PT-08-CTLFireability-03
FORMULA_NAME NQueens-PT-08-CTLFireability-04
FORMULA_NAME NQueens-PT-08-CTLFireability-05
FORMULA_NAME NQueens-PT-08-CTLFireability-06
FORMULA_NAME NQueens-PT-08-CTLFireability-07
FORMULA_NAME NQueens-PT-08-CTLFireability-08
FORMULA_NAME NQueens-PT-08-CTLFireability-09
FORMULA_NAME NQueens-PT-08-CTLFireability-10
FORMULA_NAME NQueens-PT-08-CTLFireability-11
FORMULA_NAME NQueens-PT-08-CTLFireability-12
FORMULA_NAME NQueens-PT-08-CTLFireability-13
FORMULA_NAME NQueens-PT-08-CTLFireability-14
FORMULA_NAME NQueens-PT-08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591130291622

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:38:13] [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-02 20:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:38:13] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-02 20:38:13] [INFO ] Transformed 112 places.
[2020-06-02 20:38:13] [INFO ] Transformed 64 transitions.
[2020-06-02 20:38:13] [INFO ] Parsed PT model containing 112 places and 64 transitions in 110 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Finished random walk after 83 steps, including 10 resets, run visited all 53 properties in 7 ms. (steps per millisecond=11 )
[2020-06-02 20:38:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 20:38:14] [INFO ] Flatten gal took : 49 ms
[2020-06-02 20:38:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 20:38:14] [INFO ] Flatten gal took : 18 ms
FORMULA NQueens-PT-08-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:38:14] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-02 20:38:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ NQueens-PT-08 @ 3570 seconds

FORMULA NQueens-PT-08-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA NQueens-PT-08-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-08-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLFireability @ NQueens-PT-08

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "E (G (((((1 <= p65) AND (1 <= p76) AND (1 <= p84) AND (1 <= p100)) OR ((1 <= p64) AND (1 <= p78) AND (1 <= p81) AND (1 <= p101))) AND (1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104) AND (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104)) OR ((1 <= p68) AND (1 <= p72) AND (1 <= p91) AND (1 <= p99))))))",
"processed_size": 321,
"rewrites": 65
},
"result":
{
"edges": 1280,
"markings": 489,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 68,
"problems": 36
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": 10,
"visible_transitions": 0
},
"processed": "EF(AX(((1 <= p71) AND (1 <= p76) AND (1 <= p90) AND (1 <= p106) AND (1 <= p70) AND (1 <= p89) AND (1 <= p105) AND (1 <= p69) AND (1 <= p88) AND (1 <= p104))))",
"processed_size": 158,
"rewrites": 66
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 6,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 39,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 39,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "(E((((p67 <= 0) OR (p72 <= 0) OR (p90 <= 0) OR (p98 <= 0)) AND (1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104) AND (1 <= p69) AND (1 <= p86) AND (1 <= p106)) U EG(((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))) OR (EX(((((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)) OR ((1 <= p70) AND (1 <= p78) AND (1 <= p87) AND (1 <= p107))) AND (1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102) AND (1 <= p71) AND (1 <= p76) AND (1 <= p90) AND (1 <= p106))) AND (AF(((p66 <= 0) OR (p78 <= 0) OR (p83 <= 0) OR (p103 <= 0))) OR ((p67 <= 0) OR ((p74 <= 0) OR ((p88 <= 0) OR (p100 <= 0)))))))",
"processed_size": 624,
"rewrites": 68
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 151867,
"markings": 74975,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "EG(AX(AF(((1 <= p64) AND (1 <= p76) AND (1 <= p83) AND (1 <= p99)))))",
"processed_size": 69,
"rewrites": 67
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 17,
"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": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "AF(AX(EG(((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97)))))",
"processed_size": 69,
"rewrites": 67
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 681900,
"markings": 118969,
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)) AND ((p69 <= 0) OR (p74 <= 0) OR (p90 <= 0) OR (p102 <= 0)))",
"processed_size": 123,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103))",
"processed_size": 58,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))",
"processed_size": 58,
"rewrites": 67
},
"result":
{
"edges": 40339,
"markings": 10172,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106)) OR ((1 <= p69) AND (1 <= p76) AND (1 <= p88) AND (1 <= p104)))))",
"processed_size": 131,
"rewrites": 65
},
"result":
{
"edges": 60709,
"markings": 15177,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 37
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 16
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104))))",
"processed_size": 66,
"rewrites": 65
},
"result":
{
"edges": 40340,
"markings": 10172,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))))",
"processed_size": 66,
"rewrites": 65
},
"result":
{
"edges": 30198,
"markings": 7685,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))))",
"processed_size": 66,
"rewrites": 65
},
"result":
{
"edges": 40339,
"markings": 10172,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99)) OR (p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0) OR ((1 <= p68) AND (1 <= p74) AND (1 <= p89) AND (1 <= p101)))",
"processed_size": 183,
"rewrites": 67
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 49
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 72,
"problems": 12
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EG((A(((1 <= p71) AND (1 <= p73) AND (1 <= p93) AND (1 <= p103)) U ((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99))) AND ((1 <= p71) AND ((1 <= p77) AND ((1 <= p89) AND (1 <= p107))))))",
"processed_size": 194,
"rewrites": 66
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 23639,
"markings": 11685,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 1,
"E": 3,
"F": 0,
"G": 3,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EG((E(((1 <= p66) AND (1 <= p76) AND (1 <= p85) AND (1 <= p101)) U ((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97))) AND (EG(((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104))) OR AG(((1 <= p65) AND (1 <= p79) AND (1 <= p81) AND (1 <= p103))))))",
"processed_size": 262,
"rewrites": 68
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 75184,
"markings": 49284,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106))",
"processed_size": 58,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p64) AND (1 <= p74) AND (1 <= p85) AND (1 <= p97))",
"processed_size": 57,
"rewrites": 68
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99))",
"processed_size": 57,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))",
"processed_size": 189,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 38
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "((p70 <= 0) OR (p74 <= 0) OR (p91 <= 0) OR (p103 <= 0))",
"processed_size": 58,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "((p68 <= 0) OR (p75 <= 0) OR (p88 <= 0) OR (p102 <= 0))",
"processed_size": 58,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 28
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(((1 <= p64) AND (1 <= p76) AND (1 <= p99) AND (((1 <= p66) AND (1 <= p74) AND (1 <= p87)) OR ((1 <= p71) AND (1 <= p90) AND (1 <= p106)))) OR (((p71 <= 0) OR (p73 <= 0) OR (p93 <= 0) OR (p103 <= 0)) AND (((1 <= p72) AND (1 <= p90) AND (1 <= p98)) OR ((1 <= p71) AND (1 <= p75) AND (1 <= p91)))))",
"processed_size": 302,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G ((((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104) AND (1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99) AND (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)) OR ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)))) OR F (((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))))",
"processed_size": 318,
"rewrites": 66
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99))",
"processed_size": 57,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))",
"processed_size": 189,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 38
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104))",
"processed_size": 58,
"rewrites": 67
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 61248,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G((A(X(**)) OR (** OR (** OR **))))) AND E(G(**))) : E(F(A(X(**)))) : (A(F(**)) AND (A(F(**)) AND (** AND (** AND (** AND (** AND (A(G((** OR A(F(**))))) AND **))))))) : E(G((A((** U **)) AND (** AND (** AND (** AND **)))))) : E(G(**)) : A(F(*)) : (E((** U E(G(**)))) OR (E(X(**)) AND (A(F(*)) OR (** OR (** OR (** OR **)))))) : E(G(A(X(A(F(**)))))) : A(F(A(X(E(G(**)))))) : E(G(**)) : (** AND (A(F(*)) AND ((E(X(**)) OR **) AND (E(G(**)) OR E(G(*)))))) : E(G(**)) : E(G((E((** U **)) AND (E(G(**)) OR A(G(**)))))) : (** AND (E((** U **)) AND A(G(E(F(**)))))) : (** AND E(F(A(G(*)))))"
},
"net":
{
"arcs": 320,
"conflict_clusters": 65,
"places": 110,
"places_significant": 64,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no yes no no no no yes no yes no no no no no yes ",
"value": "no yes no no no no yes no yes no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 174/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 110
lola: finding significant places
lola: 110 places, 64 transitions, 64 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: (E (G ((((A (X (((1 <= p69) AND (1 <= p75) AND (1 <= p89) AND (1 <= p103)))) OR ((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99))) OR ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103))) OR ((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103))))) AND E (G (((((1 <= p65) AND (1 <= p76) AND (1 <= p84) AND (1 <= p100)) OR ((1 <= p64) AND (1 <= p78) AND (1 <= p81) AND (1 <= p101))) AND (1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104) AND (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104)) OR ((1 <= p68) AND (1 <= p72) AND (1 <= p91) AND (1 <= p99))))))) : E (F (A (X (((1 <= p71) AND (1 <= p76) AND (1 <= p90) AND (1 <= p106) AND (1 <= p70) AND (1 <= p89) AND (1 <= p105) AND (1 <= p69) AND (1 <= p88) AND (1 <= p104)))))) : (((((((A (F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102)))) AND A (F (((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103))))) AND (1 <= p67)) AND (1 <= p79)) AND (1 <= p83)) AND (1 <= p105)) AND A (G ((((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104) AND (1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99) AND (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)) OR ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)))) OR A (F (((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))))))) AND (((1 <= p64) AND (1 <= p76) AND (1 <= p99) AND (((1 <= p66) AND (1 <= p74) AND (1 <= p87)) OR ((1 <= p71) AND (1 <= p90) AND (1 <= p106)))) OR (((p71 <= 0) OR (p73 <= 0) OR (p93 <= 0) OR (p103 <= 0)) AND (((1 <= p72) AND (1 <= p90) AND (1 <= p98)) OR ((1 <= p71) AND (1 <= p75) AND (1 <= p91)))))) : E (G (((((A ((((1 <= p71) AND (1 <= p73) AND (1 <= p93) AND (1 <= p103)) U ((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)))) AND (1 <= p71)) AND (1 <= p77)) AND (1 <= p89)) AND (1 <= p107)))) : E (G (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100)))) : NOT(E (G ((((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99)) OR (p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0) OR ((1 <= p68) AND (1 <= p74) AND (1 <= p89) AND (1 <= p101)))))) : (E (((((p67 <= 0) OR (p72 <= 0) OR (p90 <= 0) OR (p98 <= 0)) AND (1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104) AND (1 <= p69) AND (1 <= p86) AND (1 <= p106)) U E (G (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))))) OR (E (X (((((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)) OR ((1 <= p70) AND (1 <= p78) AND (1 <= p87) AND (1 <= p107))) AND (1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102) AND (1 <= p71) AND (1 <= p76) AND (1 <= p90) AND (1 <= p106)))) AND ((((NOT(E (G (((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103))))) OR (p67 <= 0)) OR (p74 <= 0)) OR (p88 <= 0)) OR (p100 <= 0)))) : E (G (A (X (A (F (((1 <= p64) AND (1 <= p76) AND (1 <= p83) AND (1 <= p99)))))))) : A (F (A (X (E (G (((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97)))))))) : E (G (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104)))) : (((((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)) AND NOT(E (G (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104)))))) AND (E (X (((1 <= p66) AND (1 <= p73) AND (1 <= p88) AND (1 <= p98)))) OR (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)) AND ((p69 <= 0) OR (p74 <= 0) OR (p90 <= 0) OR (p102 <= 0))))) AND (E (G ((((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106)) OR ((1 <= p69) AND (1 <= p76) AND (1 <= p88) AND (1 <= p104))))) OR NOT(A (F (((1 <= p64) AND (1 <= p76) AND (1 <= p83) AND (1 <= p99))))))) : NOT(A (F (NOT(E (G (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104)))))))) : E (G ((E ((((1 <= p66) AND (1 <= p76) AND (1 <= p85) AND (1 <= p101)) U ((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97)))) AND (E (G (((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))) OR A (G (((1 <= p65) AND (1 <= p79) AND (1 <= p81) AND (1 <= p103)))))))) : ((((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99)) AND E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))) AND A (G (E (F (((1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104))))))) : (((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106)) AND NOT(A (G (E (F (((1 <= p64) AND (1 <= p74) AND (1 <= p85) AND (1 <= p97))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((A (X (((1 <= p69) AND (1 <= p75) AND (1 <= p89) AND (1 <= p103)))) OR (((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)) OR (((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)) OR ((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103))))))) AND E (G (((((1 <= p65) AND (1 <= p76) AND (1 <= p84) AND (1 <= p100)) OR ((1 <= p64) AND (1 <= p78) AND (1 <= p81) AND (1 <= p101))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((((1 <= p65) AND (1 <= p76) AND (1 <= p84) AND (1 <= p100)) OR ((1 <= p64) AND (1 <= p78) AND (1 <= p81) AND (1 <= p101))) AND (1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104) AND (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104)) OR ((1 <= p68) AND (1 <= p72) AND (1 <= p91) AND (1 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((((1 <= p65) AND (1 <= p76) AND (1 <= p84) AND (1 <= p100)) OR ((1 <= p64) AND (1 <= p78) AND (1 <= p81) AND (1 <= p101))) AND (1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104) AND (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104)) OR ((1 <= p68) AND (1 <= p72) AND (1 <= p91) AND (1 <= p99))))))
lola: processed formula length: 321
lola: 65 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: 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: ((((p65 <= 0) OR (p76 <= 0) OR (p84 <= 0) OR (p100 <= 0)) AND ((p64 <= 0) OR (p78 <= 0) OR (p81 <= 0) OR (p101 <= 0))) OR (p70 <= 0) OR (p75 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (((p66 <= 0) OR (p79 <= 0) OR (p82 <= 0) OR (p104 <= 0)) AND ((p68 <= 0) OR (p72 <= 0) OR (p91 <= 0) OR (p99 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 68 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 489 markings, 1280 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p71) AND (1 <= p76) AND (1 <= p90) AND (1 <= p106) AND (1 <= p70) AND (1 <= p89) AND (1 <= p105) AND (1 <= p69) AND (1 <= p88) AND (1 <= p104))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p71) AND (1 <= p76) AND (1 <= p90) AND (1 <= p106) AND (1 <= p70) AND (1 <= p89) AND (1 <= p105) AND (1 <= p69) AND (1 <= p88) AND (1 <= p104))))
lola: processed formula length: 158
lola: 66 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((p67 <= 0) OR (p72 <= 0) OR (p90 <= 0) OR (p98 <= 0)) AND (1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104) AND (1 <= p69) AND (1 <= p86) AND (1 <= p106)) U E (G (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))))) OR (E (X (((((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)) OR ((1 <= p70) AND (1 <= p78) AND (1 <= p87) AND (1 <= p107))) AND (1 <= p68) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (E((((p67 <= 0) OR (p72 <= 0) OR (p90 <= 0) OR (p98 <= 0)) AND (1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104) AND (1 <= p69) AND (1 <= p86) AND (1 <= p106)) U EG(((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))) OR (EX(((((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)) OR ((1 <= p70) AND (1 <= p78) AND (1 <= p87) AND (1 <= p107))) AND (1 <= p68) AND (1 <= p75) AND... (shortened)
lola: processed formula length: 624
lola: 68 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 3 significant temporal operators and needs 13 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: 74975 markings, 151867 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (A (F (((1 <= p64) AND (1 <= p76) AND (1 <= p83) AND (1 <= p99))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(AF(((1 <= p64) AND (1 <= p76) AND (1 <= p83) AND (1 <= p99)))))
lola: processed formula length: 69
lola: 67 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (E (G (((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(EG(((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97)))))
lola: processed formula length: 69
lola: 67 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: 118969 markings, 681900 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)) AND (A (F (((p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0)))) AND ((E (X (((1 <= p66) AND (1 <= p73) AND (1 <= p88) AND (1 <= p98)))) OR (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)) AND ((p69 <= 0) OR (p74 <= 0) OR (p90 <= 0) OR (p102 <= 0)))) AND (E (G ((((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)) AND ((p69 <= 0) OR (p74 <= 0) OR (p90 <= 0) OR (p102 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)) AND ((p69 <= 0) OR (p74 <= 0) OR (p90 <= 0) OR (p102 <= 0)))
lola: processed formula length: 123
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 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 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p64 <= 0) OR (p76 <= 0) OR (p83 <= 0) OR (p99 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p64 <= 0) OR (p76 <= 0) OR (p83 <= 0) OR (p99 <= 0))))
lola: processed formula length: 65
lola: 65 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: 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: ((1 <= p64) AND (1 <= p76) AND (1 <= p83) AND (1 <= p99))
lola: state equation task get result unparse finished id 0
lola: The predicate is not possibly preserved.
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103))
lola: processed formula length: 58
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0))))
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:788
lola: processed formula: ((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))
lola: processed formula length: 58
lola: 67 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: 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: ((p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 10172 markings, 40339 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106)) OR ((1 <= p69) AND (1 <= p76) AND (1 <= p88) AND (1 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106)) OR ((1 <= p69) AND (1 <= p76) AND (1 <= p88) AND (1 <= p104)))))
lola: processed formula length: 131
lola: 65 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: 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: (((p70 <= 0) OR (p77 <= 0) OR (p88 <= 0) OR (p106 <= 0)) AND ((p69 <= 0) OR (p76 <= 0) OR (p88 <= 0) OR (p104 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 15177 markings, 60709 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104))))
lola: processed formula length: 66
lola: 65 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: 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: ((p66 <= 0) OR (p79 <= 0) OR (p82 <= 0) OR (p104 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 10172 markings, 40340 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))))
lola: processed formula length: 66
lola: 65 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: 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: ((p67 <= 0) OR (p74 <= 0) OR (p88 <= 0) OR (p100 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 7685 markings, 30198 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))))
lola: processed formula length: 66
lola: 65 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: 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: ((p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 10172 markings, 40339 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p65 <= 0) OR (p75 <= 0) OR (p85 <= 0) OR (p99 <= 0)) AND (1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104) AND ((p68 <= 0) OR (p74 <= 0) OR (p89 <= 0) OR (p101 <= 0)))))
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:788
lola: processed formula: (((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99)) OR (p71 <= 0) OR (p74 <= 0) OR (p92 <= 0) OR (p104 <= 0) OR ((1 <= p68) AND (1 <= p74) AND (1 <= p89) AND (1 <= p101)))
lola: processed formula length: 183
lola: 67 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: 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: (((p65 <= 0) OR (p75 <= 0) OR (p85 <= 0) OR (p99 <= 0)) AND (1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104) AND ((p68 <= 0) OR (p74 <= 0) OR (p89 <= 0) OR (p101 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 12 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A ((((1 <= p71) AND (1 <= p73) AND (1 <= p93) AND (1 <= p103)) U ((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99)))) AND ((1 <= p71) AND ((1 <= p77) AND ((1 <= p89) AND (1 <= p107)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((A(((1 <= p71) AND (1 <= p73) AND (1 <= p93) AND (1 <= p103)) U ((1 <= p66) AND (1 <= p74) AND (1 <= p87) AND (1 <= p99))) AND ((1 <= p71) AND ((1 <= p77) AND ((1 <= p89) AND (1 <= p107))))))
lola: processed formula length: 194
lola: 66 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: 11685 markings, 23639 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((((1 <= p66) AND (1 <= p76) AND (1 <= p85) AND (1 <= p101)) U ((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97)))) AND (E (G (((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))) OR A (G (((1 <= p65) AND (1 <= p79) AND (1 <= p81) AND (1 <= p103))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((E(((1 <= p66) AND (1 <= p76) AND (1 <= p85) AND (1 <= p101)) U ((1 <= p66) AND (1 <= p72) AND (1 <= p89) AND (1 <= p97))) AND (EG(((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104))) OR AG(((1 <= p65) AND (1 <= p79) AND (1 <= p81) AND (1 <= p103))))))
lola: processed formula length: 262
lola: 68 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 4 significant temporal operators and needs 17 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: 49284 markings, 75184 edges
lola: ========================================
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106)) AND E (F (A (G (((p64 <= 0) OR (p74 <= 0) OR (p85 <= 0) OR (p97 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p70) AND (1 <= p77) AND (1 <= p88) AND (1 <= p106))
lola: processed formula length: 58
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p64 <= 0) OR (p74 <= 0) OR (p85 <= 0) OR (p97 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p64) AND (1 <= p74) AND (1 <= p85) AND (1 <= p97))
lola: processed formula length: 57
lola: 68 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99)) AND (E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98)))) AND A (G (E (F (((1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99))
lola: processed formula length: 57
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))
lola: processed formula length: 189
lola: 67 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation task get result unparse finished++ id 0
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: formula 0: ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
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: subprocess 14 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102)))) AND (A (F (((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103)))) AND ((1 <= p67) AND ((1 <= p79) AND ((1 <= p83) AND ((1 <= p105) AND (A (G ((((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104) AND (1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99) AND (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p105)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p105)
lola: processed formula length: 11
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p79)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p79)
lola: processed formula length: 10
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p67)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p67)
lola: processed formula length: 10
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103))))
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: ((p70 <= 0) OR (p74 <= 0) OR (p91 <= 0) OR (p103 <= 0))
lola: processed formula length: 58
lola: 67 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: yes
lola: produced by: state space / EG
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: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: formula 0: ((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102))))
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: ((p68 <= 0) OR (p75 <= 0) OR (p88 <= 0) OR (p102 <= 0))
lola: processed formula length: 58
lola: 67 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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: formula 0: ((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 20 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p64) AND (1 <= p76) AND (1 <= p99) AND (((1 <= p66) AND (1 <= p74) AND (1 <= p87)) OR ((1 <= p71) AND (1 <= p90) AND (1 <= p106)))) OR (((p71 <= 0) OR (p73 <= 0) OR (p93 <= 0) OR (p103 <= 0)) AND (((1 <= p72) AND (1 <= p90) AND (1 <= p98)) OR ((1 <= p71) AND (1 <= p75) AND (1 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p64) AND (1 <= p76) AND (1 <= p99) AND (((1 <= p66) AND (1 <= p74) AND (1 <= p87)) OR ((1 <= p71) AND (1 <= p90) AND (1 <= p106)))) OR (((p71 <= 0) OR (p73 <= 0) OR (p93 <= 0) OR (p103 <= 0)) AND (((1 <= p72) AND (1 <= p90) AND (1 <= p98)) OR ((1 <= p71) AND (1 <= p75) AND (1 <= p91)))))
lola: processed formula length: 302
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 19 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 21 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104) AND (1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99) AND (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)) OR ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)))) OR A (F (((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p66) AND (1 <= p79) AND (1 <= p82) AND (1 <= p104) AND (1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99) AND (((1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)) OR ((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)))) OR F (((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))))
lola: processed formula length: 318
lola: 66 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99)) AND (E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98)))) AND A (G (E (F (((1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65) AND (1 <= p75) AND (1 <= p85) AND (1 <= p99))
lola: processed formula length: 57
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))) U ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))))
lola: processed formula length: 189
lola: 67 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation task get result rewrite finished id 0
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p64) AND (1 <= p75) AND (1 <= p84) AND (1 <= p98))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p67) AND (1 <= p78) AND (1 <= p84) AND (1 <= p104))
lola: processed formula length: 58
lola: 67 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: state equation task get result unparse finished++ id 0
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no yes no yes no no no no no yes
lola:
preliminary result: no yes no no no no yes no yes no no no no no yes
lola: memory consumption: 61248 KB
lola: time consumption: 5 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="NQueens-PT-08"
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 NQueens-PT-08, 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 r174-csrt-158987852700124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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