Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899600033.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CloudReconfiguration-PT-305, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899600033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 4.0K Mar 30 01:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 26 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-305-00
FORMULA_NAME CloudReconfiguration-PT-305-01
FORMULA_NAME CloudReconfiguration-PT-305-02
FORMULA_NAME CloudReconfiguration-PT-305-03
FORMULA_NAME CloudReconfiguration-PT-305-04
FORMULA_NAME CloudReconfiguration-PT-305-05
FORMULA_NAME CloudReconfiguration-PT-305-06
FORMULA_NAME CloudReconfiguration-PT-305-07
FORMULA_NAME CloudReconfiguration-PT-305-08
FORMULA_NAME CloudReconfiguration-PT-305-09
FORMULA_NAME CloudReconfiguration-PT-305-10
FORMULA_NAME CloudReconfiguration-PT-305-11
FORMULA_NAME CloudReconfiguration-PT-305-12
FORMULA_NAME CloudReconfiguration-PT-305-13
FORMULA_NAME CloudReconfiguration-PT-305-14
FORMULA_NAME CloudReconfiguration-PT-305-15

=== Now, execution of the tool begins

BK_START 1591131691592

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 21:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:01:35] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2020-06-02 21:01:35] [INFO ] Transformed 2585 places.
[2020-06-02 21:01:35] [INFO ] Transformed 3095 transitions.
[2020-06-02 21:01:35] [INFO ] Found NUPN structural information;
[2020-06-02 21:01:35] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 181 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 804 resets, run finished after 820 ms. (steps per millisecond=121 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 3095 rows 2585 cols
[2020-06-02 21:01:37] [INFO ] Computed 4 place invariants in 178 ms
[2020-06-02 21:01:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 139 ms returned sat
[2020-06-02 21:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:01:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:01:57] [INFO ] [Real]Absence check using state equation in 18934 ms returned (error "Failed to check-sat")
[2020-06-02 21:01:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 21:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:02:17] [INFO ] [Real]Absence check using state equation in 19367 ms returned (error "Failed to check-sat")
[2020-06-02 21:02:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 21:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:02:37] [INFO ] [Real]Absence check using state equation in 19391 ms returned unknown
[2020-06-02 21:02:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 21:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:02:57] [INFO ] [Real]Absence check using state equation in 19385 ms returned unknown
[2020-06-02 21:02:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 21:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:03:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:03:17] [INFO ] [Real]Absence check using state equation in 19346 ms returned unknown
[2020-06-02 21:03:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 21:03:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:03:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:03:37] [INFO ] [Real]Absence check using state equation in 19401 ms returned (error "Failed to check-sat")
[2020-06-02 21:03:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-02 21:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:03:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:03:57] [INFO ] [Real]Absence check using state equation in 19347 ms returned (error "Failed to check-sat")
[2020-06-02 21:03:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned unsat
[2020-06-02 21:03:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 21:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:04:17] [INFO ] [Real]Absence check using state equation in 19467 ms returned (error "Failed to check-sat")
[2020-06-02 21:04:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 21:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using state equation in 19389 ms returned (error "Failed to check-sat")
[2020-06-02 21:04:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 21:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:04:58] [INFO ] [Real]Absence check using state equation in 19422 ms returned (error "Failed to check-sat")
[2020-06-02 21:04:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 144 ms returned sat
[2020-06-02 21:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:05:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:05:18] [INFO ] [Real]Absence check using state equation in 19311 ms returned unknown
[2020-06-02 21:05:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 21:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:05:38] [INFO ] [Real]Absence check using state equation in 19409 ms returned (error "Failed to check-sat")
[2020-06-02 21:05:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 21:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:05:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:05:58] [INFO ] [Real]Absence check using state equation in 19345 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 21:05:59] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-02 21:05:59] [INFO ] Flatten gal took : 547 ms
FORMULA CloudReconfiguration-PT-305-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 21:05:59] [INFO ] Applying decomposition
[2020-06-02 21:05:59] [INFO ] Flatten gal took : 359 ms
[2020-06-02 21:05:59] [INFO ] Decomposing Gal with order
[2020-06-02 21:05:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 21:06:00] [INFO ] Removed a total of 123 redundant transitions.
[2020-06-02 21:06:00] [INFO ] Flatten gal took : 314 ms
[2020-06-02 21:06:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 39 ms.
[2020-06-02 21:06:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 9 ms.
[2020-06-02 21:06:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 48 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudReconfiguration-PT-305 @ 3570 seconds

FORMULA CloudReconfiguration-PT-305-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-305-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3505
rslt: Output for LTLCardinality @ CloudReconfiguration-PT-305

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 21:06:01 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 6,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p238)) AND ((p2406 <= 0)))) AND ((X ((((p1477 <= 0)) OR ((1 <= p1275)))) AND (((p1477 <= 0)) OR ((1 <= p1275)))) OR (((1 <= p238)) AND ((p2406 <= 0)))))))",
"processed_size": 174,
"rewrites": 64
},
"result":
{
"edges": 96,
"markings": 95,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"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": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((((p746 <= 0)) OR ((1 <= p545)))) AND (((p925 <= 0)) OR ((1 <= p1203)))))",
"processed_size": 82,
"rewrites": 64
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((((1 <= p2161)) AND ((p2351 <= 0))) R (((1 <= p1317)) AND ((p1780 <= 0)))) OR (((1 <= p2161)) AND ((p2351 <= 0)))))",
"processed_size": 120,
"rewrites": 64
},
"result":
{
"edges": 74,
"markings": 74,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p948))) AND X ((((p2053 <= 0)) OR ((1 <= p1366))))))",
"processed_size": 67,
"rewrites": 64
},
"result":
{
"edges": 74,
"markings": 74,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 876
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "F (G ((((1 <= p1987)) AND ((p2176 <= 0)))))",
"processed_size": 43,
"rewrites": 64
},
"result":
{
"edges": 71,
"markings": 70,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 1169
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "F (G ((((p1771 <= 0)) OR ((1 <= p1525)))))",
"processed_size": 43,
"rewrites": 64
},
"result":
{
"edges": 26973,
"markings": 18152,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((((p415 <= 0)) OR ((1 <= p410))))) AND F ((((p415 <= 0)) OR ((1 <= p410)))))))",
"processed_size": 93,
"rewrites": 64
},
"result":
{
"edges": 17673,
"markings": 11304,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"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": 3506
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((p1348 <= 0)) OR ((1 <= p1378)))",
"processed_size": 35,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((p1348 <= 0)) OR ((1 <= p1378)))",
"processed_size": 35,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p1348)) AND ((p1378 <= 0)))))",
"processed_size": 43,
"rewrites": 64
},
"result":
{
"edges": 71,
"markings": 70,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 98676,
"runtime": 65.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) AND ((X(**) AND **) OR **)))) : F(G(**)) : F(G(**)) : X((F(**) AND **)) : (F(G(*)) AND **) : G(F((G(F(**)) AND F(**)))) : X(((* R *) OR *)) : X((F(**) AND X(**)))"
},
"net":
{
"arcs": 6463,
"conflict_clusters": 2448,
"places": 2585,
"places_significant": 2581,
"singleton_clusters": 0,
"transitions": 3095
},
"result":
{
"preliminary_value": "no no no yes no no no no ",
"value": "no no no yes 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: 5680/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2585
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p1275 <= 1)
lola: LP says that atomic proposition is always true: (p1275 <= 1)
lola: LP says that atomic proposition is always true: (p2406 <= 1)
lola: LP says that atomic proposition is always true: (p1525 <= 1)
lola: LP says that atomic proposition is always true: (p2176 <= 1)
lola: LP says that atomic proposition is always true: (p545 <= 1)
lola: LP says that atomic proposition is always true: (p1203 <= 1)
lola: LP says that atomic proposition is always true: (p1378 <= 1)
lola: LP says that atomic proposition is always true: (p1378 <= 1)
lola: LP says that atomic proposition is always true: (p410 <= 1)
lola: LP says that atomic proposition is always true: (p410 <= 1)
lola: LP says that atomic proposition is always true: (p2351 <= 1)
lola: LP says that atomic proposition is always true: (p1780 <= 1)
lola: LP says that atomic proposition is always true: (p2351 <= 1)
lola: LP says that atomic proposition is always true: (p1366 <= 1)
lola: LP says that atomic proposition is always true: (p948 <= 1)
lola: LP says that atomic proposition is always true: (p1366 <= 1)
lola: F (X (G (F (NOT(X (F (NOT(((X ((((p1477 <= 0)) OR ((1 <= p1275)))) AND (((p1477 <= 0)) OR ((1 <= p1275)))) U (((1 <= p238)) AND ((p2406 <= 0)))))))))))) : F (G ((((p1771 <= 0)) OR ((1 <= p1525))))) : NOT(G (F (NOT(G (NOT(G (NOT(X (G ((((1 <= p1987)) AND ((p2176 <= 0))))))))))))) : X ((NOT(G (NOT(F ((((p746 <= 0)) OR ((1 <= p545))))))) AND (((p925 <= 0)) OR ((1 <= p1203))))) : (X (X (F (X (NOT(F ((((p1348 <= 0)) OR ((1 <= p1378))))))))) AND ((1 <= 0) U (((p1348 <= 0)) OR ((1 <= p1378))))) : G (F ((((1 <= 0) U G (F ((((p415 <= 0)) OR ((1 <= p410)))))) AND F ((((p415 <= 0)) OR ((1 <= p410))))))) : (NOT(X (((((p2161 <= 0)) OR ((1 <= p2351))) U (((p1317 <= 0)) OR ((1 <= p1780)))))) OR NOT(X ((((p2161 <= 0)) OR ((1 <= p2351)))))) : (F (X ((X (X ((((p2053 <= 0)) OR ((1 <= p1366))))) U F (((1 <= p948)))))) AND X (X ((((p2053 <= 0)) OR ((1 <= p1366))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p238)) AND ((p2406 <= 0)))) AND ((X ((((p1477 <= 0)) OR ((1 <= p1275)))) AND (((p1477 <= 0)) OR ((1 <= p1275)))) OR (((1 <= p238)) AND ((p2406 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p238)) AND ((p2406 <= 0)))) AND ((X ((((p1477 <= 0)) OR ((1 <= p1275)))) AND (((p1477 <= 0)) OR ((1 <= p1275)))) OR (((1 <= p238)) AND ((p2406 <= 0)))))))
lola: processed formula length: 174
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 95 markings, 96 edges
lola: ========================================
lola: subprocess 1 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p746 <= 0)) OR ((1 <= p545)))) AND (((p925 <= 0)) OR ((1 <= p1203)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p746 <= 0)) OR ((1 <= p545)))) AND (((p925 <= 0)) OR ((1 <= p1203)))))
lola: processed formula length: 82
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((1 <= p2161)) AND ((p2351 <= 0))) R (((1 <= p1317)) AND ((p1780 <= 0)))) OR (((1 <= p2161)) AND ((p2351 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((1 <= p2161)) AND ((p2351 <= 0))) R (((1 <= p1317)) AND ((p1780 <= 0)))) OR (((1 <= p2161)) AND ((p2351 <= 0)))))
lola: processed formula length: 120
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 74 markings, 74 edges
lola: ========================================
lola: subprocess 3 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p948))) AND X ((((p2053 <= 0)) OR ((1 <= p1366))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p948))) AND X ((((p2053 <= 0)) OR ((1 <= p1366))))))
lola: processed formula length: 67
lola: 64 rewrites
lola: closed formula file LTLCardinality.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: 74 markings, 74 edges
lola: ========================================
lola: subprocess 4 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p1987)) AND ((p2176 <= 0)))))
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 ((((1 <= p1987)) AND ((p2176 <= 0)))))
lola: processed formula length: 43
lola: 64 rewrites
lola: closed formula file LTLCardinality.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: 70 markings, 71 edges
lola: ========================================
lola: subprocess 5 will run for 1169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p1771 <= 0)) OR ((1 <= p1525)))))
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 ((((p1771 <= 0)) OR ((1 <= p1525)))))
lola: processed formula length: 43
lola: 64 rewrites
lola: closed formula file LTLCardinality.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: add low 192
lola: add low 1900
lola: add low 2192
lola: add low 193
lola: add low 77
lola: add low 935
lola: add low 936
lola: add low 937
lola: add low 938
lola: add low 939
lola: add low 940
lola: add low 941
lola: add low 942
lola: add low 587
lola: add low 588
lola: add low 589
lola: add low 590
lola: add low 591
lola: add low 592
lola: add low 593
lola: add low 594
lola: add low 1821
lola: add low 1822
lola: add low 320
lola: add low 55
lola: add low 56
lola: add low 57
lola: add low 1823
lola: add low 1824
lola: add low 1835
lola: add low 587
lola: add low 588
lola: add low 589
lola: add low 590
lola: add low 591
lola: add low 592
lola: add low 593
lola: add low 594
lola: add low 58
lola: add low 59
lola: add low 60
lola: add low 61
lola: add low 62
lola: add low 183
lola: add low 184
lola: add low 185
lola: add low 186
lola: add low 187
lola: add low 188
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: 18152 markings, 26973 edges
lola: ========================================
lola: subprocess 6 will run for 1753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((((p415 <= 0)) OR ((1 <= p410))))) AND F ((((p415 <= 0)) OR ((1 <= p410)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((((p415 <= 0)) OR ((1 <= p410))))) AND F ((((p415 <= 0)) OR ((1 <= p410)))))))
lola: processed formula length: 93
lola: 64 rewrites
lola: closed formula file LTLCardinality.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: 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: 11304 markings, 17673 edges
lola: subprocess 7 will run for 3506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((1 <= p1348)) AND ((p1378 <= 0))))) AND (((p1348 <= 0)) OR ((1 <= p1378))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 7 will run for 3506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1348 <= 0)) OR ((1 <= p1378)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1348 <= 0)) OR ((1 <= p1378)))
lola: processed formula length: 35
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((((1 <= p1348)) AND ((p1378 <= 0))))) AND (((p1348 <= 0)) OR ((1 <= p1378))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p1348 <= 0)) OR ((1 <= p1378)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1348 <= 0)) OR ((1 <= p1378)))
lola: processed formula length: 35
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p1348)) AND ((p1378 <= 0)))))
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 ((((1 <= p1348)) AND ((p1378 <= 0)))))
lola: processed formula length: 43
lola: 64 rewrites
lola: closed formula file LTLCardinality.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: 70 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no
lola:
preliminary result: no no no yes no no no no
lola: memory consumption: 98676 KB
lola: time consumption: 65 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="CloudReconfiguration-PT-305"
export BK_EXAMINATION="LTLCardinality"
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 CloudReconfiguration-PT-305, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899600033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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