fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097200113
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DLCflexbar-PT-6a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4470.243 3600000.00 249291.00 601.20 FTTFTFFFTTFFTTTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 04:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 04:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.2M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620525068080

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 01:51:10] [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-09 01:51:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 01:51:10] [INFO ] Load time of PNML (sax parser for PT used): 479 ms
[2021-05-09 01:51:10] [INFO ] Transformed 2069 places.
[2021-05-09 01:51:10] [INFO ] Transformed 16077 transitions.
[2021-05-09 01:51:10] [INFO ] Found NUPN structural information;
[2021-05-09 01:51:10] [INFO ] Parsed PT model containing 2069 places and 16077 transitions in 630 ms.
Ensure Unique test removed 1760 transitions
Reduce redundant transitions removed 1760 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 116 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 4198 ms. (steps per millisecond=23 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1]
[2021-05-09 01:51:15] [INFO ] Flow matrix only has 970 transitions (discarded 13347 similar events)
// Phase 1: matrix 970 rows 2069 cols
[2021-05-09 01:51:15] [INFO ] Computed 1492 place invariants in 23 ms
[2021-05-09 01:51:17] [INFO ] [Real]Absence check using 1492 positive place invariants in 1710 ms returned sat
[2021-05-09 01:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:51:26] [INFO ] [Real]Absence check using state equation in 8628 ms returned sat
[2021-05-09 01:51:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:51:27] [INFO ] [Nat]Absence check using 1492 positive place invariants in 984 ms returned unsat
[2021-05-09 01:51:29] [INFO ] [Real]Absence check using 1492 positive place invariants in 1663 ms returned sat
[2021-05-09 01:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:51:38] [INFO ] [Real]Absence check using state equation in 8973 ms returned sat
[2021-05-09 01:51:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:51:39] [INFO ] [Nat]Absence check using 1492 positive place invariants in 911 ms returned unsat
[2021-05-09 01:51:41] [INFO ] [Real]Absence check using 1492 positive place invariants in 1773 ms returned sat
[2021-05-09 01:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:51:50] [INFO ] [Real]Absence check using state equation in 8586 ms returned sat
[2021-05-09 01:51:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:51:50] [INFO ] [Nat]Absence check using 1492 positive place invariants in 244 ms returned unsat
[2021-05-09 01:51:52] [INFO ] [Real]Absence check using 1492 positive place invariants in 1749 ms returned sat
[2021-05-09 01:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:52:01] [INFO ] [Real]Absence check using state equation in 8541 ms returned sat
[2021-05-09 01:52:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:52:01] [INFO ] [Nat]Absence check using 1492 positive place invariants in 42 ms returned unsat
[2021-05-09 01:52:03] [INFO ] [Real]Absence check using 1492 positive place invariants in 1506 ms returned sat
[2021-05-09 01:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:52:11] [INFO ] [Real]Absence check using state equation in 8507 ms returned sat
[2021-05-09 01:52:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:52:12] [INFO ] [Nat]Absence check using 1492 positive place invariants in 42 ms returned unsat
[2021-05-09 01:52:14] [INFO ] [Real]Absence check using 1492 positive place invariants in 1734 ms returned sat
[2021-05-09 01:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:52:23] [INFO ] [Real]Absence check using state equation in 9090 ms returned sat
[2021-05-09 01:52:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:52:23] [INFO ] [Nat]Absence check using 1492 positive place invariants in 44 ms returned unsat
[2021-05-09 01:52:25] [INFO ] [Real]Absence check using 1492 positive place invariants in 1630 ms returned sat
[2021-05-09 01:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:52:34] [INFO ] [Real]Absence check using state equation in 8742 ms returned sat
[2021-05-09 01:52:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:52:35] [INFO ] [Nat]Absence check using 1492 positive place invariants in 1130 ms returned unsat
[2021-05-09 01:52:37] [INFO ] [Real]Absence check using 1492 positive place invariants in 1615 ms returned sat
[2021-05-09 01:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:52:46] [INFO ] [Real]Absence check using state equation in 8938 ms returned sat
[2021-05-09 01:52:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:52:48] [INFO ] [Nat]Absence check using 1492 positive place invariants in 1243 ms returned unsat
[2021-05-09 01:52:50] [INFO ] [Real]Absence check using 1492 positive place invariants in 1794 ms returned sat
[2021-05-09 01:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:53:00] [INFO ] [Real]Absence check using state equation in 9690 ms returned sat
[2021-05-09 01:53:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:53:00] [INFO ] [Nat]Absence check using 1492 positive place invariants in 253 ms returned unsat
[2021-05-09 01:53:02] [INFO ] [Real]Absence check using 1492 positive place invariants in 1802 ms returned sat
[2021-05-09 01:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:53:11] [INFO ] [Real]Absence check using state equation in 8383 ms returned sat
[2021-05-09 01:53:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:53:12] [INFO ] [Nat]Absence check using 1492 positive place invariants in 1055 ms returned unsat
[2021-05-09 01:53:14] [INFO ] [Real]Absence check using 1492 positive place invariants in 1760 ms returned sat
[2021-05-09 01:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:53:22] [INFO ] [Real]Absence check using state equation in 8244 ms returned sat
[2021-05-09 01:53:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:53:24] [INFO ] [Nat]Absence check using 1492 positive place invariants in 1040 ms returned unsat
[2021-05-09 01:53:25] [INFO ] [Real]Absence check using 1492 positive place invariants in 1543 ms returned sat
[2021-05-09 01:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:53:33] [INFO ] [Real]Absence check using state equation in 7857 ms returned sat
[2021-05-09 01:53:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:53:34] [INFO ] [Nat]Absence check using 1492 positive place invariants in 42 ms returned unsat
[2021-05-09 01:53:36] [INFO ] [Real]Absence check using 1492 positive place invariants in 1661 ms returned sat
[2021-05-09 01:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:53:44] [INFO ] [Real]Absence check using state equation in 8158 ms returned sat
[2021-05-09 01:53:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:53:44] [INFO ] [Nat]Absence check using 1492 positive place invariants in 47 ms returned unsat
[2021-05-09 01:53:46] [INFO ] [Real]Absence check using 1492 positive place invariants in 1652 ms returned sat
[2021-05-09 01:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:53:55] [INFO ] [Real]Absence check using state equation in 8992 ms returned sat
[2021-05-09 01:53:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:53:56] [INFO ] [Nat]Absence check using 1492 positive place invariants in 627 ms returned unsat
[2021-05-09 01:53:58] [INFO ] [Real]Absence check using 1492 positive place invariants in 1800 ms returned sat
[2021-05-09 01:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:54:07] [INFO ] [Real]Absence check using state equation in 9077 ms returned sat
[2021-05-09 01:54:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 01:54:08] [INFO ] [Nat]Absence check using 1492 positive place invariants in 42 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2021-05-09 01:54:08] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-09 01:54:09] [INFO ] Flatten gal took : 708 ms
FORMULA DLCflexbar-PT-6a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-6a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 01:54:09] [INFO ] Applying decomposition
[2021-05-09 01:54:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-09 01:54:09] [INFO ] Flatten gal took : 513 ms
[2021-05-09 01:54:09] [INFO ] Decomposing Gal with order
[2021-05-09 01:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 01:54:12] [INFO ] Removed a total of 24880 redundant transitions.
[2021-05-09 01:54:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-09 01:54:12] [INFO ] Flatten gal took : 649 ms
[2021-05-09 01:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 516 labels/synchronizations in 866 ms.
[2021-05-09 01:54:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DLCflexbar-PT-6a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 01:54:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-09 01:54:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 113 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCflexbar-PT-6a @ 3570 seconds

FORMULA DLCflexbar-PT-6a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3525
rslt: Output for LTLCardinality @ DLCflexbar-PT-6a

{
"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": "Sun May 9 01:54:14 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1175
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"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": "X (X (X (X (F (((p1360 <= 0)))))))",
"processed_size": 34,
"rewrites": 22
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F ((((1 <= p133)) AND ((p519 <= 0))))))",
"processed_size": 45,
"rewrites": 22
},
"result":
{
"edges": 126,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (F (((p1814 <= 0)))) AND (F (((1 <= p1814))) AND (((1 <= p1814)) OR (((1 <= p588)) AND ((p1598 <= 0)))))))",
"processed_size": 113,
"rewrites": 22
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"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": 211668,
"runtime": 45.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((G(*) AND (X(*) OR **)))) U **) : X(X(X(X(F(*))))) : X(X(F(*))) : F((G(F(*)) AND (F(**) AND **)))"
},
"net":
{
"arcs": 57005,
"conflict_clusters": 262,
"places": 2069,
"places_significant": 577,
"singleton_clusters": 0,
"transitions": 14317
},
"result":
{
"preliminary_value": "no no no no ",
"value": "no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2069
lola: finding significant places
lola: 2069 places, 14317 transitions, 577 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: (p1805 <= 1)
lola: LP says that atomic proposition is always true: (p1805 <= 1)
lola: LP says that atomic proposition is always true: (p1193 <= 1)
lola: LP says that atomic proposition is always true: (p609 <= 1)
lola: LP says that atomic proposition is always true: (p1128 <= 1)
lola: LP says that atomic proposition is always true: (p1360 <= 1)
lola: LP says that atomic proposition is always true: (p519 <= 1)
lola: LP says that atomic proposition is always true: (p1814 <= 1)
lola: LP says that atomic proposition is always true: (p1814 <= 1)
lola: LP says that atomic proposition is always true: (p1814 <= 1)
lola: LP says that atomic proposition is always true: (p1598 <= 1)
lola: (X (F ((NOT(F (((1 <= p1805)))) AND (NOT(X (((1 <= p1805)))) OR ((p1193 <= 0)))))) U ((((1 <= p1455)) AND ((p609 <= 0))) OR (((1 <= p240)) AND ((p1128 <= 0))))) : X (X (X (F (NOT(X (G (((1 <= p1360))))))))) : X (((0 <= 0) U X (NOT(((1 <= 0) U (((p133 <= 0)) OR ((1 <= p519)))))))) : F (((G (NOT(G (X (((1 <= p1814)))))) AND F (((1 <= p1814)))) AND (((1 <= p1814)) OR (((1 <= p588)) AND ((p1598 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G (((p1805 <= 0))) AND (X (((p1805 <= 0))) OR ((p1193 <= 0)))))) U ((((1 <= p1455)) AND ((p609 <= 0))) OR (((1 <= p240)) AND ((p1128 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((G (((p1805 <= 0))) AND (X (((p1805 <= 0))) OR ((p1193 <= 0)))))) U ((((1 <= p1455)) AND ((p609 <= 0))) OR (((1 <= p240)) AND ((p1128 <= 0)))))
lola: processed formula length: 151
lola: 22 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F (((p1360 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F (((p1360 <= 0)))))))
lola: processed formula length: 34
lola: 22 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 2 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p133)) AND ((p519 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p133)) AND ((p519 <= 0))))))
lola: processed formula length: 45
lola: 22 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: 53 markings, 126 edges
lola: ========================================
lola: subprocess 3 will run for 3525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F (((p1814 <= 0)))) AND (F (((1 <= p1814))) AND (((1 <= p1814)) OR (((1 <= p588)) AND ((p1598 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F (((p1814 <= 0)))) AND (F (((1 <= p1814))) AND (((1 <= p1814)) OR (((1 <= p588)) AND ((p1598 <= 0)))))))
lola: processed formula length: 113
lola: 22 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no
lola:
preliminary result: no no no no
lola: memory consumption: 211668 KB
lola: time consumption: 45 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="DLCflexbar-PT-6a"
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 DLCflexbar-PT-6a, 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 r075-tall-162039097200113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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