fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853100345
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NoC3x3-PT-2A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15795.070 3600000.00 1100833.00 7396.90 FTF?FFTFTTTFTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100345.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-2A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 127K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591140746675

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:32:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:32:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:32:29] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2020-06-02 23:32:29] [INFO ] Transformed 361 places.
[2020-06-02 23:32:29] [INFO ] Transformed 428 transitions.
[2020-06-02 23:32:29] [INFO ] Found NUPN structural information;
[2020-06-02 23:32:29] [INFO ] Parsed PT model containing 361 places and 428 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 522 ms. (steps per millisecond=191 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-02 23:32:29] [INFO ] Flow matrix only has 377 transitions (discarded 51 similar events)
// Phase 1: matrix 377 rows 361 cols
[2020-06-02 23:32:29] [INFO ] Computed 127 place invariants in 36 ms
[2020-06-02 23:32:29] [INFO ] [Real]Absence check using 76 positive place invariants in 61 ms returned sat
[2020-06-02 23:32:29] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 30 ms returned sat
[2020-06-02 23:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:30] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2020-06-02 23:32:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:30] [INFO ] [Nat]Absence check using 76 positive place invariants in 68 ms returned unsat
[2020-06-02 23:32:30] [INFO ] [Real]Absence check using 76 positive place invariants in 75 ms returned sat
[2020-06-02 23:32:31] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 22 ms returned sat
[2020-06-02 23:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:31] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2020-06-02 23:32:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:31] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned unsat
[2020-06-02 23:32:31] [INFO ] [Real]Absence check using 76 positive place invariants in 33 ms returned sat
[2020-06-02 23:32:31] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 20 ms returned sat
[2020-06-02 23:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:32] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2020-06-02 23:32:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned unsat
[2020-06-02 23:32:32] [INFO ] [Real]Absence check using 76 positive place invariants in 51 ms returned sat
[2020-06-02 23:32:32] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 27 ms returned sat
[2020-06-02 23:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:32] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2020-06-02 23:32:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:33] [INFO ] [Nat]Absence check using 76 positive place invariants in 23 ms returned unsat
[2020-06-02 23:32:33] [INFO ] [Real]Absence check using 76 positive place invariants in 32 ms returned sat
[2020-06-02 23:32:33] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 37 ms returned sat
[2020-06-02 23:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:33] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2020-06-02 23:32:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:33] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned unsat
[2020-06-02 23:32:33] [INFO ] [Real]Absence check using 76 positive place invariants in 46 ms returned sat
[2020-06-02 23:32:33] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 25 ms returned sat
[2020-06-02 23:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:34] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2020-06-02 23:32:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:34] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned unsat
[2020-06-02 23:32:34] [INFO ] [Real]Absence check using 76 positive place invariants in 40 ms returned sat
[2020-06-02 23:32:34] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 21 ms returned sat
[2020-06-02 23:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:35] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2020-06-02 23:32:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:35] [INFO ] [Nat]Absence check using 76 positive place invariants in 22 ms returned unsat
[2020-06-02 23:32:35] [INFO ] [Real]Absence check using 76 positive place invariants in 49 ms returned sat
[2020-06-02 23:32:35] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 20 ms returned sat
[2020-06-02 23:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:35] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2020-06-02 23:32:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:35] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned unsat
[2020-06-02 23:32:35] [INFO ] [Real]Absence check using 76 positive place invariants in 51 ms returned sat
[2020-06-02 23:32:35] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 20 ms returned sat
[2020-06-02 23:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:36] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2020-06-02 23:32:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:36] [INFO ] [Nat]Absence check using 76 positive place invariants in 174 ms returned sat
[2020-06-02 23:32:36] [INFO ] [Nat]Absence check using 76 positive and 51 generalized place invariants in 19 ms returned sat
[2020-06-02 23:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:37] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2020-06-02 23:32:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-02 23:32:37] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2020-06-02 23:32:37] [INFO ] Computed and/alt/rep : 427/2440/376 causal constraints in 48 ms.
[2020-06-02 23:32:41] [INFO ] Added : 347 causal constraints over 70 iterations in 3923 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-06-02 23:32:41] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-02 23:32:41] [INFO ] Flatten gal took : 211 ms
FORMULA NoC3x3-PT-2A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:32:41] [INFO ] Applying decomposition
[2020-06-02 23:32:41] [INFO ] Flatten gal took : 69 ms
[2020-06-02 23:32:41] [INFO ] Decomposing Gal with order
[2020-06-02 23:32:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 23:32:42] [INFO ] Removed a total of 222 redundant transitions.
[2020-06-02 23:32:42] [INFO ] Flatten gal took : 100 ms
[2020-06-02 23:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 49 ms.
[2020-06-02 23:32:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-02 23:32:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ NoC3x3-PT-2A @ 3570 seconds

FORMULA NoC3x3-PT-2A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2562
rslt: Output for LTLCardinality @ NoC3x3-PT-2A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:32:42 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p21)) AND ((p106 <= 0))) U (G ((((p65 <= 0)) OR ((1 <= p176)))) AND (((p21 <= 0)) OR ((1 <= p106))))))",
"processed_size": 116,
"rewrites": 73
},
"result":
{
"edges": 33,
"markings": 33,
"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": 513
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p51 <= 0)) OR ((1 <= p29))) U X ((((1 <= p116)) AND ((p158 <= 0)))))",
"processed_size": 73,
"rewrites": 73
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((((1 <= p352)) AND ((p61 <= 0)))))",
"processed_size": 40,
"rewrites": 73
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (X (G ((((1 <= p352)) AND ((p61 <= 0)))))) R ((p203 <= 0))))",
"processed_size": 66,
"rewrites": 73
},
"result":
{
"edges": 1223070,
"markings": 465737,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 770
},
"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 ((((p261 <= 0)) OR ((1 <= p273)))))",
"processed_size": 41,
"rewrites": 73
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1026
},
"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 ((((p158 <= 0)) OR ((1 <= p226)))))",
"processed_size": 41,
"rewrites": 73
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1540
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1540
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((((1 <= p21)) AND ((p294 <= 0)))) AND (((1 <= p338)) AND ((p332 <= 0)))))",
"processed_size": 80,
"rewrites": 73
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((1 <= p21)) AND ((p294 <= 0))))",
"processed_size": 36,
"rewrites": 73
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 5,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G (((1 <= p253))) OR (G (F (((((p157 <= 0)) OR ((1 <= p229))) OR (F ((((p157 <= 0)) OR ((1 <= p229)))) AND F (G (((p253 <= 0)))))))) AND F (G (((1 <= p253)))))))",
"processed_size": 167,
"rewrites": 73
},
"result":
{
"edges": 7860919,
"markings": 4094295,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 7,
"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": 3800,
"runtime": 1008.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((** U (G(**) AND **))) : X(X(G((F((X(**) OR (F(**) OR (** OR **)))) AND (** OR (X(**) OR (F(**) OR (** OR **)))))))) : (** U X(**)) : (G((X(X(G(*))) R *)) OR X(X(*))) : X(F(**)) : X(F(**)) : G((G(**) OR (G(F((** OR (F(**) AND F(G(*)))))) AND F(G(**))))) : (X(**) AND (F((F(*) AND (* AND *))) OR X(G(**))))"
},
"net":
{
"arcs": 1697,
"conflict_clusters": 94,
"places": 361,
"places_significant": 234,
"singleton_clusters": 0,
"transitions": 428
},
"result":
{
"preliminary_value": "no unknown no no yes yes no yes ",
"value": "no unknown no no yes yes no yes "
},
"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: 789/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 361
lola: finding significant places
lola: 361 places, 428 transitions, 234 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: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p332 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: X (((((1 <= p21)) AND ((p106 <= 0))) U (G ((((p65 <= 0)) OR ((1 <= p176)))) AND (((p21 <= 0)) OR ((1 <= p106)))))) : X (X (G (((((p327 <= 0)) OR ((1 <= p314))) U (((X ((((p327 <= 0)) OR ((1 <= p314)))) OR F ((((p164 <= 0)) OR ((1 <= p321))))) OR ((p327 <= 0))) OR ((1 <= p314))))))) : ((((p51 <= 0)) OR ((1 <= p29))) U X ((((1 <= p116)) AND ((p158 <= 0))))) : (G (NOT((F (X (X ((((p352 <= 0)) OR ((1 <= p61)))))) U ((1 <= p203))))) OR NOT(X (X ((((p352 <= 0)) OR ((1 <= p61))))))) : F (X ((F (X ((((p321 <= 0)) OR ((1 <= p169))))) U F (((0 <= 0) U (((p261 <= 0)) OR ((1 <= p273)))))))) : F (X (((((((p189 <= 0)) OR ((1 <= p250))) U (1 <= 0)) U NOT(X (G ((((p189 <= 0)) OR ((1 <= p250))))))) U F ((((p158 <= 0)) OR ((1 <= p226))))))) : G ((G (F (NOT(G (NOT((F (NOT(F (((1 <= p253))))) U (((p157 <= 0)) OR ((1 <= p229))))))))) U G (((1 <= p253))))) : NOT((G (((G ((((p21 <= 0)) OR ((1 <= p294)))) OR ((p338 <= 0))) OR ((1 <= p332)))) U NOT(X ((((1 <= p21)) AND ((p294 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p21)) AND ((p106 <= 0))) U (G ((((p65 <= 0)) OR ((1 <= p176)))) AND (((p21 <= 0)) OR ((1 <= p106))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p21)) AND ((p106 <= 0))) U (G ((((p65 <= 0)) OR ((1 <= p176)))) AND (((p21 <= 0)) OR ((1 <= p106))))))
lola: processed formula length: 116
lola: 73 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314)))))) AND ((((p327 <= 0)) OR ((1 <= p314))) OR (X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314)))))) AND ((((p327 <= 0)) OR ((1 <= p314))) OR (X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314))))))))))
lola: processed formula length: 298
lola: 73 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 727514 markings, 1932781 edges, 145503 markings/sec, 0 secs
lola: 1507858 markings, 3821026 edges, 156069 markings/sec, 5 secs
lola: 2275778 markings, 5689874 edges, 153584 markings/sec, 10 secs
lola: 3005887 markings, 7536018 edges, 146022 markings/sec, 15 secs
lola: 3738355 markings, 9340910 edges, 146494 markings/sec, 20 secs
lola: 4458088 markings, 11186573 edges, 143947 markings/sec, 25 secs
lola: 5160299 markings, 13007963 edges, 140442 markings/sec, 30 secs
lola: 5820721 markings, 14766309 edges, 132084 markings/sec, 35 secs
lola: 6532346 markings, 16551958 edges, 142325 markings/sec, 40 secs
lola: 7270359 markings, 18325590 edges, 147603 markings/sec, 45 secs
lola: 7962665 markings, 20048599 edges, 138461 markings/sec, 50 secs
lola: 8679154 markings, 21831832 edges, 143298 markings/sec, 55 secs
lola: 9378692 markings, 23588925 edges, 139908 markings/sec, 60 secs
lola: 10113631 markings, 25393936 edges, 146988 markings/sec, 65 secs
lola: 10861695 markings, 27204941 edges, 149613 markings/sec, 70 secs
lola: 11559922 markings, 28971777 edges, 139645 markings/sec, 75 secs
lola: 12309400 markings, 30789741 edges, 149896 markings/sec, 80 secs
lola: 13048147 markings, 32642299 edges, 147749 markings/sec, 85 secs
lola: 13724626 markings, 34362189 edges, 135296 markings/sec, 90 secs
lola: 14469303 markings, 36216343 edges, 148935 markings/sec, 95 secs
lola: 15150060 markings, 37952146 edges, 136151 markings/sec, 100 secs
lola: 15877358 markings, 39741074 edges, 145460 markings/sec, 105 secs
lola: 16572625 markings, 41559867 edges, 139053 markings/sec, 110 secs
lola: 17314020 markings, 43384801 edges, 148279 markings/sec, 115 secs
lola: 18039400 markings, 45202228 edges, 145076 markings/sec, 120 secs
lola: 18779588 markings, 47074605 edges, 148038 markings/sec, 125 secs
lola: 19580040 markings, 49042949 edges, 160090 markings/sec, 130 secs
lola: 20387661 markings, 51015237 edges, 161524 markings/sec, 135 secs
lola: 21167675 markings, 52956610 edges, 156003 markings/sec, 140 secs
lola: 21915942 markings, 54828724 edges, 149653 markings/sec, 145 secs
lola: 22687071 markings, 56734594 edges, 154226 markings/sec, 150 secs
lola: 23438171 markings, 58689263 edges, 150220 markings/sec, 155 secs
lola: 24155908 markings, 60580646 edges, 143547 markings/sec, 160 secs
lola: 24864357 markings, 62464838 edges, 141690 markings/sec, 165 secs
lola: 25623966 markings, 64322135 edges, 151922 markings/sec, 170 secs
lola: 26403464 markings, 66195838 edges, 155900 markings/sec, 175 secs
lola: 27144697 markings, 68032163 edges, 148247 markings/sec, 180 secs
lola: 27844101 markings, 69838794 edges, 139881 markings/sec, 185 secs
lola: 28554723 markings, 71673718 edges, 142124 markings/sec, 190 secs
lola: 29277594 markings, 73500217 edges, 144574 markings/sec, 195 secs
lola: 29977272 markings, 75287804 edges, 139936 markings/sec, 200 secs
lola: 30704798 markings, 77120249 edges, 145505 markings/sec, 205 secs
lola: 31444618 markings, 78942823 edges, 147964 markings/sec, 210 secs
lola: 32188607 markings, 80759903 edges, 148798 markings/sec, 215 secs
lola: 32922325 markings, 82571494 edges, 146744 markings/sec, 220 secs
lola: 33619499 markings, 84368429 edges, 139435 markings/sec, 225 secs
lola: 34354624 markings, 86180651 edges, 147025 markings/sec, 230 secs
lola: 35069441 markings, 87979254 edges, 142963 markings/sec, 235 secs
lola: 35836770 markings, 89822091 edges, 153466 markings/sec, 240 secs
lola: 36596344 markings, 91640096 edges, 151915 markings/sec, 245 secs
lola: 37369224 markings, 93510408 edges, 154576 markings/sec, 250 secs
lola: 38061571 markings, 95335770 edges, 138469 markings/sec, 255 secs
lola: 38745048 markings, 97098381 edges, 136695 markings/sec, 260 secs
lola: 39410324 markings, 98879741 edges, 133055 markings/sec, 265 secs
lola: 40118971 markings, 100726258 edges, 141729 markings/sec, 270 secs
lola: 40826517 markings, 102598089 edges, 141509 markings/sec, 275 secs
lola: 41521691 markings, 104392547 edges, 139035 markings/sec, 280 secs
lola: 42276809 markings, 106199971 edges, 151024 markings/sec, 285 secs
lola: 43042216 markings, 108054027 edges, 153081 markings/sec, 290 secs
lola: 43778246 markings, 109866135 edges, 147206 markings/sec, 295 secs
lola: 44487077 markings, 111633043 edges, 141766 markings/sec, 300 secs
lola: 45186599 markings, 113449990 edges, 139904 markings/sec, 305 secs
lola: 45893674 markings, 115208953 edges, 141415 markings/sec, 310 secs
lola: 46645101 markings, 117077677 edges, 150285 markings/sec, 315 secs
lola: 47309755 markings, 118823469 edges, 132931 markings/sec, 320 secs
lola: 48021462 markings, 120596900 edges, 142341 markings/sec, 325 secs
lola: 48765974 markings, 122409874 edges, 148902 markings/sec, 330 secs
lola: 49499272 markings, 124184780 edges, 146660 markings/sec, 335 secs
lola: 50228780 markings, 125961830 edges, 145902 markings/sec, 340 secs
lola: 50937248 markings, 127722318 edges, 141694 markings/sec, 345 secs
lola: 51631663 markings, 129449485 edges, 138883 markings/sec, 350 secs
lola: 52262343 markings, 131116445 edges, 126136 markings/sec, 355 secs
lola: 53009991 markings, 132927611 edges, 149530 markings/sec, 360 secs
lola: 53742959 markings, 134725560 edges, 146594 markings/sec, 365 secs
lola: 54464624 markings, 136484498 edges, 144333 markings/sec, 370 secs
lola: 55178486 markings, 138213368 edges, 142772 markings/sec, 375 secs
lola: 55836559 markings, 139908164 edges, 131615 markings/sec, 380 secs
lola: 56508523 markings, 141624063 edges, 134393 markings/sec, 385 secs
lola: 57175012 markings, 143376575 edges, 133298 markings/sec, 390 secs
lola: 57825944 markings, 144974621 edges, 130186 markings/sec, 395 secs
lola: 58480614 markings, 146611944 edges, 130934 markings/sec, 400 secs
lola: 59162960 markings, 148267784 edges, 136469 markings/sec, 405 secs
lola: 59867818 markings, 149993142 edges, 140972 markings/sec, 410 secs
lola: 60529568 markings, 151704509 edges, 132350 markings/sec, 415 secs
lola: 61187856 markings, 153409457 edges, 131658 markings/sec, 420 secs
lola: 61866768 markings, 155127884 edges, 135782 markings/sec, 425 secs
lola: 62556892 markings, 156819607 edges, 138025 markings/sec, 430 secs
lola: 63249581 markings, 158488152 edges, 138538 markings/sec, 435 secs
lola: 63929991 markings, 160128016 edges, 136082 markings/sec, 440 secs
lola: 64582998 markings, 161808915 edges, 130601 markings/sec, 445 secs
lola: 65265602 markings, 163556949 edges, 136521 markings/sec, 450 secs
lola: 65948518 markings, 165217088 edges, 136583 markings/sec, 455 secs
lola: 66629228 markings, 166887680 edges, 136142 markings/sec, 460 secs
lola: 67320741 markings, 168561710 edges, 138303 markings/sec, 465 secs
lola: 68010113 markings, 170234174 edges, 137874 markings/sec, 470 secs
lola: 68671080 markings, 171880904 edges, 132193 markings/sec, 475 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p51 <= 0)) OR ((1 <= p29))) U X ((((1 <= p116)) AND ((p158 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p51 <= 0)) OR ((1 <= p29))) U X ((((1 <= p116)) AND ((p158 <= 0)))))
lola: processed formula length: 73
lola: 73 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 3 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (X (G ((((1 <= p352)) AND ((p61 <= 0)))))) R ((p203 <= 0)))) OR X (X ((((1 <= p352)) AND ((p61 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p352)) AND ((p61 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p352)) AND ((p61 <= 0)))))
lola: processed formula length: 40
lola: 73 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G ((((1 <= p352)) AND ((p61 <= 0)))))) R ((p203 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G ((((1 <= p352)) AND ((p61 <= 0)))))) R ((p203 <= 0))))
lola: processed formula length: 66
lola: 73 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 465737 markings, 1223070 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p261 <= 0)) OR ((1 <= p273)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p261 <= 0)) OR ((1 <= p273)))))
lola: processed formula length: 41
lola: 73 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 5 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p158 <= 0)) OR ((1 <= p226)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p158 <= 0)) OR ((1 <= p226)))))
lola: processed formula length: 41
lola: 73 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 6 will run for 1540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p21)) AND ((p294 <= 0)))) AND (F ((F ((((1 <= p21)) AND ((p294 <= 0)))) AND (((1 <= p338)) AND ((p332 <= 0))))) OR X (G ((((1 <= p21)) AND ((p294 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((1 <= p21)) AND ((p294 <= 0)))) AND (((1 <= p338)) AND ((p332 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((1 <= p21)) AND ((p294 <= 0)))) AND (((1 <= p338)) AND ((p332 <= 0)))))
lola: processed formula length: 80
lola: 73 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 3080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p21)) AND ((p294 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p21)) AND ((p294 <= 0))))
lola: processed formula length: 36
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 3080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((1 <= p253))) OR (G (F (((((p157 <= 0)) OR ((1 <= p229))) OR (F ((((p157 <= 0)) OR ((1 <= p229)))) AND F (G (((p253 <= 0)))))))) AND F (G (((1 <= p253)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((1 <= p253))) OR (G (F (((((p157 <= 0)) OR ((1 <= p229))) OR (F ((((p157 <= 0)) OR ((1 <= p229)))) AND F (G (((p253 <= 0)))))))) AND F (G (((1 <= p253)))))))
lola: processed formula length: 167
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 522493 markings, 988563 edges, 104499 markings/sec, 0 secs
lola: 1096560 markings, 2069634 edges, 114813 markings/sec, 5 secs
lola: 1788756 markings, 3413920 edges, 138439 markings/sec, 10 secs
lola: 2463830 markings, 4716178 edges, 135015 markings/sec, 15 secs
lola: 3150132 markings, 6029304 edges, 137260 markings/sec, 20 secs
lola: 3847924 markings, 7385535 edges, 139558 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4094295 markings, 7860919 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314)))))) AND ((((p327 <= 0)) OR ((1 <= p314))) OR (X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314)))))) AND ((((p327 <= 0)) OR ((1 <= p314))) OR (X ((((p327 <= 0)) OR ((1 <= p314)))) OR (F ((((p164 <= 0)) OR ((1 <= p321)))) OR (((p327 <= 0)) OR ((1 <= p314))))))))))
lola: processed formula length: 298
lola: 73 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 833245 markings, 2182104 edges, 166649 markings/sec, 0 secs
lola: 1709769 markings, 4302948 edges, 175305 markings/sec, 5 secs
lola: 2556220 markings, 6386090 edges, 169290 markings/sec, 10 secs
lola: 3362887 markings, 8419245 edges, 161333 markings/sec, 15 secs
lola: 4179190 markings, 10448560 edges, 163261 markings/sec, 20 secs
lola: 4963249 markings, 12487531 edges, 156812 markings/sec, 25 secs
lola: 5704900 markings, 14456424 edges, 148330 markings/sec, 30 secs
lola: 6488000 markings, 16445472 edges, 156620 markings/sec, 35 secs
lola: 7288302 markings, 18373239 edges, 160060 markings/sec, 40 secs
lola: 8049816 markings, 20260065 edges, 152303 markings/sec, 45 secs
lola: 8821468 markings, 22179132 edges, 154330 markings/sec, 50 secs
lola: 9577456 markings, 24095247 edges, 151198 markings/sec, 55 secs
lola: 10357208 markings, 25979681 edges, 155950 markings/sec, 60 secs
lola: 11103920 markings, 27827216 edges, 149342 markings/sec, 65 secs
lola: 11871518 markings, 29698889 edges, 153520 markings/sec, 70 secs
lola: 12641220 markings, 31599028 edges, 153940 markings/sec, 75 secs
lola: 13376216 markings, 33515471 edges, 146999 markings/sec, 80 secs
lola: 14179288 markings, 35477908 edges, 160614 markings/sec, 85 secs
lola: 14916480 markings, 37366123 edges, 147438 markings/sec, 90 secs
lola: 15693021 markings, 39256627 edges, 155308 markings/sec, 95 secs
lola: 16408649 markings, 41137659 edges, 143126 markings/sec, 100 secs
lola: 17169233 markings, 43030626 edges, 152117 markings/sec, 105 secs
lola: 17928071 markings, 44911945 edges, 151768 markings/sec, 110 secs
lola: 18679257 markings, 46831609 edges, 150237 markings/sec, 115 secs
lola: 19510380 markings, 48869387 edges, 166225 markings/sec, 120 secs
lola: 20330257 markings, 50876743 edges, 163975 markings/sec, 125 secs
lola: 21148453 markings, 52908931 edges, 163639 markings/sec, 130 secs
lola: 21947810 markings, 54906400 edges, 159871 markings/sec, 135 secs
lola: 22664610 markings, 56673137 edges, 143360 markings/sec, 140 secs
lola: 23383415 markings, 58540140 edges, 143761 markings/sec, 145 secs
lola: 24038635 markings, 60261445 edges, 131044 markings/sec, 150 secs
lola: 24702664 markings, 62036889 edges, 132806 markings/sec, 155 secs
lola: 25424933 markings, 63843647 edges, 144454 markings/sec, 160 secs
lola: 26174264 markings, 65651880 edges, 149866 markings/sec, 165 secs
lola: 26891293 markings, 67409870 edges, 143406 markings/sec, 170 secs
lola: 27597880 markings, 69179803 edges, 141317 markings/sec, 175 secs
lola: 28285434 markings, 70963888 edges, 137511 markings/sec, 180 secs
lola: 28940677 markings, 72666824 edges, 131049 markings/sec, 185 secs
lola: 29620286 markings, 74363964 edges, 135922 markings/sec, 190 secs
lola: 30309753 markings, 76138892 edges, 137893 markings/sec, 195 secs
lola: 31029981 markings, 77917493 edges, 144046 markings/sec, 200 secs
lola: 31775777 markings, 79751622 edges, 149159 markings/sec, 205 secs
lola: 32528140 markings, 81569613 edges, 150473 markings/sec, 210 secs
lola: 33225034 markings, 83369339 edges, 139379 markings/sec, 215 secs
lola: 33930818 markings, 85144654 edges, 141157 markings/sec, 220 secs
lola: 34663400 markings, 86975929 edges, 146516 markings/sec, 225 secs
lola: 35418270 markings, 88817825 edges, 150974 markings/sec, 230 secs
lola: 36178014 markings, 90636863 edges, 151949 markings/sec, 235 secs
lola: 36909781 markings, 92405878 edges, 146353 markings/sec, 240 secs
lola: 37629704 markings, 94190706 edges, 143985 markings/sec, 245 secs
lola: 38310008 markings, 95986588 edges, 136061 markings/sec, 250 secs
lola: 38988054 markings, 97744343 edges, 135609 markings/sec, 255 secs
lola: 39642118 markings, 99520973 edges, 130813 markings/sec, 260 secs
lola: 40377452 markings, 101406729 edges, 147067 markings/sec, 265 secs
lola: 40998921 markings, 103039497 edges, 124294 markings/sec, 270 secs
lola: 41643221 markings, 104678407 edges, 128860 markings/sec, 275 secs
lola: 42328648 markings, 106329647 edges, 137085 markings/sec, 280 secs
lola: 43033438 markings, 108033715 edges, 140958 markings/sec, 285 secs
lola: 43753140 markings, 109801485 edges, 143940 markings/sec, 290 secs
lola: 44441057 markings, 111528151 edges, 137583 markings/sec, 295 secs
lola: 45155616 markings, 113379791 edges, 142912 markings/sec, 300 secs
lola: 45869009 markings, 115144828 edges, 142679 markings/sec, 305 secs
lola: 46616672 markings, 117001382 edges, 149533 markings/sec, 310 secs
lola: 47274270 markings, 118732902 edges, 131520 markings/sec, 315 secs
lola: 48003044 markings, 120549975 edges, 145755 markings/sec, 320 secs
lola: 48762313 markings, 122400459 edges, 151854 markings/sec, 325 secs
lola: 49508217 markings, 124205520 edges, 149181 markings/sec, 330 secs
lola: 50241628 markings, 125995817 edges, 146682 markings/sec, 335 secs
lola: 50972421 markings, 127803697 edges, 146159 markings/sec, 340 secs
lola: 51684317 markings, 129585532 edges, 142379 markings/sec, 345 secs
lola: 52339771 markings, 131301026 edges, 131091 markings/sec, 350 secs
lola: 53075619 markings, 133091700 edges, 147170 markings/sec, 355 secs
lola: 53822756 markings, 134915731 edges, 149427 markings/sec, 360 secs
lola: 54532758 markings, 136652184 edges, 142000 markings/sec, 365 secs
lola: 55193949 markings, 138254074 edges, 132238 markings/sec, 370 secs
lola: 55801304 markings, 139817190 edges, 121471 markings/sec, 375 secs
lola: 56391415 markings, 141306389 edges, 118022 markings/sec, 380 secs
lola: 56953988 markings, 142781881 edges, 112515 markings/sec, 385 secs
lola: 57522348 markings, 144245014 edges, 113672 markings/sec, 390 secs
lola: 58089877 markings, 145627757 edges, 113506 markings/sec, 395 secs
lola: 58708234 markings, 147164488 edges, 123671 markings/sec, 400 secs
lola: 59314611 markings, 148625738 edges, 121275 markings/sec, 405 secs
lola: 59959772 markings, 150219234 edges, 129032 markings/sec, 410 secs
lola: 60549477 markings, 151759338 edges, 117941 markings/sec, 415 secs
lola: 61172886 markings, 153374153 edges, 124682 markings/sec, 420 secs
lola: 61824811 markings, 155017236 edges, 130385 markings/sec, 425 secs
lola: 62475903 markings, 156623521 edges, 130218 markings/sec, 430 secs
lola: 63091469 markings, 158107711 edges, 123113 markings/sec, 435 secs
lola: 63718497 markings, 159622288 edges, 125406 markings/sec, 440 secs
lola: 64325341 markings, 161131951 edges, 121369 markings/sec, 445 secs
lola: 64933600 markings, 162680463 edges, 121652 markings/sec, 450 secs
lola: 65554363 markings, 164254547 edges, 124153 markings/sec, 455 secs
lola: 66205977 markings, 165852685 edges, 130323 markings/sec, 460 secs
lola: 66858122 markings, 167451455 edges, 130429 markings/sec, 465 secs
lola: 67530872 markings, 169051112 edges, 134550 markings/sec, 470 secs
lola: 68168952 markings, 170629768 edges, 127616 markings/sec, 475 secs
lola: 68764315 markings, 172117890 edges, 119073 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no yes yes no yes
lola:
preliminary result: no unknown no no yes yes no yes
lola: memory consumption: 3800 KB
lola: time consumption: 1008 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="NoC3x3-PT-2A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is NoC3x3-PT-2A, 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 r174-csrt-158987853100345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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