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-158987899800146.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-319, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:14 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.4K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 3.1K Mar 27 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:14 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 661K 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-319-00
FORMULA_NAME CloudReconfiguration-PT-319-01
FORMULA_NAME CloudReconfiguration-PT-319-02
FORMULA_NAME CloudReconfiguration-PT-319-03
FORMULA_NAME CloudReconfiguration-PT-319-04
FORMULA_NAME CloudReconfiguration-PT-319-05
FORMULA_NAME CloudReconfiguration-PT-319-06
FORMULA_NAME CloudReconfiguration-PT-319-07
FORMULA_NAME CloudReconfiguration-PT-319-08
FORMULA_NAME CloudReconfiguration-PT-319-09
FORMULA_NAME CloudReconfiguration-PT-319-10
FORMULA_NAME CloudReconfiguration-PT-319-11
FORMULA_NAME CloudReconfiguration-PT-319-12
FORMULA_NAME CloudReconfiguration-PT-319-13
FORMULA_NAME CloudReconfiguration-PT-319-14
FORMULA_NAME CloudReconfiguration-PT-319-15

=== Now, execution of the tool begins

BK_START 1591155891987

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:44:55] [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]
[2020-06-03 03:44:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:44:55] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2020-06-03 03:44:55] [INFO ] Transformed 2587 places.
[2020-06-03 03:44:55] [INFO ] Transformed 3099 transitions.
[2020-06-03 03:44:55] [INFO ] Found NUPN structural information;
[2020-06-03 03:44:55] [INFO ] Parsed PT model containing 2587 places and 3099 transitions in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 159 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1231 resets, run finished after 731 ms. (steps per millisecond=136 ) properties seen :[0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0]
// Phase 1: matrix 3099 rows 2587 cols
[2020-06-03 03:44:56] [INFO ] Computed 4 place invariants in 165 ms
[2020-06-03 03:44:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 136 ms returned sat
[2020-06-03 03:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:45:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:45:16] [INFO ] [Real]Absence check using state equation in 19181 ms returned (error "Failed to check-sat")
[2020-06-03 03:45:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-03 03:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:45:36] [INFO ] [Real]Absence check using state equation in 19489 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 03:45:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:45:56] [INFO ] [Real]Absence check using state equation in 19481 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 03:45:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-03 03:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:46:16] [INFO ] [Real]Absence check using state equation in 19388 ms returned unknown
[2020-06-03 03:46:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:46:36] [INFO ] [Real]Absence check using state equation in 19364 ms returned (error "Failed to check-sat")
[2020-06-03 03:46:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:46:56] [INFO ] [Real]Absence check using state equation in 19380 ms returned (error "Failed to check-sat")
[2020-06-03 03:46:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-03 03:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:47:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:47:16] [INFO ] [Real]Absence check using state equation in 19362 ms returned unknown
[2020-06-03 03:47:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:47:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:47:37] [INFO ] [Real]Absence check using state equation in 19401 ms returned (error "Failed to check-sat")
[2020-06-03 03:47:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:47:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:47:57] [INFO ] [Real]Absence check using state equation in 19403 ms returned (error "Failed to check-sat")
[2020-06-03 03:47:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:48:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:48:17] [INFO ] [Real]Absence check using state equation in 19408 ms returned (error "Failed to check-sat")
[2020-06-03 03:48:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:48:37] [INFO ] [Real]Absence check using state equation in 19389 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 03:48:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:48:57] [INFO ] [Real]Absence check using state equation in 19400 ms returned (error "Failed to check-sat")
[2020-06-03 03:48:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 154 ms returned sat
[2020-06-03 03:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:49:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:49:17] [INFO ] [Real]Absence check using state equation in 19351 ms returned (error "Failed to check-sat")
[2020-06-03 03:49:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-03 03:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:49:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:49:37] [INFO ] [Real]Absence check using state equation in 19429 ms returned (error "Failed to check-sat")
[2020-06-03 03:49:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:49:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:49:57] [INFO ] [Real]Absence check using state equation in 19391 ms returned unknown
[2020-06-03 03:49:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:50:17] [INFO ] [Real]Absence check using state equation in 19414 ms returned (error "Failed to check-sat")
[2020-06-03 03:50:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:37] [INFO ] [Real]Absence check using state equation in 19443 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 03:50:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:50:57] [INFO ] [Real]Absence check using state equation in 19438 ms returned (error "Failed to check-sat")
[2020-06-03 03:50:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-03 03:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:51:17] [INFO ] [Real]Absence check using state equation in 19393 ms returned (error "Failed to check-sat")
[2020-06-03 03:51:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-06-03 03:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:51:37] [INFO ] [Real]Absence check using state equation in 19397 ms returned unknown
[2020-06-03 03:51:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:51:42] [INFO ] [Real]Absence check using state equation in 4137 ms returned unsat
[2020-06-03 03:51:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:02] [INFO ] [Real]Absence check using state equation in 19405 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 03:52:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-06-03 03:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:52:22] [INFO ] [Real]Absence check using state equation in 19424 ms returned unknown
[2020-06-03 03:52:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 176 ms returned sat
[2020-06-03 03:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:52:42] [INFO ] [Real]Absence check using state equation in 19365 ms returned (error "Failed to check-sat")
[2020-06-03 03:52:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:53:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:53:02] [INFO ] [Real]Absence check using state equation in 19414 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 03:53:02] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 03:53:03] [INFO ] Flatten gal took : 445 ms
FORMULA CloudReconfiguration-PT-319-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:53:03] [INFO ] Applying decomposition
[2020-06-03 03:53:03] [INFO ] Flatten gal took : 228 ms
[2020-06-03 03:53:03] [INFO ] Decomposing Gal with order
[2020-06-03 03:53:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 03:53:04] [INFO ] Removed a total of 129 redundant transitions.
[2020-06-03 03:53:04] [INFO ] Flatten gal took : 354 ms
[2020-06-03 03:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 35 ms.
[2020-06-03 03:53:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-03 03:53:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 48 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudReconfiguration-PT-319 @ 3570 seconds

FORMULA CloudReconfiguration-PT-319-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-319-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-319-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA CloudReconfiguration-PT-319-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-319-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA CloudReconfiguration-PT-319-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3477
rslt: Output for LTLFireability @ CloudReconfiguration-PT-319

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:53:04 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"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": "X (X (G (((1 <= p661)))))",
"processed_size": 25,
"rewrites": 55
},
"result":
{
"edges": 54,
"markings": 54,
"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": 348
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 4,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((X (((1 <= p1486))) OR (G (((1 <= p47))) AND X (F (((1 <= p1486)))))) U (((1 <= p1486) AND (1 <= p47)) U X (((p888 <= 0))))))",
"processed_size": 129,
"rewrites": 55
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 18
},
"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": 387
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"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 ((X (((p2245 <= 0))) AND F (G (((1 <= p572)))))))",
"processed_size": 54,
"rewrites": 55
},
"result":
{
"edges": 56,
"markings": 55,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 435
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (((1 <= p1549)))",
"processed_size": 18,
"rewrites": 55
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 498
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 3,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p2180))) U (((((1 <= p1381)) U ((1 <= p335))) U G (((1 <= p335)))) OR F (((1 <= p2180))))))",
"processed_size": 105,
"rewrites": 55
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 4,
"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": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"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": "X (X (G (((1 <= p827)))))",
"processed_size": 25,
"rewrites": 55
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"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": 697
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 4,
"X": 4,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((X (((p192 <= 0))) U (((1 <= p192)) U (X (((1 <= p980))) U ((1 <= p980))))) U X (F (((1 <= p192))))))",
"processed_size": 105,
"rewrites": 55
},
"result":
{
"edges": 107,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 871
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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 (F ((F (((p2381 <= 0))) OR ((p868 <= 0)))))",
"processed_size": 45,
"rewrites": 55
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1162
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((((1 <= p1272)) AND (X (((1 <= p543))) OR ((1 <= p1435)))))",
"processed_size": 62,
"rewrites": 55
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1743
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((1 <= p778))))",
"processed_size": 21,
"rewrites": 55
},
"result":
{
"edges": 56,
"markings": 55,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3487
},
"exit":
{
"localtimelimitreached": false
},
"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 ((((p1441 <= 0)) AND ((p1076 <= 0)))))",
"processed_size": 43,
"rewrites": 55
},
"result":
{
"edges": 279387,
"markings": 196446,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 95676,
"runtime": 92.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(**))) : X(((X(**) OR (G(**) AND X(F(**)))) U (** U X(**)))) : G(F((X(*) AND F(G(**))))) : (G((F((G(*) R *)) AND F(**))) AND X(**)) : F(G(**)) : X((X(**) U (((** U **) U G(**)) OR F(**)))) : X(X(G(**))) : X(((X(**) U (** U (X(**) U **))) U X(F(**)))) : X(F((F(*) OR *))) : F(G(*)) : F((** AND (X(**) OR **)))"
},
"net":
{
"arcs": 6479,
"conflict_clusters": 2448,
"places": 2587,
"places_significant": 2583,
"singleton_clusters": 0,
"transitions": 3099
},
"result":
{
"preliminary_value": "no yes no no no no no no yes no no ",
"value": "no yes no no no no no no yes 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: 5686/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2587
lola: finding significant places
lola: 2587 places, 3099 transitions, 2583 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: LP says that atomic proposition is always true: (p661 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p1486 <= 1)
lola: LP says that atomic proposition is always true: (p1486 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p888 <= 1)
lola: LP says that atomic proposition is always true: (p2245 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p745 <= 1)
lola: LP says that atomic proposition is always true: (p1571 <= 1)
lola: LP says that atomic proposition is always true: (p1571 <= 1)
lola: LP says that atomic proposition is always true: (p1549 <= 1)
lola: LP says that atomic proposition is always true: (p778 <= 1)
lola: LP says that atomic proposition is always true: (p2180 <= 1)
lola: LP says that atomic proposition is always true: (p1381 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p2180 <= 1)
lola: LP says that atomic proposition is always true: (p827 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p980 <= 1)
lola: LP says that atomic proposition is always true: (p980 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p2381 <= 1)
lola: LP says that atomic proposition is always true: (p868 <= 1)
lola: LP says that atomic proposition is always true: (p1441 <= 1)
lola: LP says that atomic proposition is always true: (p1076 <= 1)
lola: LP says that atomic proposition is always true: (p1272 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p1435 <= 1)
lola: G (X (X (G (((1 <= p661)))))) : (X ((G (((1 <= p47))) U X (((1 <= p1486))))) U X ((((1 <= p1486) AND (1 <= p47)) U X (((p888 <= 0)))))) : NOT(X (F (X (X (G (NOT(X ((NOT(X (((1 <= p2245)))) AND F (G (((1 <= p572))))))))))))) : (G ((F (NOT((F (((1 <= p745))) U ((1 <= p1571))))) AND F (((1 <= p1571))))) AND X (((1 <= p1549)))) : F (X (X (G (((1 <= p778)))))) : X ((X (((1 <= p2180))) U (((((1 <= p1381)) U ((1 <= p335))) U G (((1 <= p335)))) OR F (((1 <= p2180)))))) : X (G (X (((1 <= p827))))) : X (((X (((p192 <= 0))) U (((1 <= p192)) U (X (((1 <= p980))) U ((1 <= p980))))) U X (F (((1 <= p192)))))) : F (NOT(G (X ((G (((1 <= p2381))) AND ((1 <= p868))))))) : F (G (NOT(F (G (F ((((1 <= p1441)) OR ((1 <= p1076))))))))) : F ((((1 <= p1272)) AND (X (((1 <= p543))) OR ((1 <= p1435)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p661)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p661)))))
lola: processed formula length: 25
lola: 55 rewrites
lola: closed formula file LTLFireability.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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 1 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((1 <= p1486))) OR (G (((1 <= p47))) AND X (F (((1 <= p1486)))))) U (((1 <= p1486) AND (1 <= p47)) U X (((p888 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((1 <= p1486))) OR (G (((1 <= p47))) AND X (F (((1 <= p1486)))))) U (((1 <= p1486) AND (1 <= p47)) U X (((p888 <= 0))))))
lola: processed formula length: 129
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((p2245 <= 0))) AND F (G (((1 <= p572)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p2245 <= 0))) AND F (G (((1 <= p572)))))))
lola: processed formula length: 54
lola: 55 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: 55 markings, 56 edges
lola: ========================================
lola: subprocess 3 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((G (((p745 <= 0))) R ((p1571 <= 0)))) AND F (((1 <= p1571))))) AND X (((1 <= p1549))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p1549)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p1549)))
lola: processed formula length: 18
lola: 55 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: 54 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p2180))) U (((((1 <= p1381)) U ((1 <= p335))) U G (((1 <= p335)))) OR F (((1 <= p2180))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p2180))) U (((((1 <= p1381)) U ((1 <= p335))) U G (((1 <= p335)))) OR F (((1 <= p2180))))))
lola: processed formula length: 105
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 5 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p827)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p827)))))
lola: processed formula length: 25
lola: 55 rewrites
lola: closed formula file LTLFireability.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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 6 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((p192 <= 0))) U (((1 <= p192)) U (X (((1 <= p980))) U ((1 <= p980))))) U X (F (((1 <= p192))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((p192 <= 0))) U (((1 <= p192)) U (X (((1 <= p980))) U ((1 <= p980))))) U X (F (((1 <= p192))))))
lola: processed formula length: 105
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 106 markings, 107 edges
lola: ========================================
lola: subprocess 7 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((p2381 <= 0))) OR ((p868 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((p2381 <= 0))) OR ((p868 <= 0)))))
lola: processed formula length: 45
lola: 55 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 1162 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p1272)) AND (X (((1 <= p543))) OR ((1 <= p1435)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p1272)) AND (X (((1 <= p543))) OR ((1 <= p1435)))))
lola: processed formula length: 62
lola: 55 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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 9 will run for 1743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p778))))
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 <= p778))))
lola: processed formula length: 21
lola: 55 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: 55 markings, 56 edges
lola: ========================================
lola: subprocess 10 will run for 3487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p1441 <= 0)) AND ((p1076 <= 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 ((((p1441 <= 0)) AND ((p1076 <= 0)))))
lola: processed formula length: 43
lola: 55 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: 97659 markings, 154532 edges, 19532 markings/sec, 0 secs
lola: add low 1191
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: 196446 markings, 279387 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no yes no no
lola:
preliminary result: no yes no no no no no no yes no no
lola: memory consumption: 95676 KB
lola: time consumption: 92 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="CloudReconfiguration-PT-319"
export BK_EXAMINATION="LTLFireability"
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-319, 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 r180-ebro-158987899800146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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