fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334800265
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for CloudReconfiguration-PT-308

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4361.712 3600000.00 622409.00 87.30 FFFTFFTFFTFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334800265.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudReconfiguration-PT-308, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334800265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 660K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620904327192

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 11:12:08] [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]
[2021-05-13 11:12:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:12:09] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2021-05-13 11:12:09] [INFO ] Transformed 2585 places.
[2021-05-13 11:12:09] [INFO ] Transformed 3095 transitions.
[2021-05-13 11:12:09] [INFO ] Found NUPN structural information;
[2021-05-13 11:12:09] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 120 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 716 resets, run finished after 415 ms. (steps per millisecond=240 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0]
// Phase 1: matrix 3095 rows 2585 cols
[2021-05-13 11:12:09] [INFO ] Computed 4 place invariants in 57 ms
[2021-05-13 11:12:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2021-05-13 11:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using state equation in 11904 ms returned sat
[2021-05-13 11:12:22] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 161 ms.
[2021-05-13 11:12:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:12:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19802 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2021-05-13 11:12:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 11:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:55] [INFO ] [Real]Absence check using state equation in 12040 ms returned sat
[2021-05-13 11:12:55] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 105 ms.
[2021-05-13 11:12:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:13:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:13:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19807 ms returned unknown
[2021-05-13 11:13:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 11:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:13:28] [INFO ] [Real]Absence check using state equation in 11922 ms returned sat
[2021-05-13 11:13:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:13:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:13:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19800 ms returned unknown
[2021-05-13 11:13:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 11:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:02] [INFO ] [Real]Absence check using state equation in 12752 ms returned sat
[2021-05-13 11:14:02] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 117 ms.
[2021-05-13 11:14:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:14:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:14:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19806 ms returned unknown
[2021-05-13 11:14:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 11:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using state equation in 11833 ms returned sat
[2021-05-13 11:14:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:14:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:14:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19804 ms returned unknown
[2021-05-13 11:14:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 11:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:08] [INFO ] [Real]Absence check using state equation in 12743 ms returned sat
[2021-05-13 11:15:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:15:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:15:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19811 ms returned unknown
[2021-05-13 11:15:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 11:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:41] [INFO ] [Real]Absence check using state equation in 13110 ms returned sat
[2021-05-13 11:15:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:16:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:16:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19805 ms returned unknown
[2021-05-13 11:16:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 11:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:16:14] [INFO ] [Real]Absence check using state equation in 12962 ms returned sat
[2021-05-13 11:16:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:16:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:16:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19777 ms returned unknown
[2021-05-13 11:16:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 11:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:16:46] [INFO ] [Real]Absence check using state equation in 11720 ms returned sat
[2021-05-13 11:16:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:17:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:17:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19801 ms returned unknown
[2021-05-13 11:17:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 11:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:17:18] [INFO ] [Real]Absence check using state equation in 11299 ms returned sat
[2021-05-13 11:17:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:17:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:17:38] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19797 ms returned unknown
[2021-05-13 11:17:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 11:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:17:49] [INFO ] [Real]Absence check using state equation in 11020 ms returned sat
[2021-05-13 11:17:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:18:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:18:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19802 ms returned unknown
[2021-05-13 11:18:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 11:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:22] [INFO ] [Real]Absence check using state equation in 11822 ms returned sat
[2021-05-13 11:18:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:18:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:18:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19810 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 11
[2021-05-13 11:18:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 11:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:53] [INFO ] [Real]Absence check using state equation in 11176 ms returned sat
[2021-05-13 11:18:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:19:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19808 ms returned unknown
[2021-05-13 11:19:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 11:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:25] [INFO ] [Real]Absence check using state equation in 11270 ms returned sat
[2021-05-13 11:19:25] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 95 ms.
[2021-05-13 11:19:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:19:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19806 ms returned unknown
[2021-05-13 11:19:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-13 11:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:59] [INFO ] [Real]Absence check using state equation in 12718 ms returned sat
[2021-05-13 11:19:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:20:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:20:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19796 ms returned unknown
[2021-05-13 11:20:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 11:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:30] [INFO ] [Real]Absence check using state equation in 11165 ms returned sat
[2021-05-13 11:20:30] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 113 ms.
[2021-05-13 11:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:20:51] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:20:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19800 ms returned unknown
[2021-05-13 11:20:51] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 11:20:51] [INFO ] Flatten gal took : 246 ms
FORMULA CloudReconfiguration-PT-308-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:20:51] [INFO ] Applying decomposition
[2021-05-13 11:20:52] [INFO ] Flatten gal took : 100 ms
[2021-05-13 11:20:52] [INFO ] Decomposing Gal with order
[2021-05-13 11:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:20:52] [INFO ] Removed a total of 123 redundant transitions.
[2021-05-13 11:20:52] [INFO ] Flatten gal took : 208 ms
[2021-05-13 11:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 20 ms.
[2021-05-13 11:20:52] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-13 11:20:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudReconfiguration-PT-308 @ 3570 seconds

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

FORMULA CloudReconfiguration-PT-308-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CloudReconfiguration-PT-308-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA CloudReconfiguration-PT-308-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3493
rslt: Output for LTLCardinality @ CloudReconfiguration-PT-308

{
"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": "Thu May 13 11:20:52 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "X (TRUE)",
"processed_size": 8,
"rewrites": 52
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 3,
"aconj": 18,
"adisj": 9,
"aneg": 9,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X ((((((1 <= p883)) AND ((p1969 <= 0))) R (((1 <= p1957)) AND ((p1626 <= 0)))) R ((((1 <= p883)) AND ((p1969 <= 0))) AND (F ((((1 <= p1957)) AND ((p1626 <= 0)))) OR G ((((1 <= p883)) AND ((p1969 <= 0)))))))) AND (F ((((1 <= p1467)) AND ((p1926 <= 0)))) OR X (G (((((1 <= p883)) AND ((p1969 <= 0))) AND (F ((((1 <= p1957)) AND ((p1626 <= 0)))) OR G ((((1 <= p883)) AND ((p1969 <= 0)))))))))))",
"processed_size": 395,
"rewrites": 52
},
"result":
{
"edges": 109,
"markings": 109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "X (TRUE)",
"processed_size": 8,
"rewrites": 52
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 882
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p1112 <= 0))",
"processed_size": 14,
"rewrites": 54
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1177
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (G ((((p849 <= 0)) OR ((1 <= p18))))) OR (((p864 <= 0)) OR ((1 <= p25))))))",
"processed_size": 85,
"rewrites": 52
},
"result":
{
"edges": 2808236,
"markings": 775990,
"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": 1746
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(F (((1 <= p2235))) U (X (F ((((1 <= p640)) AND ((p1150 <= 0))))) OR F (G (((1 <= p2457))))))",
"processed_size": 93,
"rewrites": 52
},
"result":
{
"edges": 97,
"markings": 97,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3493
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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": "((((1 <= p1509)) AND ((p2156 <= 0))))",
"processed_size": 37,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((((p246 <= 0)) OR ((1 <= p2412))))",
"processed_size": 38,
"rewrites": 52
},
"result":
{
"edges": 1141,
"markings": 815,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 104264,
"runtime": 77.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR (G(**) AND F(**))) : (X((X(F(**)) AND (G(**) AND **))) AND F(**)) : X(TRUE) : X((X(((* R *) R (* AND (F(*) OR G(*))))) AND (F(*) OR X(G((* AND (F(*) OR G(*)))))))) : X(TRUE) : FALSE : X(G((X(G(**)) OR (** OR **)))) : (F(**) U (X(F(**)) OR F(G(**))))"
},
"net":
{
"arcs": 6463,
"conflict_clusters": 2448,
"places": 2585,
"places_significant": 2581,
"singleton_clusters": 0,
"transitions": 3095
},
"result":
{
"preliminary_value": "no no yes no yes no no no ",
"value": "no no yes no yes 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: (p2412 <= 1)
lola: LP says that atomic proposition is always true: (p2156 <= 1)
lola: LP says that atomic proposition is always true: (p672 <= 1)
lola: LP says that atomic proposition is always true: (p2412 <= 1)
lola: LP says that atomic proposition is always true: (p1112 <= 1)
lola: LP says that atomic proposition is always true: (p2463 <= 1)
lola: LP says that atomic proposition is always true: (p2584 <= 1)
lola: LP says that atomic proposition is always true: (p1112 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p1583 <= 1)
lola: LP says that atomic proposition is always true: (p782 <= 1)
lola: LP says that atomic proposition is always true: (p2460 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p1926 <= 1)
lola: LP says that atomic proposition is always true: (p1969 <= 1)
lola: LP says that atomic proposition is always true: (p1626 <= 1)
lola: LP says that atomic proposition is always true: (p1626 <= 1)
lola: LP says that atomic proposition is always true: (p1969 <= 1)
lola: LP says that atomic proposition is always true: (p1367 <= 1)
lola: LP says that atomic proposition is always true: (p1101 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p2035 <= 1)
lola: LP says that atomic proposition is always true: (p2235 <= 1)
lola: LP says that atomic proposition is always true: (p1150 <= 1)
lola: LP says that atomic proposition is always true: (p2457 <= 1)
lola: (G (G ((((p246 <= 0)) OR ((1 <= p2412))))) U ((((1 <= p1509)) AND ((p2156 <= 0))))) : (X (((F (X (((p1112 <= 0)))) AND G (((1 <= p2463)))) AND (((p1547 <= 0)) OR ((1 <= p2584))))) AND F (((1 <= p1112)))) : X (NOT((X (F (((((p580 <= 0)) OR ((1 <= p297))) AND (((p1706 <= 0)) OR ((1 <= p1583)))))) U G (())))) : NOT(X ((G ((((p1467 <= 0)) OR ((1 <= p1926)))) U X ((((((p883 <= 0)) OR ((1 <= p1969))) U (((p1957 <= 0)) OR ((1 <= p1626)))) U (G ((((p1957 <= 0)) OR ((1 <= p1626)))) U (((p883 <= 0)) OR ((1 <= p1969))))))))) : G (X (G (()))) : G (((1 <= 0) U X (G (())))) : X (G (((X (G ((((p849 <= 0)) OR ((1 <= p18))))) OR ((p864 <= 0))) OR ((1 <= p25))))) : (F ((X ((((p1379 <= 0)) OR ((1 <= p2035)))) U ((1 <= p2235)))) U (F (X ((((1 <= p640)) AND ((p1150 <= 0))))) OR X (F (G (((1 <= p2457)))))))
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (TRUE)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (TRUE)
lola: processed formula length: 8
lola: 52 rewrites
lola: closed formula file LTLCardinality.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: 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 2 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((((1 <= p883)) AND ((p1969 <= 0))) R (((1 <= p1957)) AND ((p1626 <= 0)))) R ((((1 <= p883)) AND ((p1969 <= 0))) AND (F ((((1 <= p1957)) AND ((p1626 <= 0)))) OR G ((((1 <= p883)) AND ((p1969 <= 0)))))))) AND (F ((((1 <= p1467)) AND ((p1926 <= 0)))) OR X (G (((((1 <= p883)) AND ((p1969 <= 0))) AND (F ((((1 <= p1957)) AND ((p1626 <= 0)))) OR G ((((1 <= p883)) AND ((p1969 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((((1 <= p883)) AND ((p1969 <= 0))) R (((1 <= p1957)) AND ((p1626 <= 0)))) R ((((1 <= p883)) AND ((p1969 <= 0))) AND (F ((((1 <= p1957)) AND ((p1626 <= 0)))) OR G ((((1 <= p883)) AND ((p1969 <= 0)))))))) AND (F ((((1 <= p1467)) AND ((p1926 <= 0)))) OR X (G (((((1 <= p883)) AND ((p1969 <= 0))) AND (F ((((1 <= p1957)) AND ((p1626 <= 0)))) OR G ((((1 <= p883)) AND ((p1969 <= 0)))))))))))
lola: processed formula length: 395
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 109 markings, 109 edges
lola: ========================================
lola: subprocess 3 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (TRUE)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (TRUE)
lola: processed formula length: 8
lola: 52 rewrites
lola: closed formula file LTLCardinality.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: 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 4 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F (((p1112 <= 0)))) AND (G (((1 <= p2463))) AND (((p1547 <= 0)) OR ((1 <= p2584)))))) AND F (((1 <= p1112))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1112)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1112 <= 0))
lola: processed formula length: 14
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 89 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((((p849 <= 0)) OR ((1 <= p18))))) OR (((p864 <= 0)) OR ((1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((((p849 <= 0)) OR ((1 <= p18))))) OR (((p864 <= 0)) OR ((1 <= p25))))))
lola: processed formula length: 85
lola: 52 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: 117183 markings, 385203 edges, 23437 markings/sec, 0 secs
lola: 239031 markings, 765541 edges, 24370 markings/sec, 5 secs
lola: 349143 markings, 1144685 edges, 22022 markings/sec, 10 secs
lola: 437933 markings, 1524860 edges, 17758 markings/sec, 15 secs
lola: 535197 markings, 1907018 edges, 19453 markings/sec, 20 secs
lola: 617915 markings, 2287071 edges, 16544 markings/sec, 25 secs
lola: 716925 markings, 2651038 edges, 19802 markings/sec, 30 secs
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: 775990 markings, 2808236 edges
lola: subprocess 6 will run for 1746 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p2235))) U (X (F ((((1 <= p640)) AND ((p1150 <= 0))))) OR F (G (((1 <= p2457))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: (F (((1 <= p2235))) U (X (F ((((1 <= p640)) AND ((p1150 <= 0))))) OR F (G (((1 <= p2457))))))
lola: processed formula length: 93
lola: 52 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: 97 markings, 97 edges
lola: ========================================
lola: subprocess 7 will run for 3493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p1509)) AND ((p2156 <= 0)))) OR (G ((((p246 <= 0)) OR ((1 <= p2412)))) AND F (((((1 <= p1509)) AND ((p2156 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p1509)) AND ((p2156 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p1509)) AND ((p2156 <= 0))))
lola: processed formula length: 37
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p246 <= 0)) OR ((1 <= p2412))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p246 <= 0)) OR ((1 <= p2412))))
lola: processed formula length: 38
lola: 52 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: 815 markings, 1141 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no
lola:
preliminary result: no no yes no yes no no no
lola: memory consumption: 104264 KB
lola: time consumption: 77 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-308"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is CloudReconfiguration-PT-308, 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 r056-oct2-162038334800265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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