Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 41K 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 Raft-PT-04-00
FORMULA_NAME Raft-PT-04-01
FORMULA_NAME Raft-PT-04-02
FORMULA_NAME Raft-PT-04-03
FORMULA_NAME Raft-PT-04-04
FORMULA_NAME Raft-PT-04-05
FORMULA_NAME Raft-PT-04-06
FORMULA_NAME Raft-PT-04-07
FORMULA_NAME Raft-PT-04-08
FORMULA_NAME Raft-PT-04-09
FORMULA_NAME Raft-PT-04-10
FORMULA_NAME Raft-PT-04-11
FORMULA_NAME Raft-PT-04-12
FORMULA_NAME Raft-PT-04-13
FORMULA_NAME Raft-PT-04-14
FORMULA_NAME Raft-PT-04-15

=== Now, execution of the tool begins

BK_START 1621423450604

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 11:24:12] [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-19 11:24:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:24:12] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-19 11:24:12] [INFO ] Transformed 88 places.
[2021-05-19 11:24:12] [INFO ] Transformed 160 transitions.
[2021-05-19 11:24:12] [INFO ] Found NUPN structural information;
[2021-05-19 11:24:12] [INFO ] Parsed PT model containing 88 places and 160 transitions in 84 ms.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 243 ms. (steps per millisecond=411 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
[2021-05-19 11:24:12] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
// Phase 1: matrix 126 rows 88 cols
[2021-05-19 11:24:12] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-19 11:24:12] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2021-05-19 11:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-19 11:24:12] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-19 11:24:12] [INFO ] [Real]Added 64 Read/Feed constraints in 8 ms returned sat
[2021-05-19 11:24:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:24:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2021-05-19 11:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-19 11:24:12] [INFO ] [Nat]Added 64 Read/Feed constraints in 6 ms returned sat
[2021-05-19 11:24:12] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 11 ms.
[2021-05-19 11:24:13] [INFO ] Added : 118 causal constraints over 24 iterations in 345 ms. Result :sat
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-19 11:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-19 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:24:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned unsat
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2021-05-19 11:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-19 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:24:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned unsat
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2021-05-19 11:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-19 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:24:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned unsat
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2021-05-19 11:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:13] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-19 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:24:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2021-05-19 11:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:13] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-19 11:24:13] [INFO ] [Nat]Added 64 Read/Feed constraints in 9 ms returned sat
[2021-05-19 11:24:13] [INFO ] Computed and/alt/rep : 141/943/125 causal constraints in 12 ms.
[2021-05-19 11:24:14] [INFO ] Added : 123 causal constraints over 25 iterations in 336 ms. Result :sat
[2021-05-19 11:24:14] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2021-05-19 11:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:24:14] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-19 11:24:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:24:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-19 11:24:14] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-19 11:24:14] [INFO ] Flatten gal took : 38 ms
FORMULA Raft-PT-04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 11:24:14] [INFO ] Applying decomposition
[2021-05-19 11:24:14] [INFO ] Flatten gal took : 13 ms
[2021-05-19 11:24:14] [INFO ] Decomposing Gal with order
[2021-05-19 11:24:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 11:24:14] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-19 11:24:14] [INFO ] Flatten gal took : 40 ms
[2021-05-19 11:24:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 5 ms.
[2021-05-19 11:24:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 11:24:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Raft-PT-04 @ 3570 seconds

FORMULA Raft-PT-04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-04-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2683
rslt: Output for LTLCardinality @ Raft-PT-04

{
"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": "Wed May 19 11:24:14 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 4,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (G (((F ((((p75 <= 0)) OR ((1 <= p37)))) AND (((p75 <= 0)) OR ((1 <= p37)))) OR (((1 <= p23)) AND ((p49 <= 0)))))))",
"processed_size": 122,
"rewrites": 45
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 12,
"adisj": 5,
"aneg": 5,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G ((((((1 <= p57)) AND ((p29 <= 0))) R (((1 <= p77)) AND ((p80 <= 0)))) AND (X ((((1 <= p36)) AND ((p38 <= 0)))) OR ((((1 <= p57)) AND ((p29 <= 0)) AND ((1 <= p72)) AND ((p80 <= 0))) OR (((1 <= p77)) AND ((p80 <= 0))))))))",
"processed_size": 225,
"rewrites": 45
},
"result":
{
"edges": 5,
"markings": 5,
"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": 452
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((((p54 <= 0)) OR ((1 <= p24)))))",
"processed_size": 39,
"rewrites": 45
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 528
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((1 <= p31)) AND ((p0 <= 0)))",
"processed_size": 30,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((((p82 <= 0)) OR ((1 <= p27)))))",
"processed_size": 39,
"rewrites": 45
},
"result":
{
"edges": 57,
"markings": 52,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (((p33 <= 0))) AND (((p36 <= 0)) OR ((1 <= p71)))))",
"processed_size": 58,
"rewrites": 45
},
"result":
{
"edges": 47,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 792
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((p32 <= 0)) OR ((1 <= p75)))))",
"processed_size": 39,
"rewrites": 45
},
"result":
{
"edges": 158699,
"markings": 77049,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1056
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (F ((((1 <= p65)) AND ((p1 <= 0))))) AND (((p65 <= 0)) OR ((1 <= p1)))))",
"processed_size": 79,
"rewrites": 45
},
"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": 1585
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p4 <= 0)) OR ((1 <= p1)))))",
"processed_size": 37,
"rewrites": 45
},
"result":
{
"edges": 55,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3170
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G ((((p38 <= 0)) OR ((1 <= p54))))) AND F ((((p59 <= 0)) OR ((1 <= p42))))))",
"processed_size": 85,
"rewrites": 45
},
"result":
{
"edges": 1996680,
"markings": 823230,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3472,
"runtime": 887.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(((F(**) AND **) OR **)))) : G(F(((** U **) AND X(G(**))))) : X(G(((* R *) AND (X(*) OR (* OR *))))) : X(F(**)) : (X(X(**)) AND F(**)) : F((F(G(**)) AND F(**))) : G((X(**) AND **)) : X(G(**)) : F((X(F(**)) AND **)) : G(F(**))"
},
"net":
{
"arcs": 527,
"conflict_clusters": 13,
"places": 88,
"places_significant": 72,
"singleton_clusters": 0,
"transitions": 142
},
"result":
{
"preliminary_value": "no unknown no yes yes no no no yes no ",
"value": "no unknown no yes yes no no no yes 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: 230/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 88
lola: finding significant places
lola: 88 places, 142 transitions, 72 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: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: ((1 <= 0) U G (X ((X ((F ((((p75 <= 0)) OR ((1 <= p37)))) AND (((p75 <= 0)) OR ((1 <= p37))))) OR X ((((1 <= p23)) AND ((p49 <= 0)))))))) : NOT(X (F (G ((NOT(((((p0 <= 0)) OR ((1 <= p11))) U ((1 <= p85)))) OR NOT(X (G ((((1 <= p85)) OR ((p0 <= 0)) OR ((1 <= p11))))))))))) : NOT(F (X ((((((p57 <= 0)) OR ((1 <= p29))) U (((p77 <= 0)) OR ((1 <= p80)))) OR ((X ((((p36 <= 0)) OR ((1 <= p38)))) AND (((p57 <= 0)) OR ((1 <= p29)) OR ((p72 <= 0)) OR ((1 <= p80)))) AND (((p77 <= 0)) OR ((1 <= p80)))))))) : (F ((F ((((p11 <= 0)) OR ((1 <= p56)))) U (0 <= 0))) AND F (X ((((p54 <= 0)) OR ((1 <= p24)))))) : (X (X (((1 <= 0) U (((p82 <= 0)) OR ((1 <= p27)))))) AND F ((((p31 <= 0)) OR ((1 <= p0))))) : F ((F (G ((((p38 <= 0)) OR ((1 <= p54))))) AND F ((((p59 <= 0)) OR ((1 <= p42)))))) : G ((X (((p33 <= 0))) AND (((p36 <= 0)) OR ((1 <= p71))))) : X (G ((((p32 <= 0)) OR ((1 <= p75))))) : F ((F (F (X ((((1 <= p65)) AND ((p1 <= 0)))))) AND (((p65 <= 0)) OR ((1 <= p1))))) : G (F ((((p4 <= 0)) OR ((1 <= p1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((F ((((p75 <= 0)) OR ((1 <= p37)))) AND (((p75 <= 0)) OR ((1 <= p37)))) OR (((1 <= p23)) AND ((p49 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((F ((((p75 <= 0)) OR ((1 <= p37)))) AND (((p75 <= 0)) OR ((1 <= p37)))) OR (((1 <= p23)) AND ((p49 <= 0)))))))
lola: processed formula length: 122
lola: 45 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((((p0 <= 0)) OR ((1 <= p11))) U ((1 <= p85))) AND X (G ((((1 <= p85)) OR ((p0 <= 0)) OR ((1 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((((p0 <= 0)) OR ((1 <= p11))) U ((1 <= p85))) AND X (G ((((1 <= p85)) OR ((p0 <= 0)) OR ((1 <= p11))))))))
lola: processed formula length: 117
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1732508 markings, 3883362 edges, 346502 markings/sec, 0 secs
lola: 3220856 markings, 7355609 edges, 297670 markings/sec, 5 secs
lola: 4567649 markings, 10538503 edges, 269359 markings/sec, 10 secs
lola: 5895654 markings, 13721725 edges, 265601 markings/sec, 15 secs
lola: 6888995 markings, 16114088 edges, 198668 markings/sec, 20 secs
lola: 7886637 markings, 18531679 edges, 199528 markings/sec, 25 secs
lola: 8880196 markings, 20944170 edges, 198712 markings/sec, 30 secs
lola: 9848378 markings, 23315191 edges, 193636 markings/sec, 35 secs
lola: 10799316 markings, 25655974 edges, 190188 markings/sec, 40 secs
lola: 11785201 markings, 28085664 edges, 197177 markings/sec, 45 secs
lola: 12872089 markings, 30774174 edges, 217378 markings/sec, 50 secs
lola: 14035239 markings, 33662234 edges, 232630 markings/sec, 55 secs
lola: 15182739 markings, 36514827 edges, 229500 markings/sec, 60 secs
lola: 16368383 markings, 39470513 edges, 237129 markings/sec, 65 secs
lola: 17557524 markings, 42457858 edges, 237828 markings/sec, 70 secs
lola: 18756068 markings, 45472176 edges, 239709 markings/sec, 75 secs
lola: 19954867 markings, 48488745 edges, 239760 markings/sec, 80 secs
lola: 21146872 markings, 51495633 edges, 238401 markings/sec, 85 secs
lola: 22326017 markings, 54472528 edges, 235829 markings/sec, 90 secs
lola: 23554582 markings, 57575528 edges, 245713 markings/sec, 95 secs
lola: 24780569 markings, 60691653 edges, 245197 markings/sec, 100 secs
lola: 26003574 markings, 63801950 edges, 244601 markings/sec, 105 secs
lola: 27179761 markings, 66794185 edges, 235237 markings/sec, 110 secs
lola: 28391190 markings, 69887867 edges, 242286 markings/sec, 115 secs
lola: 29586344 markings, 72955292 edges, 239031 markings/sec, 120 secs
lola: 30779097 markings, 76011498 edges, 238551 markings/sec, 125 secs
lola: 31970189 markings, 79078800 edges, 238218 markings/sec, 130 secs
lola: 33167055 markings, 82151012 edges, 239373 markings/sec, 135 secs
lola: 34351074 markings, 85198053 edges, 236804 markings/sec, 140 secs
lola: 35526212 markings, 88231275 edges, 235028 markings/sec, 145 secs
lola: 36701098 markings, 91266386 edges, 234977 markings/sec, 150 secs
lola: 37862208 markings, 94281519 edges, 232222 markings/sec, 155 secs
lola: 39030541 markings, 97313204 edges, 233667 markings/sec, 160 secs
lola: 40198797 markings, 100345263 edges, 233651 markings/sec, 165 secs
lola: 41349543 markings, 103339009 edges, 230149 markings/sec, 170 secs
lola: 42502559 markings, 106336916 edges, 230603 markings/sec, 175 secs
lola: 43650756 markings, 109333411 edges, 229639 markings/sec, 180 secs
lola: 44782038 markings, 112290810 edges, 226256 markings/sec, 185 secs
lola: 45808936 markings, 114972944 edges, 205380 markings/sec, 190 secs
lola: 46833136 markings, 117659289 edges, 204840 markings/sec, 195 secs
lola: 47877537 markings, 120391666 edges, 208880 markings/sec, 200 secs
lola: 48849693 markings, 122944281 edges, 194431 markings/sec, 205 secs
lola: 49897208 markings, 125692148 edges, 209503 markings/sec, 210 secs
lola: 50918735 markings, 128379649 edges, 204305 markings/sec, 215 secs
lola: 51935928 markings, 131062047 edges, 203439 markings/sec, 220 secs
lola: 52955253 markings, 133749567 edges, 203865 markings/sec, 225 secs
lola: 53973176 markings, 136433548 edges, 203585 markings/sec, 230 secs
lola: 54972553 markings, 139079297 edges, 199875 markings/sec, 235 secs
lola: 56075273 markings, 142000381 edges, 220544 markings/sec, 240 secs
lola: 57189886 markings, 144947242 edges, 222923 markings/sec, 245 secs
lola: 58287132 markings, 147856461 edges, 219449 markings/sec, 250 secs
lola: 59392322 markings, 150788268 edges, 221038 markings/sec, 255 secs
lola: 60491722 markings, 153707575 edges, 219880 markings/sec, 260 secs
lola: 61601359 markings, 156653791 edges, 221927 markings/sec, 265 secs
lola: 62699839 markings, 159573550 edges, 219696 markings/sec, 270 secs
lola: 63791369 markings, 162467219 edges, 218306 markings/sec, 275 secs
lola: 64877800 markings, 165350429 edges, 217286 markings/sec, 280 secs
lola: 65962245 markings, 168246232 edges, 216889 markings/sec, 285 secs
lola: 67036680 markings, 171108281 edges, 214887 markings/sec, 290 secs
lola: 68080803 markings, 173896362 edges, 208825 markings/sec, 295 secs
lola: 69051030 markings, 176480498 edges, 194045 markings/sec, 300 secs
lola: 70012496 markings, 179052470 edges, 192293 markings/sec, 305 secs
lola: 70985632 markings, 181654190 edges, 194627 markings/sec, 310 secs
lola: 72036318 markings, 184460674 edges, 210137 markings/sec, 315 secs
lola: 73020605 markings, 187099649 edges, 196857 markings/sec, 320 secs
lola: 74001484 markings, 189725898 edges, 196176 markings/sec, 325 secs
lola: 74985972 markings, 192359786 edges, 196898 markings/sec, 330 secs
lola: 75956831 markings, 194963235 edges, 194172 markings/sec, 335 secs
lola: 76916765 markings, 197546029 edges, 191987 markings/sec, 340 secs
lola: 77869156 markings, 200103624 edges, 190478 markings/sec, 345 secs
lola: 78852073 markings, 202747379 edges, 196583 markings/sec, 350 secs
lola: 79896860 markings, 205563931 edges, 208957 markings/sec, 355 secs
lola: 80956285 markings, 208427332 edges, 211885 markings/sec, 360 secs
lola: 82009890 markings, 211263238 edges, 210721 markings/sec, 365 secs
lola: 83051150 markings, 214063855 edges, 208252 markings/sec, 370 secs
lola: 84031265 markings, 216705845 edges, 196023 markings/sec, 375 secs
lola: 85021304 markings, 219377702 edges, 198008 markings/sec, 380 secs
lola: 86050485 markings, 222161605 edges, 205836 markings/sec, 385 secs
lola: 87031559 markings, 224812031 edges, 196215 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((((1 <= p57)) AND ((p29 <= 0))) R (((1 <= p77)) AND ((p80 <= 0)))) AND (X ((((1 <= p36)) AND ((p38 <= 0)))) OR ((((1 <= p57)) AND ((p29 <= 0)) AND ((1 <= p72)) AND ((p80 <= 0))) OR (((1 <= p77)) AND ((p80 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((1 <= p57)) AND ((p29 <= 0))) R (((1 <= p77)) AND ((p80 <= 0)))) AND (X ((((1 <= p36)) AND ((p38 <= 0)))) OR ((((1 <= p57)) AND ((p29 <= 0)) AND ((1 <= p72)) AND ((p80 <= 0))) OR (((1 <= p77)) AND ((p80 <= 0))))))))
lola: processed formula length: 225
lola: 45 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p54 <= 0)) OR ((1 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p54 <= 0)) OR ((1 <= p24)))))
lola: processed formula length: 39
lola: 45 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: 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 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((p82 <= 0)) OR ((1 <= p27))))) AND F ((((p31 <= 0)) OR ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p31 <= 0)) OR ((1 <= p0))))
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: (((1 <= p31)) AND ((p0 <= 0)))
lola: processed formula length: 30
lola: 47 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p82 <= 0)) OR ((1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p82 <= 0)) OR ((1 <= p27)))))
lola: processed formula length: 39
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 52 markings, 57 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p33 <= 0))) AND (((p36 <= 0)) OR ((1 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p33 <= 0))) AND (((p36 <= 0)) OR ((1 <= p71)))))
lola: processed formula length: 58
lola: 45 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 37 markings, 47 edges
lola: ========================================
lola: subprocess 6 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p32 <= 0)) OR ((1 <= p75)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p32 <= 0)) OR ((1 <= p75)))))
lola: processed formula length: 39
lola: 45 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77049 markings, 158699 edges
lola: ========================================
lola: subprocess 7 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((((1 <= p65)) AND ((p1 <= 0))))) AND (((p65 <= 0)) OR ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((((1 <= p65)) AND ((p1 <= 0))))) AND (((p65 <= 0)) OR ((1 <= p1)))))
lola: processed formula length: 79
lola: 45 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: 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 1585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p4 <= 0)) OR ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p4 <= 0)) OR ((1 <= p1)))))
lola: processed formula length: 37
lola: 45 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: 38 markings, 55 edges
lola: ========================================
lola: subprocess 9 will run for 3170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((p38 <= 0)) OR ((1 <= p54))))) AND F ((((p59 <= 0)) OR ((1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((p38 <= 0)) OR ((1 <= p54))))) AND F ((((p59 <= 0)) OR ((1 <= p42))))))
lola: processed formula length: 85
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 109
lola: add low 13
lola: add low 124
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: 823230 markings, 1996680 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((((p0 <= 0)) OR ((1 <= p11))) U ((1 <= p85))) AND X (G ((((1 <= p85)) OR ((p0 <= 0)) OR ((1 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((((p0 <= 0)) OR ((1 <= p11))) U ((1 <= p85))) AND X (G ((((1 <= p85)) OR ((p0 <= 0)) OR ((1 <= p11))))))))
lola: processed formula length: 117
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1824238 markings, 4095067 edges, 364848 markings/sec, 0 secs
lola: 3443483 markings, 7876933 edges, 323849 markings/sec, 5 secs
lola: 4978904 markings, 11522799 edges, 307084 markings/sec, 10 secs
lola: 6466283 markings, 15093543 edges, 297476 markings/sec, 15 secs
lola: 7901202 markings, 18567070 edges, 286984 markings/sec, 20 secs
lola: 9297892 markings, 21967499 edges, 279338 markings/sec, 25 secs
lola: 10650822 markings, 25289542 edges, 270586 markings/sec, 30 secs
lola: 11985885 markings, 28580190 edges, 267013 markings/sec, 35 secs
lola: 13304847 markings, 31848926 edges, 263792 markings/sec, 40 secs
lola: 14613475 markings, 35098356 edges, 261726 markings/sec, 45 secs
lola: 15910875 markings, 38327676 edges, 259480 markings/sec, 50 secs
lola: 17181677 markings, 41514977 edges, 254160 markings/sec, 55 secs
lola: 18447543 markings, 44694039 edges, 253173 markings/sec, 60 secs
lola: 19707357 markings, 47866661 edges, 251963 markings/sec, 65 secs
lola: 20957519 markings, 51019379 edges, 250032 markings/sec, 70 secs
lola: 22200940 markings, 54158200 edges, 248684 markings/sec, 75 secs
lola: 23448991 markings, 57308590 edges, 249610 markings/sec, 80 secs
lola: 24670102 markings, 60412981 edges, 244222 markings/sec, 85 secs
lola: 25900192 markings, 63539647 edges, 246018 markings/sec, 90 secs
lola: 27128970 markings, 66665592 edges, 245756 markings/sec, 95 secs
lola: 28346461 markings, 69772862 edges, 243498 markings/sec, 100 secs
lola: 29545137 markings, 72850185 edges, 239735 markings/sec, 105 secs
lola: 30739849 markings, 75910229 edges, 238942 markings/sec, 110 secs
lola: 31919224 markings, 78946334 edges, 235875 markings/sec, 115 secs
lola: 33107670 markings, 81998088 edges, 237689 markings/sec, 120 secs
lola: 34288235 markings, 85035542 edges, 236113 markings/sec, 125 secs
lola: 35465233 markings, 88074954 edges, 235400 markings/sec, 130 secs
lola: 36643339 markings, 91117147 edges, 235621 markings/sec, 135 secs
lola: 37806714 markings, 94136829 edges, 232675 markings/sec, 140 secs
lola: 38965465 markings, 97143187 edges, 231750 markings/sec, 145 secs
lola: 40123045 markings, 100146704 edges, 231516 markings/sec, 150 secs
lola: 41270573 markings, 103133158 edges, 229506 markings/sec, 155 secs
lola: 42422696 markings, 106129754 edges, 230425 markings/sec, 160 secs
lola: 43559524 markings, 109094680 edges, 227366 markings/sec, 165 secs
lola: 44690135 markings, 112050909 edges, 226122 markings/sec, 170 secs
lola: 45817900 markings, 114996763 edges, 225553 markings/sec, 175 secs
lola: 46943864 markings, 117950760 edges, 225193 markings/sec, 180 secs
lola: 48079090 markings, 120920457 edges, 227045 markings/sec, 185 secs
lola: 49224180 markings, 123917811 edges, 229018 markings/sec, 190 secs
lola: 50269707 markings, 126671045 edges, 209105 markings/sec, 195 secs
lola: 51322487 markings, 129446103 edges, 210556 markings/sec, 200 secs
lola: 52389591 markings, 132253901 edges, 213421 markings/sec, 205 secs
lola: 53486843 markings, 135153632 edges, 219450 markings/sec, 210 secs
lola: 54517141 markings, 137871390 edges, 206060 markings/sec, 215 secs
lola: 55534471 markings, 140570537 edges, 203466 markings/sec, 220 secs
lola: 56563951 markings, 143289454 edges, 205896 markings/sec, 225 secs
lola: 57585514 markings, 145995380 edges, 204313 markings/sec, 230 secs
lola: 58604569 markings, 148698349 edges, 203811 markings/sec, 235 secs
lola: 59610802 markings, 151365608 edges, 201247 markings/sec, 240 secs
lola: 60619043 markings, 154046185 edges, 201648 markings/sec, 245 secs
lola: 61639313 markings, 156755953 edges, 204054 markings/sec, 250 secs
lola: 62660362 markings, 159467434 edges, 204210 markings/sec, 255 secs
lola: 63677817 markings, 162164705 edges, 203491 markings/sec, 260 secs
lola: 64698006 markings, 164872563 edges, 204038 markings/sec, 265 secs
lola: 65768564 markings, 167731434 edges, 214112 markings/sec, 270 secs
lola: 66772092 markings, 170402550 edges, 200706 markings/sec, 275 secs
lola: 67770437 markings, 173069911 edges, 199669 markings/sec, 280 secs
lola: 68779573 markings, 175757516 edges, 201827 markings/sec, 285 secs
lola: 69863190 markings, 178651328 edges, 216723 markings/sec, 290 secs
lola: 70968228 markings, 181607599 edges, 221008 markings/sec, 295 secs
lola: 72047262 markings, 184489562 edges, 215807 markings/sec, 300 secs
lola: 73037782 markings, 187145864 edges, 198104 markings/sec, 305 secs
lola: 74033334 markings, 189811263 edges, 199110 markings/sec, 310 secs
lola: 75022420 markings, 192457806 edges, 197817 markings/sec, 315 secs
lola: 76036867 markings, 195179807 edges, 202889 markings/sec, 320 secs
lola: 77114036 markings, 198071982 edges, 215434 markings/sec, 325 secs
lola: 78157247 markings, 200878736 edges, 208642 markings/sec, 330 secs
lola: 79140962 markings, 203524371 edges, 196743 markings/sec, 335 secs
lola: 80122120 markings, 206171221 edges, 196232 markings/sec, 340 secs
lola: 81098600 markings, 208807971 edges, 195296 markings/sec, 345 secs
lola: 82093322 markings, 211485532 edges, 198944 markings/sec, 350 secs
lola: 83023460 markings, 213988003 edges, 186028 markings/sec, 355 secs
lola: 83934389 markings, 216442072 edges, 182186 markings/sec, 360 secs
lola: 84743350 markings, 218628696 edges, 161792 markings/sec, 365 secs
lola: 85768929 markings, 221400881 edges, 205116 markings/sec, 370 secs
lola: 86807587 markings, 224206667 edges, 207732 markings/sec, 375 secs
lola: 87778454 markings, 226840604 edges, 194173 markings/sec, 380 secs
lola: 88804587 markings, 229627499 edges, 205227 markings/sec, 385 secs
lola: 89739253 markings, 232160262 edges, 186933 markings/sec, 390 secs
lola: 90672680 markings, 234683178 edges, 186685 markings/sec, 395 secs
lola: 91601623 markings, 237197170 edges, 185789 markings/sec, 400 secs
lola: 92567676 markings, 239815729 edges, 193211 markings/sec, 405 secs
lola: 93504026 markings, 242354767 edges, 187270 markings/sec, 410 secs
lola: 94520387 markings, 245115631 edges, 203272 markings/sec, 415 secs
lola: 95539301 markings, 247884469 edges, 203783 markings/sec, 420 secs
lola: 96348141 markings, 250088200 edges, 161768 markings/sec, 425 secs
lola: 97276586 markings, 252616921 edges, 185689 markings/sec, 430 secs
lola: 98245354 markings, 255252687 edges, 193754 markings/sec, 435 secs
lola: 99216398 markings, 257892927 edges, 194209 markings/sec, 440 secs
lola: 100217605 markings, 260624307 edges, 200241 markings/sec, 445 secs
lola: 101216775 markings, 263352544 edges, 199834 markings/sec, 450 secs
lola: 102210844 markings, 266074674 edges, 198814 markings/sec, 455 secs
lola: 103176800 markings, 268718868 edges, 193191 markings/sec, 460 secs
lola: 103839557 markings, 270534297 edges, 132551 markings/sec, 465 secs
lola: 103890965 markings, 270675218 edges, 10282 markings/sec, 470 secs
lola: 103891922 markings, 270678022 edges, 191 markings/sec, 475 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no yes yes no no no yes no
lola:
preliminary result: no unknown no yes yes no no no yes no
lola: memory consumption: 3472 KB
lola: time consumption: 887 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="Raft-PT-04"
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 Raft-PT-04, 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 r189-tajo-162089432700177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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