Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428400222.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is JoinFreeModules-PT-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428400222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 26 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 24 10:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 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 JoinFreeModules-PT-0200-00
FORMULA_NAME JoinFreeModules-PT-0200-01
FORMULA_NAME JoinFreeModules-PT-0200-02
FORMULA_NAME JoinFreeModules-PT-0200-03
FORMULA_NAME JoinFreeModules-PT-0200-04
FORMULA_NAME JoinFreeModules-PT-0200-05
FORMULA_NAME JoinFreeModules-PT-0200-06
FORMULA_NAME JoinFreeModules-PT-0200-07
FORMULA_NAME JoinFreeModules-PT-0200-08
FORMULA_NAME JoinFreeModules-PT-0200-09
FORMULA_NAME JoinFreeModules-PT-0200-10
FORMULA_NAME JoinFreeModules-PT-0200-11
FORMULA_NAME JoinFreeModules-PT-0200-12
FORMULA_NAME JoinFreeModules-PT-0200-13
FORMULA_NAME JoinFreeModules-PT-0200-14
FORMULA_NAME JoinFreeModules-PT-0200-15

=== Now, execution of the tool begins

BK_START 1620920426998

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 15:40:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 15:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 15:40:35] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2021-05-13 15:40:35] [INFO ] Transformed 1001 places.
[2021-05-13 15:40:35] [INFO ] Transformed 1601 transitions.
[2021-05-13 15:40:35] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 211 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100046 steps, including 0 resets, run finished after 1369 ms. (steps per millisecond=73 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-13 15:40:37] [INFO ] Computed 200 place invariants in 36 ms
[2021-05-13 15:40:37] [INFO ] [Real]Absence check using 200 positive place invariants in 122 ms returned sat
[2021-05-13 15:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:40:40] [INFO ] [Real]Absence check using state equation in 3105 ms returned sat
[2021-05-13 15:40:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 15:40:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 104 ms returned sat
[2021-05-13 15:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 15:41:01] [INFO ] [Nat]Absence check using state equation in 19823 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 15:41:01] [INFO ] [Real]Absence check using 200 positive place invariants in 100 ms returned sat
[2021-05-13 15:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:41:04] [INFO ] [Real]Absence check using state equation in 3010 ms returned sat
[2021-05-13 15:41:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 15:41:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 105 ms returned sat
[2021-05-13 15:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 15:41:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:41:18] [INFO ] [Nat]Absence check using state equation in 13877 ms returned unknown
[2021-05-13 15:41:18] [INFO ] [Real]Absence check using 200 positive place invariants in 101 ms returned sat
[2021-05-13 15:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:41:21] [INFO ] [Real]Absence check using state equation in 2925 ms returned sat
[2021-05-13 15:41:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 15:41:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 101 ms returned sat
[2021-05-13 15:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 15:41:41] [INFO ] [Nat]Absence check using state equation in 19826 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 15:41:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 15:41:42] [INFO ] Flatten gal took : 186 ms
FORMULA JoinFreeModules-PT-0200-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 15:41:42] [INFO ] Flatten gal took : 112 ms
[2021-05-13 15:41:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2021-05-13 15:41:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 27 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ JoinFreeModules-PT-0200 @ 3570 seconds

FORMULA JoinFreeModules-PT-0200-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1518
rslt: Output for LTLFireability @ JoinFreeModules-PT-0200

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 15:41:49 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 245
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((F ((p642 <= 1)) AND (F ((p692 <= 0)) AND G ((2 <= p817)))) U X ((2 <= p971))))",
"processed_size": 83,
"rewrites": 43
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((3 <= p498)) AND (G ((X ((3 <= p498)) OR (5 <= p805))) OR (3 <= p723)))))",
"processed_size": 83,
"rewrites": 43
},
"result":
{
"edges": 604,
"markings": 603,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((3 <= p595) OR (5 <= p230))",
"processed_size": 28,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((X ((3 <= p28)) OR (3 <= p303)))))",
"processed_size": 43,
"rewrites": 43
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((F ((5 <= p199)) AND (F ((p102 <= 1)) AND X ((p550 <= 4)))))))",
"processed_size": 71,
"rewrites": 43
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 478
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (F ((p634 <= 4))) U (3 <= p803))",
"processed_size": 35,
"rewrites": 43
},
"result":
{
"edges": 1204,
"markings": 1203,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 598
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F ((4 <= p398)) AND X ((2 <= p591)))))",
"processed_size": 45,
"rewrites": 43
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 797
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((5 <= p990)))",
"processed_size": 19,
"rewrites": 43
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1196
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(F ((p97 <= 0)) U (p97 <= 0))",
"processed_size": 29,
"rewrites": 43
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F ((p773 <= 3)) AND (4 <= p688))))",
"processed_size": 41,
"rewrites": 43
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((3 <= p595) OR (5 <= p230))",
"processed_size": 28,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3412,
"runtime": 2052.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(**) U (X(**) OR (G(**) AND X(F(**))))) : X((X(G((F(**) OR G(**)))) U G(**))) : X(((F(*) AND (F(*) AND G(**))) U X(**))) : G(F((F(*) AND **))) : F(G((F(**) AND (G((X(**) OR **)) OR **)))) : (X(G(**)) OR (** OR **)) : F(G((X(X(G(*))) OR (** OR **)))) : X(X(G((X(**) OR **)))) : X(X(F((F(*) AND (F(**) AND X(*)))))) : X((((* AND (F(*) OR G(*))) OR G(**)) U G(**))) : (F(*) U **) : (X(F(**)) U **) : F(G(**)) : G(F((F(**) AND X(**))))"
},
"net":
{
"arcs": 4600,
"conflict_clusters": 801,
"places": 1000,
"places_significant": 800,
"singleton_clusters": 0,
"transitions": 1601
},
"result":
{
"preliminary_value": "unknown unknown no no no unknown unknown no no unknown no no no no ",
"value": "unknown unknown no no no unknown unknown no no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32000
lola: finding significant places
lola: 1000 places, 1601 transitions, 800 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 LTLFireability.xml
lola: (X ((p371 <= 1)) U (G ((2 <= p262)) U X ((5 <= p465)))) : (X (G (X ((F ((2 <= p602)) OR G ((2 <= p137)))))) U X (G (((p748 <= 2) OR (p195 <= 4))))) : X ((((NOT(G ((2 <= p642))) AND NOT(G ((1 <= p692)))) AND G ((2 <= p817))) U X ((2 <= p971)))) : G (F ((NOT(G ((4 <= p773))) AND (4 <= p688)))) : F (G ((F ((3 <= p498)) AND (G ((X ((3 <= p498)) OR (5 <= p805))) OR (3 <= p723))))) : ((X (G ((2 <= p512))) OR (3 <= p595)) OR (5 <= p230)) : G (X (F (X (F (G (((X (NOT(X (F ((2 <= p696))))) OR (1 <= p917)) OR (2 <= p802)))))))) : X (X (G ((X ((3 <= p28)) OR (3 <= p303))))) : X (F (X (((NOT(G ((p199 <= 4))) AND F ((p102 <= 1))) AND NOT(X ((5 <= p550))))))) : X (((NOT((G ((4 <= p198)) U (2 <= p502))) OR G ((4 <= p198))) U G ((p346 <= 1)))) : (((4 <= p8) U NOT(G ((1 <= p97)))) U (p97 <= 0)) : (X (F ((p634 <= 4))) U (3 <= p803)) : G (F (((G (((1 <= p957) U (5 <= p990))) OR (p928 <= 3)) U G ((5 <= p990))))) : X (G (((2 <= p746) U F ((F ((4 <= p398)) AND X ((2 <= p591)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p371 <= 1)) U (X ((5 <= p465)) OR (G ((2 <= p262)) AND X (F ((5 <= p465))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p371 <= 1)) U (X ((5 <= p465)) OR (G ((2 <= p262)) AND X (F ((5 <= p465))))))
lola: processed formula length: 82
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 383396 markings, 546716 edges, 76679 markings/sec, 0 secs
lola: 1467892 markings, 2093398 edges, 216899 markings/sec, 5 secs
lola: 1835999 markings, 2618329 edges, 73621 markings/sec, 10 secs
lola: 2203071 markings, 3141854 edges, 73414 markings/sec, 15 secs
lola: 2570919 markings, 3666237 edges, 73570 markings/sec, 20 secs
lola: 2937396 markings, 4189098 edges, 73295 markings/sec, 25 secs
lola: 3305147 markings, 4713435 edges, 73550 markings/sec, 30 secs
lola: 3671429 markings, 5236161 edges, 73256 markings/sec, 35 secs
lola: 4044328 markings, 5767904 edges, 74580 markings/sec, 40 secs
lola: 4417568 markings, 6300088 edges, 74648 markings/sec, 45 secs
lola: 4791217 markings, 6833367 edges, 74730 markings/sec, 50 secs
lola: 5164181 markings, 7365467 edges, 74593 markings/sec, 55 secs
lola: 5538872 markings, 7899639 edges, 74938 markings/sec, 60 secs
lola: 5912004 markings, 8431980 edges, 74626 markings/sec, 65 secs
lola: 6286002 markings, 8965024 edges, 74800 markings/sec, 70 secs
lola: 6657928 markings, 9495869 edges, 74385 markings/sec, 75 secs
lola: 7030061 markings, 10026893 edges, 74427 markings/sec, 80 secs
lola: 7402433 markings, 10557987 edges, 74474 markings/sec, 85 secs
lola: 7776208 markings, 11090950 edges, 74755 markings/sec, 90 secs
lola: 8148866 markings, 11622397 edges, 74532 markings/sec, 95 secs
lola: 8521516 markings, 12153923 edges, 74530 markings/sec, 100 secs
lola: 8826151 markings, 12588615 edges, 60927 markings/sec, 105 secs
lola: 9090400 markings, 12965336 edges, 52850 markings/sec, 110 secs
lola: 9343390 markings, 13327984 edges, 50598 markings/sec, 115 secs
lola: 9658691 markings, 13776251 edges, 63060 markings/sec, 120 secs
lola: 9761415 markings, 13922552 edges, 20545 markings/sec, 125 secs
lola: 10041519 markings, 14322478 edges, 56021 markings/sec, 130 secs
lola: 10323811 markings, 14724802 edges, 56458 markings/sec, 135 secs
lola: 10649405 markings, 15189246 edges, 65119 markings/sec, 140 secs
lola: 10780005 markings, 15375354 edges, 26120 markings/sec, 145 secs
lola: 10780005 markings, 15375354 edges, 0 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((F ((2 <= p602)) OR G ((2 <= p137))))) U G (((p748 <= 2) OR (p195 <= 4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((F ((2 <= p602)) OR G ((2 <= p137))))) U G (((p748 <= 2) OR (p195 <= 4)))))
lola: processed formula length: 86
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 275985 markings, 393611 edges, 55197 markings/sec, 0 secs
lola: 641038 markings, 914040 edges, 73011 markings/sec, 5 secs
lola: 1012857 markings, 1444529 edges, 74364 markings/sec, 10 secs
lola: 1382897 markings, 1972287 edges, 74008 markings/sec, 15 secs
lola: 1750885 markings, 2497053 edges, 73598 markings/sec, 20 secs
lola: 2122148 markings, 3026577 edges, 74253 markings/sec, 25 secs
lola: 2493794 markings, 3556789 edges, 74329 markings/sec, 30 secs
lola: 2867043 markings, 4088906 edges, 74650 markings/sec, 35 secs
lola: 3238969 markings, 4619620 edges, 74385 markings/sec, 40 secs
lola: 3609761 markings, 5148419 edges, 74158 markings/sec, 45 secs
lola: 3981935 markings, 5679298 edges, 74435 markings/sec, 50 secs
lola: 4353189 markings, 6208814 edges, 74251 markings/sec, 55 secs
lola: 4723736 markings, 6737450 edges, 74109 markings/sec, 60 secs
lola: 5095207 markings, 7267384 edges, 74294 markings/sec, 65 secs
lola: 5464150 markings, 7793500 edges, 73789 markings/sec, 70 secs
lola: 5825939 markings, 8309423 edges, 72358 markings/sec, 75 secs
lola: 6186987 markings, 8824627 edges, 72210 markings/sec, 80 secs
lola: 6551065 markings, 9343892 edges, 72816 markings/sec, 85 secs
lola: 6922153 markings, 9873164 edges, 74218 markings/sec, 90 secs
lola: 7291865 markings, 10400442 edges, 73942 markings/sec, 95 secs
lola: 7660995 markings, 10927179 edges, 73826 markings/sec, 100 secs
lola: 8019330 markings, 11438185 edges, 71667 markings/sec, 105 secs
lola: 8136026 markings, 11604713 edges, 23339 markings/sec, 110 secs
lola: 8328505 markings, 11879246 edges, 38496 markings/sec, 115 secs
lola: 8476607 markings, 12090621 edges, 29620 markings/sec, 120 secs
lola: 8656772 markings, 12347295 edges, 36033 markings/sec, 125 secs
lola: 8872796 markings, 12655781 edges, 43205 markings/sec, 130 secs
lola: 9103352 markings, 12984366 edges, 46111 markings/sec, 135 secs
lola: 9314856 markings, 13285925 edges, 42301 markings/sec, 140 secs
lola: 9557860 markings, 13632595 edges, 48601 markings/sec, 145 secs
lola: 9735275 markings, 13885860 edges, 35483 markings/sec, 150 secs
lola: 9822913 markings, 14010645 edges, 17528 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F ((p642 <= 1)) AND (F ((p692 <= 0)) AND G ((2 <= p817)))) U X ((2 <= p971))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((p642 <= 1)) AND (F ((p692 <= 0)) AND G ((2 <= p817)))) U X ((2 <= p971))))
lola: processed formula length: 83
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((3 <= p498)) AND (G ((X ((3 <= p498)) OR (5 <= p805))) OR (3 <= p723)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((3 <= p498)) AND (G ((X ((3 <= p498)) OR (5 <= p805))) OR (3 <= p723)))))
lola: processed formula length: 83
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 603 markings, 604 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((2 <= p512))) OR ((3 <= p595) OR (5 <= p230)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p595) OR (5 <= p230))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((3 <= p595) OR (5 <= p230))
lola: processed formula length: 28
lola: 44 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 5 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p512)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p512)))
lola: processed formula length: 19
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 361096 markings, 514847 edges, 72219 markings/sec, 0 secs
lola: 739623 markings, 1054846 edges, 75705 markings/sec, 5 secs
lola: 1117315 markings, 1593373 edges, 75538 markings/sec, 10 secs
lola: 1492852 markings, 2129017 edges, 75107 markings/sec, 15 secs
lola: 1861800 markings, 2655351 edges, 73790 markings/sec, 20 secs
lola: 2234398 markings, 3186766 edges, 74520 markings/sec, 25 secs
lola: 2682152 markings, 3825227 edges, 89551 markings/sec, 30 secs
lola: 3061776 markings, 4366704 edges, 75925 markings/sec, 35 secs
lola: 3456739 markings, 4930176 edges, 78993 markings/sec, 40 secs
lola: 3833596 markings, 5467811 edges, 75371 markings/sec, 45 secs
lola: 4203444 markings, 5995298 edges, 73970 markings/sec, 50 secs
lola: 4576516 markings, 6527492 edges, 74614 markings/sec, 55 secs
lola: 4954788 markings, 7067053 edges, 75654 markings/sec, 60 secs
lola: 5334391 markings, 7608430 edges, 75921 markings/sec, 65 secs
lola: 5713730 markings, 8149571 edges, 75868 markings/sec, 70 secs
lola: 6092024 markings, 8689060 edges, 75659 markings/sec, 75 secs
lola: 6469014 markings, 9226717 edges, 75398 markings/sec, 80 secs
lola: 6846339 markings, 9765072 edges, 75465 markings/sec, 85 secs
lola: 7223788 markings, 10303375 edges, 75490 markings/sec, 90 secs
lola: 7600211 markings, 10840482 edges, 75285 markings/sec, 95 secs
lola: 7915874 markings, 11290703 edges, 63133 markings/sec, 100 secs
lola: 8185798 markings, 11675692 edges, 53985 markings/sec, 105 secs
lola: 8458010 markings, 12063816 edges, 54442 markings/sec, 110 secs
lola: 8610313 markings, 12281185 edges, 30461 markings/sec, 115 secs
lola: 8753786 markings, 12485788 edges, 28695 markings/sec, 120 secs
lola: 8961347 markings, 12781755 edges, 41512 markings/sec, 125 secs
lola: 9008008 markings, 12848423 edges, 9332 markings/sec, 130 secs
lola: 9286329 markings, 13245344 edges, 55664 markings/sec, 135 secs
lola: 9286329 markings, 13245344 edges, 0 markings/sec, 140 secs
lola: 9598684 markings, 13691041 edges, 62471 markings/sec, 145 secs
lola: 9639247 markings, 13748661 edges, 8113 markings/sec, 150 secs
lola: 9640248 markings, 13750249 edges, 200 markings/sec, 155 secs
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 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (G ((p696 <= 1)))) OR ((1 <= p917) OR (2 <= p802)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (G ((p696 <= 1)))) OR ((1 <= p917) OR (2 <= p802)))))
lola: processed formula length: 65
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 357379 markings, 509684 edges, 71476 markings/sec, 0 secs
lola: 592682 markings, 845054 edges, 47061 markings/sec, 5 secs
lola: 953647 markings, 1360106 edges, 72193 markings/sec, 10 secs
lola: 1319027 markings, 1881139 edges, 73076 markings/sec, 15 secs
lola: 1681588 markings, 2398115 edges, 72512 markings/sec, 20 secs
lola: 2052216 markings, 2926944 edges, 74126 markings/sec, 25 secs
lola: 2418658 markings, 3449426 edges, 73288 markings/sec, 30 secs
lola: 2784452 markings, 3971188 edges, 73159 markings/sec, 35 secs
lola: 3158313 markings, 4504370 edges, 74772 markings/sec, 40 secs
lola: 3594599 markings, 5126795 edges, 87257 markings/sec, 45 secs
lola: 3970778 markings, 5663436 edges, 75236 markings/sec, 50 secs
lola: 4348026 markings, 6201418 edges, 75450 markings/sec, 55 secs
lola: 4724297 markings, 6738255 edges, 75254 markings/sec, 60 secs
lola: 5098295 markings, 7271729 edges, 74800 markings/sec, 65 secs
lola: 5469443 markings, 7801145 edges, 74230 markings/sec, 70 secs
lola: 5847379 markings, 8340209 edges, 75587 markings/sec, 75 secs
lola: 6221810 markings, 8874154 edges, 74886 markings/sec, 80 secs
lola: 6593904 markings, 9405042 edges, 74419 markings/sec, 85 secs
lola: 6970809 markings, 9942670 edges, 75381 markings/sec, 90 secs
lola: 7347010 markings, 10479083 edges, 75240 markings/sec, 95 secs
lola: 7722239 markings, 11014341 edges, 75046 markings/sec, 100 secs
lola: 8012986 markings, 11429271 edges, 58149 markings/sec, 105 secs
lola: 8232676 markings, 11742619 edges, 43938 markings/sec, 110 secs
lola: 8495261 markings, 12116990 edges, 52517 markings/sec, 115 secs
lola: 8615261 markings, 12288056 edges, 24000 markings/sec, 120 secs
lola: 8794147 markings, 12543354 edges, 35777 markings/sec, 125 secs
lola: 8963172 markings, 12784321 edges, 33805 markings/sec, 130 secs
lola: 9136966 markings, 13032173 edges, 34759 markings/sec, 135 secs
lola: 9365074 markings, 13357693 edges, 45622 markings/sec, 140 secs
lola: 9572429 markings, 13653606 edges, 41471 markings/sec, 145 secs
lola: 9678473 markings, 13804797 edges, 21209 markings/sec, 150 secs
lola: 9825352 markings, 14014165 edges, 29376 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X ((3 <= p28)) OR (3 <= p303)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X ((3 <= p28)) OR (3 <= p303)))))
lola: processed formula length: 43
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F ((5 <= p199)) AND (F ((p102 <= 1)) AND X ((p550 <= 4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F ((5 <= p199)) AND (F ((p102 <= 1)) AND X ((p550 <= 4)))))))
lola: processed formula length: 71
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p502 <= 1) AND (F ((p198 <= 3)) OR G ((p502 <= 1)))) OR G ((4 <= p198))) U G ((p346 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p502 <= 1) AND (F ((p198 <= 3)) OR G ((p502 <= 1)))) OR G ((4 <= p198))) U G ((p346 <= 1))))
lola: processed formula length: 99
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 362576 markings, 516992 edges, 72515 markings/sec, 0 secs
lola: 645313 markings, 920189 edges, 56547 markings/sec, 5 secs
lola: 1022235 markings, 1457812 edges, 75384 markings/sec, 10 secs
lola: 1397483 markings, 1992956 edges, 75050 markings/sec, 15 secs
lola: 1768982 markings, 2522908 edges, 74300 markings/sec, 20 secs
lola: 2143889 markings, 3057472 edges, 74981 markings/sec, 25 secs
lola: 2517876 markings, 3590900 edges, 74797 markings/sec, 30 secs
lola: 2894658 markings, 4128297 edges, 75356 markings/sec, 35 secs
lola: 3266133 markings, 4658225 edges, 74295 markings/sec, 40 secs
lola: 3642785 markings, 5195493 edges, 75330 markings/sec, 45 secs
lola: 4017120 markings, 5729539 edges, 74867 markings/sec, 50 secs
lola: 4393630 markings, 6266483 edges, 75302 markings/sec, 55 secs
lola: 4763456 markings, 6794023 edges, 73965 markings/sec, 60 secs
lola: 5140867 markings, 7332536 edges, 75482 markings/sec, 65 secs
lola: 5515818 markings, 7867213 edges, 74990 markings/sec, 70 secs
lola: 5892295 markings, 8404068 edges, 75295 markings/sec, 75 secs
lola: 6268011 markings, 8940069 edges, 75143 markings/sec, 80 secs
lola: 6643312 markings, 9475434 edges, 75060 markings/sec, 85 secs
lola: 7020166 markings, 10012955 edges, 75371 markings/sec, 90 secs
lola: 7396310 markings, 10549463 edges, 75229 markings/sec, 95 secs
lola: 7771267 markings, 11084488 edges, 74991 markings/sec, 100 secs
lola: 8121132 markings, 11583262 edges, 69973 markings/sec, 105 secs
lola: 8234452 markings, 11746974 edges, 22664 markings/sec, 110 secs
lola: 8474315 markings, 12087065 edges, 47973 markings/sec, 115 secs
lola: 8750756 markings, 12481382 edges, 55288 markings/sec, 120 secs
lola: 9013732 markings, 12856501 edges, 52595 markings/sec, 125 secs
lola: 9094212 markings, 12971207 edges, 16096 markings/sec, 130 secs
lola: 9329132 markings, 13306415 edges, 46984 markings/sec, 135 secs
lola: 9484074 markings, 13527561 edges, 30988 markings/sec, 140 secs
lola: 9673075 markings, 13797139 edges, 37800 markings/sec, 145 secs
lola: 9823899 markings, 14012123 edges, 30165 markings/sec, 150 secs
lola: 9823997 markings, 14012221 edges, 20 markings/sec, 155 secs
lola: 9824147 markings, 14012372 edges, 30 markings/sec, 160 secs
lola: 9824257 markings, 14012550 edges, 22 markings/sec, 165 secs
lola: 9824395 markings, 14012792 edges, 28 markings/sec, 170 secs
lola: 9824532 markings, 14013031 edges, 27 markings/sec, 175 secs
lola: 9824650 markings, 14013237 edges, 24 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p634 <= 4))) U (3 <= p803))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((p634 <= 4))) U (3 <= p803))
lola: processed formula length: 35
lola: 43 rewrites
lola: closed formula file LTLFireability.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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1203 markings, 1204 edges
lola: ========================================
lola: subprocess 10 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((4 <= p398)) AND X ((2 <= p591)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((4 <= p398)) AND X ((2 <= p591)))))
lola: processed formula length: 45
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 11 will run for 797 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((5 <= p990)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((5 <= p990)))
lola: processed formula length: 19
lola: 43 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 1196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p97 <= 0)) U (p97 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p97 <= 0)) U (p97 <= 0))
lola: processed formula length: 29
lola: 43 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 13 will run for 2393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p773 <= 3)) AND (4 <= p688))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p773 <= 3)) AND (4 <= p688))))
lola: processed formula length: 41
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X ((p371 <= 1)) U (X ((5 <= p465)) OR (G ((2 <= p262)) AND X (F ((5 <= p465))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p371 <= 1)) U (X ((5 <= p465)) OR (G ((2 <= p262)) AND X (F ((5 <= p465))))))
lola: processed formula length: 82
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 322636 markings, 460048 edges, 64527 markings/sec, 0 secs
lola: 661173 markings, 942591 edges, 67707 markings/sec, 5 secs
lola: 1030446 markings, 1469252 edges, 73855 markings/sec, 10 secs
lola: 1399444 markings, 1995893 edges, 73800 markings/sec, 15 secs
lola: 1768671 markings, 2522339 edges, 73845 markings/sec, 20 secs
lola: 2138483 markings, 3049768 edges, 73962 markings/sec, 25 secs
lola: 2507719 markings, 3576183 edges, 73847 markings/sec, 30 secs
lola: 2872749 markings, 4097014 edges, 73006 markings/sec, 35 secs
lola: 3224230 markings, 4598305 edges, 70296 markings/sec, 40 secs
lola: 3578987 markings, 5104231 edges, 70951 markings/sec, 45 secs
lola: 3942831 markings, 5623029 edges, 72769 markings/sec, 50 secs
lola: 4312613 markings, 6150362 edges, 73956 markings/sec, 55 secs
lola: 4807695 markings, 6856850 edges, 99016 markings/sec, 60 secs
lola: 5177511 markings, 7384335 edges, 73963 markings/sec, 65 secs
lola: 5695883 markings, 8123460 edges, 103674 markings/sec, 70 secs
lola: 6064570 markings, 8649444 edges, 73737 markings/sec, 75 secs
lola: 6554631 markings, 9348452 edges, 98012 markings/sec, 80 secs
lola: 6921762 markings, 9872166 edges, 73426 markings/sec, 85 secs
lola: 7290098 markings, 10397664 edges, 73667 markings/sec, 90 secs
lola: 7659560 markings, 10924890 edges, 73892 markings/sec, 95 secs
lola: 8031105 markings, 11454499 edges, 74309 markings/sec, 100 secs
lola: 8401288 markings, 11982573 edges, 74037 markings/sec, 105 secs
lola: 8719447 markings, 12436589 edges, 63632 markings/sec, 110 secs
lola: 9057066 markings, 12919194 edges, 67524 markings/sec, 115 secs
lola: 9390144 markings, 13393391 edges, 66616 markings/sec, 120 secs
lola: 9414544 markings, 13428001 edges, 4880 markings/sec, 125 secs
lola: 9700205 markings, 13835303 edges, 57132 markings/sec, 130 secs
lola: 9772170 markings, 13937885 edges, 14393 markings/sec, 135 secs
lola: 10007141 markings, 14273043 edges, 46994 markings/sec, 140 secs
lola: 10125961 markings, 14442532 edges, 23764 markings/sec, 145 secs
lola: 10341085 markings, 14749293 edges, 43025 markings/sec, 150 secs
lola: 10474929 markings, 14940626 edges, 26769 markings/sec, 155 secs
lola: 10662081 markings, 15207415 edges, 37430 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((X (G ((F ((2 <= p602)) OR G ((2 <= p137))))) U G (((p748 <= 2) OR (p195 <= 4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((F ((2 <= p602)) OR G ((2 <= p137))))) U G (((p748 <= 2) OR (p195 <= 4)))))
lola: processed formula length: 86
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 355226 markings, 506399 edges, 71045 markings/sec, 0 secs
lola: 726310 markings, 1035713 edges, 74217 markings/sec, 5 secs
lola: 1097446 markings, 1565074 edges, 74227 markings/sec, 10 secs
lola: 1464347 markings, 2088435 edges, 73380 markings/sec, 15 secs
lola: 1829552 markings, 2609254 edges, 73041 markings/sec, 20 secs
lola: 1931910 markings, 2755329 edges, 20472 markings/sec, 25 secs
lola: 2300220 markings, 3280568 edges, 73662 markings/sec, 30 secs
lola: 2670420 markings, 3808714 edges, 74040 markings/sec, 35 secs
lola: 3040500 markings, 4336462 edges, 74016 markings/sec, 40 secs
lola: 3409089 markings, 4862200 edges, 73718 markings/sec, 45 secs
lola: 3776378 markings, 5386075 edges, 73458 markings/sec, 50 secs
lola: 4145992 markings, 5913349 edges, 73923 markings/sec, 55 secs
lola: 4513938 markings, 6438173 edges, 73589 markings/sec, 60 secs
lola: 4882494 markings, 6963961 edges, 73711 markings/sec, 65 secs
lola: 5253716 markings, 7493388 edges, 74244 markings/sec, 70 secs
lola: 5623182 markings, 8020267 edges, 73893 markings/sec, 75 secs
lola: 5992930 markings, 8547598 edges, 73950 markings/sec, 80 secs
lola: 6361935 markings, 9074076 edges, 73801 markings/sec, 85 secs
lola: 6730648 markings, 9600147 edges, 73743 markings/sec, 90 secs
lola: 7101436 markings, 10128829 edges, 74158 markings/sec, 95 secs
lola: 7470601 markings, 10655547 edges, 73833 markings/sec, 100 secs
lola: 7839995 markings, 11182425 edges, 73879 markings/sec, 105 secs
lola: 8134405 markings, 11602465 edges, 58882 markings/sec, 110 secs
lola: 8240298 markings, 11753375 edges, 21179 markings/sec, 115 secs
lola: 8411148 markings, 11996986 edges, 34170 markings/sec, 120 secs
lola: 8638710 markings, 12321498 edges, 45512 markings/sec, 125 secs
lola: 8746980 markings, 12476116 edges, 21654 markings/sec, 130 secs
lola: 9010205 markings, 12851441 edges, 52645 markings/sec, 135 secs
lola: 9072536 markings, 12940421 edges, 12466 markings/sec, 140 secs
lola: 9355021 markings, 13343227 edges, 56497 markings/sec, 145 secs
lola: 9425455 markings, 13443716 edges, 14087 markings/sec, 150 secs
lola: 9629482 markings, 13734776 edges, 40805 markings/sec, 155 secs
lola: 9784794 markings, 13956451 edges, 31062 markings/sec, 160 secs
lola: 9822250 markings, 14009886 edges, 7491 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (G ((2 <= p512))) OR ((3 <= p595) OR (5 <= p230)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((3 <= p595) OR (5 <= p230))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((3 <= p595) OR (5 <= p230))
lola: processed formula length: 28
lola: 44 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p512)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p512)))
lola: processed formula length: 19
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 357319 markings, 509579 edges, 71464 markings/sec, 0 secs
lola: 731894 markings, 1043649 edges, 74915 markings/sec, 5 secs
lola: 1079893 markings, 1539948 edges, 69600 markings/sec, 10 secs
lola: 1451786 markings, 2070568 edges, 74379 markings/sec, 15 secs
lola: 1823140 markings, 2600211 edges, 74271 markings/sec, 20 secs
lola: 1874130 markings, 2672979 edges, 10198 markings/sec, 25 secs
lola: 2121477 markings, 3025611 edges, 49469 markings/sec, 30 secs
lola: 2498748 markings, 3563674 edges, 75454 markings/sec, 35 secs
lola: 2876277 markings, 4102225 edges, 75506 markings/sec, 40 secs
lola: 3251775 markings, 4637777 edges, 75100 markings/sec, 45 secs
lola: 3625094 markings, 5170347 edges, 74664 markings/sec, 50 secs
lola: 4001730 markings, 5707522 edges, 75327 markings/sec, 55 secs
lola: 4377563 markings, 6243725 edges, 75167 markings/sec, 60 secs
lola: 4752053 markings, 6777792 edges, 74898 markings/sec, 65 secs
lola: 5128140 markings, 7314293 edges, 75217 markings/sec, 70 secs
lola: 5502302 markings, 7848030 edges, 74832 markings/sec, 75 secs
lola: 5878113 markings, 8383944 edges, 75162 markings/sec, 80 secs
lola: 6251886 markings, 8917171 edges, 74755 markings/sec, 85 secs
lola: 6626148 markings, 9450983 edges, 74852 markings/sec, 90 secs
lola: 7002712 markings, 9988145 edges, 75313 markings/sec, 95 secs
lola: 7377770 markings, 10523099 edges, 75012 markings/sec, 100 secs
lola: 7752156 markings, 11057211 edges, 74877 markings/sec, 105 secs
lola: 8097231 markings, 11549392 edges, 69015 markings/sec, 110 secs
lola: 8109712 markings, 11567110 edges, 2496 markings/sec, 115 secs
lola: 8421152 markings, 12011434 edges, 62288 markings/sec, 120 secs
lola: 8473759 markings, 12086455 edges, 10521 markings/sec, 125 secs
lola: 8679567 markings, 12379963 edges, 41162 markings/sec, 130 secs
lola: 8821302 markings, 12582046 edges, 28347 markings/sec, 135 secs
lola: 8955416 markings, 12773426 edges, 26823 markings/sec, 140 secs
lola: 9232927 markings, 13169261 edges, 55502 markings/sec, 145 secs
lola: 9568272 markings, 13647685 edges, 67069 markings/sec, 150 secs
lola: 9576678 markings, 13659621 edges, 1681 markings/sec, 155 secs
lola: 9805160 markings, 13985387 edges, 45696 markings/sec, 160 secs
lola: 9805257 markings, 13985556 edges, 19 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (G ((p696 <= 1)))) OR ((1 <= p917) OR (2 <= p802)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (G ((p696 <= 1)))) OR ((1 <= p917) OR (2 <= p802)))))
lola: processed formula length: 65
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 204407 markings, 291459 edges, 40881 markings/sec, 0 secs
lola: 580794 markings, 828273 edges, 75277 markings/sec, 5 secs
lola: 847050 markings, 1207988 edges, 53251 markings/sec, 10 secs
lola: 1220809 markings, 1740974 edges, 74752 markings/sec, 15 secs
lola: 1594000 markings, 2273395 edges, 74638 markings/sec, 20 secs
lola: 1965874 markings, 2803601 edges, 74375 markings/sec, 25 secs
lola: 2340765 markings, 3338446 edges, 74978 markings/sec, 30 secs
lola: 2717809 markings, 3876120 edges, 75409 markings/sec, 35 secs
lola: 3105975 markings, 4429761 edges, 77633 markings/sec, 40 secs
lola: 3481650 markings, 4965737 edges, 75135 markings/sec, 45 secs
lola: 3856574 markings, 5500417 edges, 74985 markings/sec, 50 secs
lola: 4231262 markings, 6035048 edges, 74938 markings/sec, 55 secs
lola: 4604035 markings, 6566784 edges, 74555 markings/sec, 60 secs
lola: 4978619 markings, 7100897 edges, 74917 markings/sec, 65 secs
lola: 5478233 markings, 7813496 edges, 99923 markings/sec, 70 secs
lola: 5852592 markings, 8347542 edges, 74872 markings/sec, 75 secs
lola: 6227488 markings, 8882185 edges, 74979 markings/sec, 80 secs
lola: 6601969 markings, 9416470 edges, 74896 markings/sec, 85 secs
lola: 6978557 markings, 9953552 edges, 75318 markings/sec, 90 secs
lola: 7354212 markings, 10489455 edges, 75131 markings/sec, 95 secs
lola: 7729173 markings, 11024220 edges, 74992 markings/sec, 100 secs
lola: 8086921 markings, 11534576 edges, 71550 markings/sec, 105 secs
lola: 8223161 markings, 11728831 edges, 27248 markings/sec, 110 secs
lola: 8430152 markings, 12024095 edges, 41398 markings/sec, 115 secs
lola: 8700511 markings, 12411469 edges, 54072 markings/sec, 120 secs
lola: 9041011 markings, 12895619 edges, 68100 markings/sec, 125 secs
lola: 9053408 markings, 12913197 edges, 2479 markings/sec, 130 secs
lola: 9356253 markings, 13344977 edges, 60569 markings/sec, 135 secs
lola: 9403710 markings, 13412806 edges, 9491 markings/sec, 140 secs
lola: 9624170 markings, 13727193 edges, 44092 markings/sec, 145 secs
lola: 9806559 markings, 13987389 edges, 36478 markings/sec, 150 secs
lola: 9824818 markings, 14013533 edges, 3652 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (((((p502 <= 1) AND (F ((p198 <= 3)) OR G ((p502 <= 1)))) OR G ((4 <= p198))) U G ((p346 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p502 <= 1) AND (F ((p198 <= 3)) OR G ((p502 <= 1)))) OR G ((4 <= p198))) U G ((p346 <= 1))))
lola: processed formula length: 99
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 360425 markings, 513951 edges, 72085 markings/sec, 0 secs
lola: 736433 markings, 1050151 edges, 75202 markings/sec, 5 secs
lola: 1111772 markings, 1585457 edges, 75068 markings/sec, 10 secs
lola: 1484517 markings, 2117119 edges, 74549 markings/sec, 15 secs
lola: 1856815 markings, 2648035 edges, 74460 markings/sec, 20 secs
lola: 2232485 markings, 3183918 edges, 75134 markings/sec, 25 secs
lola: 2897318 markings, 4132088 edges, 132967 markings/sec, 30 secs
lola: 3273344 markings, 4668619 edges, 75205 markings/sec, 35 secs
lola: 4132212 markings, 5893681 edges, 171774 markings/sec, 40 secs
lola: 4505387 markings, 6425887 edges, 74635 markings/sec, 45 secs
lola: 4879297 markings, 6959255 edges, 74782 markings/sec, 50 secs
lola: 5253582 markings, 7493155 edges, 74857 markings/sec, 55 secs
lola: 5628271 markings, 8027650 edges, 74938 markings/sec, 60 secs
lola: 6093479 markings, 8691103 edges, 93042 markings/sec, 65 secs
lola: 6465920 markings, 9222444 edges, 74488 markings/sec, 70 secs
lola: 6841411 markings, 9758034 edges, 75098 markings/sec, 75 secs
lola: 7217781 markings, 10294922 edges, 75274 markings/sec, 80 secs
lola: 7593380 markings, 10830715 edges, 75120 markings/sec, 85 secs
lola: 7963500 markings, 11358688 edges, 74024 markings/sec, 90 secs
lola: 8169142 markings, 11652957 edges, 41128 markings/sec, 95 secs
lola: 8404503 markings, 11987598 edges, 47072 markings/sec, 100 secs
lola: 8541115 markings, 12182432 edges, 27322 markings/sec, 105 secs
lola: 8725589 markings, 12445384 edges, 36895 markings/sec, 110 secs
lola: 8891450 markings, 12682025 edges, 33172 markings/sec, 115 secs
lola: 9076300 markings, 12945668 edges, 36970 markings/sec, 120 secs
lola: 9236481 markings, 13174173 edges, 32036 markings/sec, 125 secs
lola: 9401324 markings, 13409478 edges, 32969 markings/sec, 130 secs
lola: 9587188 markings, 13674543 edges, 37173 markings/sec, 135 secs
lola: 9749060 markings, 13905524 edges, 32374 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown no no no unknown unknown no no unknown no no no no
lola:
preliminary result: unknown unknown no no no unknown unknown no no unknown no no no no
lola: memory consumption: 3412 KB
lola: time consumption: 2052 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is JoinFreeModules-PT-0200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428400222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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