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.r194-csrt-159033389600156.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 Solitaire-PT-EngCT7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 9 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 77K Apr 27 15:14 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 Solitaire-PT-EngCT7x7-CTLFireability-00
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-01
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-02
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-03
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-04
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-05
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-06
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-07
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-08
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-09
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-10
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-11
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-12
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-13
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-14
FORMULA_NAME Solitaire-PT-EngCT7x7-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591204439218

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:14:03] [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-03 17:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:14:04] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-06-03 17:14:04] [INFO ] Transformed 67 places.
[2020-06-03 17:14:04] [INFO ] Transformed 76 transitions.
[2020-06-03 17:14:04] [INFO ] Parsed PT model containing 67 places and 76 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Incomplete random walk after 100000 steps, including 3945 resets, run finished after 561 ms. (steps per millisecond=178 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 76 rows 67 cols
[2020-06-03 17:14:04] [INFO ] Computed 34 place invariants in 19 ms
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using 33 positive place invariants in 131 ms returned unsat
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-03 17:14:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:14:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 153 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 14 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:14:05] [INFO ] [Nat]Absence check using state equation in 156 ms returned unsat
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:14:05] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-03 17:14:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:14:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 17:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:14:06] [INFO ] [Nat]Absence check using state equation in 125 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 17:14:06] [INFO ] Flatten gal took : 92 ms
[2020-06-03 17:14:06] [INFO ] Flatten gal took : 37 ms
[2020-06-03 17:14:06] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2020-06-03 17:14:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Solitaire-PT-EngCT7x7 @ 3570 seconds

FORMULA Solitaire-PT-EngCT7x7-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-EngCT7x7-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-EngCT7x7-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-EngCT7x7-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-EngCT7x7-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ Solitaire-PT-EngCT7x7

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:14:07 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))",
"processed_size": 56,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G (((1 <= p35) AND (1 <= p58) AND (1 <= p64) AND (1 <= p66))))",
"processed_size": 65,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(AX(((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0) OR (p66 <= 0))))",
"processed_size": 65,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"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 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66))",
"processed_size": 57,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "(((p0 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p66 <= 0)) AND ((p4 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p66 <= 0)))",
"processed_size": 119,
"rewrites": 55
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"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": "EF(AX(AG(((1 <= p38) AND (1 <= p41) AND (1 <= p50) AND (1 <= p66)))))",
"processed_size": 69,
"rewrites": 55
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 44,
"markings": 23,
"produced_by": "CTL model checker",
"value": true
},
"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": 278
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A((((p4 <= 0) OR (p7 <= 0) OR (p37 <= 0)) OR (AF(((1 <= p41) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66))) OR (((1 <= p44) AND (1 <= p60) AND (1 <= p63) AND (1 <= p66)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66))))) U AX(((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66) AND (1 <= p38) AND (1 <= p41) AND (1 <= p50))))",
"processed_size": 345,
"rewrites": 55
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "CTL model checker",
"value": false
},
"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": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(A(EF(((1 <= p57) AND (1 <= p60) AND (1 <= p64) AND (1 <= p66))) U ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))) OR (AX(((1 <= p35) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66))) AND ((1 <= p43) AND ((1 <= p46) AND (1 <= p49)))))",
"processed_size": 241,
"rewrites": 55
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 84659,
"markings": 25803,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 3765468,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : A((E(G(*)) R *)) : E(F((E(X(**)) AND (A(F(**)) AND (E(G(**)) AND A(G(**))))))) : A(F((E((** U **)) OR A(F(**))))) : A(F(**)) : A(F(A(G(**)))) : (A((* R *)) AND (E(F(*)) AND (A(F(E(G(**)))) AND (** AND (** AND **))))) : (A(G(**)) OR (E(G(A(X(*)))) OR **)) : E(G((A(F(*)) AND **))) : (A(X(A(F(**)))) OR **) : E(F(A(X(A(G(**)))))) : A(((** OR (A(F(**)) OR (** OR **))) U A(X(**)))) : (A((E(F(**)) U **)) OR (A(X(**)) AND (** AND (** AND **)))) : (A(F(A(X(**)))) OR A(X(A(X(**))))) : (E(G(*)) OR (A(F(*)) OR **)) : E(G((A(F(**)) AND (** AND **))))"
},
"net":
{
"arcs": 532,
"conflict_clusters": 1,
"places": 67,
"places_significant": 33,
"singleton_clusters": 0,
"transitions": 76
},
"result":
{
"interim_value": "unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown ",
"preliminary_value": "unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown "
},
"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: 143/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2144
lola: finding significant places
lola: 67 places, 76 transitions, 33 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: A ((((1 <= p0) AND (1 <= p11) AND (1 <= p15) AND (1 <= p66)) U A (F (((1 <= p44) AND (1 <= p60) AND (1 <= p63) AND (1 <= p66)))))) : NOT(E ((A (F (((1 <= p16) AND (1 <= p31) AND (1 <= p56) AND (1 <= p66)))) U ((((1 <= p43) AND (1 <= p46) AND (1 <= p49) AND (1 <= p66)) OR ((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66))) AND (1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66))))) : E (F ((((E (X (((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66)))) AND A (F (((1 <= p21) AND (1 <= p24) AND (1 <= p27) AND (1 <= p66))))) AND E (G (((1 <= p28) AND (1 <= p36) AND (1 <= p43) AND (1 <= p66))))) AND A (G (((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p66))))))) : A (F ((E ((((1 <= p4) AND (1 <= p7) AND (1 <= p37) AND (1 <= p66)) U ((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66)))) OR A (F (((1 <= p21) AND (1 <= p24) AND (1 <= p27) AND (1 <= p66) AND (1 <= p9) AND (1 <= p29) AND (1 <= p35))))))) : A (((0 <= 0) U ((1 <= p9) AND (1 <= p12) AND (1 <= p53) AND (1 <= p66)))) : A (F (A (G (((1 <= p19) AND (1 <= p31) AND (1 <= p35) AND (1 <= p66)))))) : (((((NOT(E ((((1 <= p19) AND (1 <= p22) AND (1 <= p33) AND (1 <= p66)) U ((1 <= p57) AND (1 <= p60) AND (1 <= p64) AND (1 <= p66))))) AND NOT(A (G (((1 <= p28) AND (1 <= p36) AND (1 <= p43) AND (1 <= p66)))))) AND A (F (E (G (((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66) AND (1 <= p1) AND (1 <= p11) AND (1 <= p14))))))) AND ((p43 <= 0) OR (p46 <= 0) OR (p49 <= 0) OR (p66 <= 0))) AND ((p19 <= 0) OR (p26 <= 0) OR (p30 <= 0) OR (p66 <= 0))) AND ((p4 <= 0) OR (p9 <= 0) OR (p15 <= 0) OR (p66 <= 0))) : ((A (G (((1 <= p35) AND (1 <= p58) AND (1 <= p64) AND (1 <= p66)))) OR NOT(A (F (E (X (((1 <= p18) AND (1 <= p31) AND (1 <= p34) AND (1 <= p66)))))))) OR ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))) : E (G ((NOT(E (G (((1 <= p16) AND (1 <= p31) AND (1 <= p56) AND (1 <= p66))))) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p66 <= 0))))) : (A (X (A (F ((((1 <= p0) AND (1 <= p11) AND (1 <= p15) AND (1 <= p66)) OR ((1 <= p4) AND (1 <= p39) AND (1 <= p46) AND (1 <= p66))))))) OR ((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66))) : E (F (A (X (A (G (((1 <= p38) AND (1 <= p41) AND (1 <= p50) AND (1 <= p66)))))))) : A (((((((p4 <= 0) OR (p7 <= 0) OR (p37 <= 0)) OR A (F (((1 <= p41) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66))))) OR ((1 <= p44) AND (1 <= p60) AND (1 <= p63) AND (1 <= p66))) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66))) U A (X (((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66) AND (1 <= p38) AND (1 <= p41) AND (1 <= p50)))))) : (A ((E (F (((1 <= p57) AND (1 <= p60) AND (1 <= p64) AND (1 <= p66)))) U ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66)))) OR (((A (X (((1 <= p35) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66)))) AND (1 <= p43)) AND (1 <= p46)) AND (1 <= p49))) : (A (F (A (X ((((1 <= p40) AND (1 <= p44) AND (1 <= p48) AND (1 <= p66)) OR ((1 <= p28) AND (1 <= p34) AND (1 <= p64) AND (1 <= p66))))))) OR A (X (A (X (((1 <= p19) AND (1 <= p22) AND (1 <= p33) AND (1 <= p66) AND (1 <= p34) AND (1 <= p59) AND (1 <= p64))))))) : ((NOT(A (F ((((1 <= p9) AND (1 <= p12) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p13) AND (1 <= p66)))))) OR NOT(E (G (((p57 <= 0) OR (p60 <= 0) OR (p64 <= 0) OR (p66 <= 0)))))) OR ((1 <= p43) AND (1 <= p46) AND (1 <= p49) AND (1 <= p66) AND ((p0 <= 0) OR (p3 <= 0) OR (p13 <= 0) OR ((1 <= p17) AND (1 <= p29) AND (1 <= p37) AND (1 <= p14) AND (1 <= p23) AND (1 <= p25))))) : E (G (((A (F (((1 <= p10) AND (1 <= p14) AND (1 <= p17) AND (1 <= p66)))) AND ((p35 <= 0) OR (p58 <= 0) OR (p64 <= 0) OR (p66 <= 0) OR ((1 <= p40) AND (1 <= p44) AND (1 <= p48) AND (1 <= p66)) OR ((1 <= p36) AND (1 <= p45) AND (1 <= p61) AND (1 <= p66)))) AND (((1 <= p7) AND (1 <= p10) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p36) AND (1 <= p66)) OR (((p17 <= 0) OR (p29 <= 0) OR (p32 <= 0) OR (p66 <= 0)) AND ((p29 <= 0) OR (p36 <= 0) OR (p42 <= 0) OR (p66 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: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:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66)))) AND (A (F (((1 <= p21) AND (1 <= p24) AND (1 <= p27) AND (1 <= p66)))) AND (E (G (((1 <= p28) AND (1 <= p36) AND (1 <= p43) AND (1 <= p66)))) AND A (G (((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p66)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX(((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))) AND (AF(((1 <= p21) AND (1 <= p24) AND (1 <= p27) AND (1 <= p66))) AND (EG(((1 <= p28) AND (1 <= p36) AND (1 <= p43) AND (1 <= p66))) AND AG(((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p66)))))))
lola: processed formula length: 268
lola: 57 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: 578082 markings, 2921030 edges, 115616 markings/sec, 0 secs
lola: 1090473 markings, 5591065 edges, 102478 markings/sec, 5 secs
lola: 1513372 markings, 8159403 edges, 84580 markings/sec, 10 secs
lola: 1963507 markings, 10818132 edges, 90027 markings/sec, 15 secs
lola: 2431868 markings, 13552064 edges, 93672 markings/sec, 20 secs
lola: 2908685 markings, 16153717 edges, 95363 markings/sec, 25 secs
lola: 3359048 markings, 18660530 edges, 90073 markings/sec, 30 secs
lola: 3766953 markings, 21134636 edges, 81581 markings/sec, 35 secs
lola: 4193170 markings, 23750155 edges, 85243 markings/sec, 40 secs
lola: 4607869 markings, 26274053 edges, 82940 markings/sec, 45 secs
lola: 5019139 markings, 28809410 edges, 82254 markings/sec, 50 secs
lola: 5480787 markings, 31474157 edges, 92330 markings/sec, 55 secs
lola: 5912022 markings, 34110641 edges, 86247 markings/sec, 60 secs
lola: 6326536 markings, 36858916 edges, 82903 markings/sec, 65 secs
lola: 6673093 markings, 39413724 edges, 69311 markings/sec, 70 secs
lola: 7039659 markings, 41861349 edges, 73313 markings/sec, 75 secs
lola: 7446839 markings, 44448164 edges, 81436 markings/sec, 80 secs
lola: 7809981 markings, 47072030 edges, 72628 markings/sec, 85 secs
lola: 8196688 markings, 49612958 edges, 77341 markings/sec, 90 secs
lola: 8587003 markings, 52147948 edges, 78063 markings/sec, 95 secs
lola: 8953038 markings, 54712781 edges, 73207 markings/sec, 100 secs
lola: 9325232 markings, 57414414 edges, 74439 markings/sec, 105 secs
lola: 9680468 markings, 60023906 edges, 71047 markings/sec, 110 secs
lola: 9986008 markings, 62494717 edges, 61108 markings/sec, 115 secs
lola: 10311223 markings, 64999084 edges, 65043 markings/sec, 120 secs
lola: 10662460 markings, 67405512 edges, 70247 markings/sec, 125 secs
lola: 11028212 markings, 69930099 edges, 73150 markings/sec, 130 secs
lola: 11397387 markings, 72471660 edges, 73835 markings/sec, 135 secs
lola: 11740506 markings, 75011769 edges, 68624 markings/sec, 140 secs
lola: 12105649 markings, 77489866 edges, 73029 markings/sec, 145 secs
lola: 12422930 markings, 79864228 edges, 63456 markings/sec, 150 secs
lola: 12750499 markings, 82144452 edges, 65514 markings/sec, 155 secs
lola: 13108457 markings, 84709501 edges, 71592 markings/sec, 160 secs
lola: 13450037 markings, 87219132 edges, 68316 markings/sec, 165 secs
lola: 13920191 markings, 89802070 edges, 94031 markings/sec, 170 secs
lola: 14372495 markings, 92464618 edges, 90461 markings/sec, 175 secs
lola: 14603037 markings, 94934317 edges, 46108 markings/sec, 180 secs
lola: 14825376 markings, 97442430 edges, 44468 markings/sec, 185 secs
lola: 15128908 markings, 100119271 edges, 60706 markings/sec, 190 secs
lola: 15447802 markings, 102748856 edges, 63779 markings/sec, 195 secs
lola: 15662627 markings, 105212516 edges, 42965 markings/sec, 200 secs
lola: 15910953 markings, 107816112 edges, 49665 markings/sec, 205 secs
lola: 16205492 markings, 110499841 edges, 58908 markings/sec, 210 secs
lola: 16491753 markings, 113007338 edges, 57252 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1923472 KB
lola: time consumption: 226 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p35) AND (1 <= p58) AND (1 <= p64) AND (1 <= p66)))) OR (E (G (A (X (((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0) OR (p66 <= 0)))))) OR ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))
lola: processed formula length: 56
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p35) AND (1 <= p58) AND (1 <= p64) AND (1 <= p66))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p35) AND (1 <= p58) AND (1 <= p64) AND (1 <= p66))))
lola: processed formula length: 65
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p35 <= 0) OR (p58 <= 0) OR (p64 <= 0) OR (p66 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0) OR (p66 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0) OR (p66 <= 0))))
lola: processed formula length: 65
lola: 54 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: 30 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((((1 <= p0) AND (1 <= p11) AND (1 <= p15) AND (1 <= p66)) OR ((1 <= p4) AND (1 <= p39) AND (1 <= p46) AND (1 <= p66))))))) OR ((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p17) AND (1 <= p31) AND (1 <= p57) AND (1 <= p66))
lola: processed formula length: 57
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((1 <= p0) AND (1 <= p11) AND (1 <= p15) AND (1 <= p66)) OR ((1 <= p4) AND (1 <= p39) AND (1 <= p46) AND (1 <= p66)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p0 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p66 <= 0)) AND ((p4 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p66 <= 0)))
lola: processed formula length: 119
lola: 55 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p0) AND (1 <= p11) AND (1 <= p15) AND (1 <= p66)) OR ((1 <= p4) AND (1 <= p39) AND (1 <= p46) AND (1 <= p66)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 24 markings, 23 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
sara: try reading problem file CTLFireability-2-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (A (G (((1 <= p38) AND (1 <= p41) AND (1 <= p50) AND (1 <= p66))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(AG(((1 <= p38) AND (1 <= p41) AND (1 <= p50) AND (1 <= p66)))))
lola: processed formula length: 69
lola: 55 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: 23 markings, 44 edges
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p4 <= 0) OR (p7 <= 0) OR (p37 <= 0)) OR (A (F (((1 <= p41) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66)))) OR (((1 <= p44) AND (1 <= p60) AND (1 <= p63) AND (1 <= p66)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66))))) U A (X (((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66) AND (1 <= p38) AND (1 <= p41) AND (1 <= p50))))))
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:814
lola: processed formula: A((((p4 <= 0) OR (p7 <= 0) OR (p37 <= 0)) OR (AF(((1 <= p41) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66))) OR (((1 <= p44) AND (1 <= p60) AND (1 <= p63) AND (1 <= p66)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66))))) U AX(((1 <= p31) AND (1 <= p34) AND (1 <= p44) AND (1 <= p66) AND (1 <= p38) AND (1 <= p41) AND (1 <= p50))))
lola: processed formula length: 345
lola: 55 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (F (((1 <= p57) AND (1 <= p60) AND (1 <= p64) AND (1 <= p66)))) U ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66)))) OR (A (X (((1 <= p35) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66)))) AND ((1 <= p43) AND ((1 <= p46) AND (1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: (A(EF(((1 <= p57) AND (1 <= p60) AND (1 <= p64) AND (1 <= p66))) U ((1 <= p8) AND (1 <= p13) AND (1 <= p53) AND (1 <= p66))) OR (AX(((1 <= p35) AND (1 <= p45) AND (1 <= p48) AND (1 <= p66))) AND ((1 <= p43) AND ((1 <= p46) AND (1 <= p49)))))
lola: processed formula length: 241
lola: 55 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).
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25803 markings, 84659 edges
lola: ========================================
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((((1 <= p40) AND (1 <= p44) AND (1 <= p48) AND (1 <= p66)) OR ((1 <= p28) AND (1 <= p34) AND (1 <= p64) AND (1 <= p66))))))) OR A (X (A (X (((1 <= p19) AND (1 <= p22) AND (1 <= p33) AND (1 <= p66) AND (1 <= p34) AND (1 <= p59) AND (1 <= p64)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((((1 <= p40) AND (1 <= p44) AND (1 <= p48) AND (1 <= p66)) OR ((1 <= p28) AND (1 <= p34) AND (1 <= p64) AND (1 <= p66)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX((((1 <= p40) AND (1 <= p44) AND (1 <= p48) AND (1 <= p66)) OR ((1 <= p28) AND (1 <= p34) AND (1 <= p64) AND (1 <= p66)))))
lola: processed formula length: 129
lola: 54 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: 675666 markings, 3035512 edges, 135133 markings/sec, 0 secs
lola: 1372533 markings, 6566359 edges, 139373 markings/sec, 5 secs
lola: 1723626 markings, 8569253 edges, 70219 markings/sec, 10 secs
lola: 2253997 markings, 11326592 edges, 106074 markings/sec, 15 secs
lola: 2803747 markings, 14159885 edges, 109950 markings/sec, 20 secs
lola: 3498784 markings, 17762888 edges, 139007 markings/sec, 25 secs
lola: 4108966 markings, 21314174 edges, 122036 markings/sec, 30 secs
lola: 4620086 markings, 24259416 edges, 102224 markings/sec, 35 secs
lola: 5210647 markings, 27509658 edges, 118112 markings/sec, 40 secs
lola: 5878934 markings, 31188512 edges, 133657 markings/sec, 45 secs
lola: 6467021 markings, 34820860 edges, 117617 markings/sec, 50 secs
lola: 7045038 markings, 38507022 edges, 115603 markings/sec, 55 secs
lola: 7562186 markings, 41573351 edges, 103430 markings/sec, 60 secs
lola: 8060962 markings, 44755911 edges, 99755 markings/sec, 65 secs
lola: 8636928 markings, 48188146 edges, 115193 markings/sec, 70 secs
lola: 9161234 markings, 51559255 edges, 104861 markings/sec, 75 secs
lola: 9686069 markings, 55155230 edges, 104967 markings/sec, 80 secs
lola: 10090685 markings, 58166577 edges, 80923 markings/sec, 85 secs
lola: 10585590 markings, 61362600 edges, 98981 markings/sec, 90 secs
lola: 11095191 markings, 64509488 edges, 101920 markings/sec, 95 secs
lola: 11520584 markings, 67194202 edges, 85079 markings/sec, 100 secs
lola: 11961455 markings, 70094319 edges, 88174 markings/sec, 105 secs
lola: 12475647 markings, 73236651 edges, 102838 markings/sec, 110 secs
lola: 12956672 markings, 76391680 edges, 96205 markings/sec, 115 secs
lola: 13461968 markings, 79545618 edges, 101059 markings/sec, 120 secs
lola: 13875760 markings, 82274781 edges, 82758 markings/sec, 125 secs
lola: 14204130 markings, 84349362 edges, 65674 markings/sec, 130 secs
lola: 14730949 markings, 87769106 edges, 105364 markings/sec, 135 secs
lola: 15202117 markings, 90955359 edges, 94234 markings/sec, 140 secs
lola: 15671975 markings, 94363210 edges, 93972 markings/sec, 145 secs
lola: 16123667 markings, 97419346 edges, 90338 markings/sec, 150 secs
lola: 16619429 markings, 100786682 edges, 99152 markings/sec, 155 secs
lola: 17104275 markings, 104016289 edges, 96969 markings/sec, 160 secs
lola: 17530186 markings, 107026236 edges, 85182 markings/sec, 165 secs
lola: 17984972 markings, 109898845 edges, 90957 markings/sec, 170 secs
lola: 18438618 markings, 113018311 edges, 90729 markings/sec, 175 secs
lola: 18879835 markings, 116229734 edges, 88243 markings/sec, 180 secs
lola: 19291785 markings, 119399735 edges, 82390 markings/sec, 185 secs
lola: 19814398 markings, 122501790 edges, 104523 markings/sec, 190 secs
lola: 20335632 markings, 125569447 edges, 104247 markings/sec, 195 secs
lola: 20818588 markings, 128646391 edges, 96591 markings/sec, 200 secs
lola: 21372287 markings, 131978090 edges, 110740 markings/sec, 205 secs
lola: 21819841 markings, 135023847 edges, 89511 markings/sec, 210 secs
lola: 22266210 markings, 138102734 edges, 89274 markings/sec, 215 secs
lola: 22740859 markings, 141091279 edges, 94930 markings/sec, 220 secs
lola: 23245013 markings, 144261617 edges, 100831 markings/sec, 225 secs
lola: 23702210 markings, 147238717 edges, 91439 markings/sec, 230 secs
lola: 24169130 markings, 150446184 edges, 93384 markings/sec, 235 secs
lola: 24578834 markings, 153566497 edges, 81941 markings/sec, 240 secs
lola: 25051352 markings, 156862332 edges, 94504 markings/sec, 245 secs
lola: 25543237 markings, 160126722 edges, 98377 markings/sec, 250 secs
lola: 26001552 markings, 163247355 edges, 91663 markings/sec, 255 secs
lola: 26410805 markings, 166101708 edges, 81851 markings/sec, 260 secs
lola: 26918094 markings, 169392668 edges, 101458 markings/sec, 265 secs
lola: 27412174 markings, 172654459 edges, 98816 markings/sec, 270 secs
lola: 27882246 markings, 175790750 edges, 94014 markings/sec, 275 secs
lola: 28340520 markings, 179139443 edges, 91655 markings/sec, 280 secs
lola: 28750543 markings, 182276942 edges, 82005 markings/sec, 285 secs
lola: 29063008 markings, 184797850 edges, 62493 markings/sec, 290 secs
lola: 29464761 markings, 187831269 edges, 80351 markings/sec, 295 secs
lola: 29929369 markings, 191174477 edges, 92922 markings/sec, 300 secs
lola: 30349880 markings, 194549075 edges, 84102 markings/sec, 305 secs
lola: 30773077 markings, 197769173 edges, 84639 markings/sec, 310 secs
lola: 31279461 markings, 201199828 edges, 101277 markings/sec, 315 secs
lola: 31758462 markings, 204560065 edges, 95800 markings/sec, 320 secs
lola: 32196459 markings, 207813583 edges, 87599 markings/sec, 325 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown
lola: memory consumption: 3765468 KB
lola: time consumption: 561 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown

lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes unknown no yes no no unknown unknown unknown
lola: memory consumption: 3765468 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 12373672 kB
After kill :
MemTotal: 16427332 kB
MemFree: 12373680 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Solitaire-PT-EngCT7x7"
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 Solitaire-PT-EngCT7x7, 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 r194-csrt-159033389600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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