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.r208-smll-162089471200169.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SatelliteMemory-PT-X65535Y2048, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471200169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 11:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 12 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 5 16:52 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 SatelliteMemory-PT-X65535Y2048-00
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-01
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-02
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-03
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-04
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-05
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-06
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-07
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-08
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-09
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-10
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-11
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-12
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-13
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-14
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-15

=== Now, execution of the tool begins

BK_START 1621072076441

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 09:47:59] [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-15 09:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 09:47:59] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-15 09:47:59] [INFO ] Transformed 13 places.
[2021-05-15 09:47:59] [INFO ] Transformed 10 transitions.
[2021-05-15 09:47:59] [INFO ] Parsed PT model containing 13 places and 10 transitions in 132 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 515 ms. (steps per millisecond=194 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 09:48:00] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned unsat
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-15 09:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-15 09:48:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 09:48:00] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-15 09:48:00] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 3 ms.
[2021-05-15 09:48:00] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-15 09:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-15 09:48:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 16 ms returned sat
[2021-05-15 09:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned unsat
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned unsat
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-15 09:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-15 09:48:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-15 09:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-15 09:48:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-15 09:48:00] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 5 ms.
[2021-05-15 09:48:01] [INFO ] Added : 4 causal constraints over 1 iterations in 30 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-15 09:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2021-05-15 09:48:01] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-15 09:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2021-05-15 09:48:01] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 3 ms.
[2021-05-15 09:48:01] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned unsat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2021-05-15 09:48:01] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2021-05-15 09:48:01] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-15 09:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 4 ms.
[2021-05-15 09:48:01] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-15 09:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2021-05-15 09:48:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 3 ms.
[2021-05-15 09:48:01] [INFO ] Added : 6 causal constraints over 2 iterations in 53 ms. Result :sat
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 35 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-15 09:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-15 09:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:48:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-15 09:48:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-15 09:48:02] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 3 ms.
[2021-05-15 09:48:02] [INFO ] Added : 3 causal constraints over 1 iterations in 30 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-15 09:48:02] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-15 09:48:02] [INFO ] Flatten gal took : 43 ms
FORMULA SatelliteMemory-PT-X65535Y2048-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 09:48:02] [INFO ] Flatten gal took : 10 ms
[2021-05-15 09:48:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2021-05-15 09:48:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SatelliteMemory-PT-X65535Y2048 @ 3570 seconds

FORMULA SatelliteMemory-PT-X65535Y2048-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3056
rslt: Output for LTLCardinality @ SatelliteMemory-PT-X65535Y2048

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 15 09:48:03 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X ((G ((1 <= p7)) OR (p8 <= 1))) U ((p1 <= p10) AND (1 <= p7)))",
"processed_size": 64,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (X ((G ((1 <= p3)) OR F ((p4 <= p10))))) OR (1 <= p3)))",
"processed_size": 61,
"rewrites": 79
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 ((p6 + 1 <= p9))))",
"processed_size": 26,
"rewrites": 79
},
"result":
{
"edges": 4,
"markings": 4,
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p4)))",
"processed_size": 17,
"rewrites": 79
},
"result":
{
"edges": 7,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p3 <= p0))",
"processed_size": 14,
"rewrites": 79
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((X (G ((p11 <= 1))) U (p1 <= p10)) OR X (X (X ((p1 <= p10))))))",
"processed_size": 67,
"rewrites": 79
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"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 (G ((3 <= p6))))",
"processed_size": 21,
"rewrites": 79
},
"result":
{
"edges": 720861,
"markings": 524264,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((p4 <= p7)) OR (p5 + 1 <= p10))))",
"processed_size": 43,
"rewrites": 79
},
"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": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((F ((2 <= p8)) AND X ((2 <= p8))))",
"processed_size": 37,
"rewrites": 79
},
"result":
{
"edges": 2,
"markings": 3,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((p4 <= p7)) AND (X (F ((p3 <= 0))) OR (p4 <= p7)))))",
"processed_size": 62,
"rewrites": 79
},
"result":
{
"edges": 720917,
"markings": 524302,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((3 <= p6)))",
"processed_size": 17,
"rewrites": 79
},
"result":
{
"edges": 655329,
"markings": 458731,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p3 <= 0)))",
"processed_size": 17,
"rewrites": 79
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3436,
"runtime": 514.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((G(**) OR **)) U **) : F((X(X((G(*) OR F(**)))) OR **)) : X(X(F(*))) : (F(G(**)) OR X(**)) : X(((X(G(*)) U **) OR X(X(X(**))))) : X(X(G(*))) : X(F((F(**) OR **))) : (F((F(**) AND X(**))) OR X(X(X(G(*))))) : G(F(**)) : F((G((F((F(**) OR **)) AND (** OR (F(**) OR **)))) AND F(**))) : F(G(**)) : F(G((F(**) AND (X(F(*)) OR **))))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "no yes no yes no no yes yes no unknown no no ",
"value": "no yes no yes no no yes yes no unknown 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 384
lola: finding significant places
lola: 12 places, 10 transitions, 6 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: (X ((G ((1 <= p7)) OR (p8 <= 1))) U ((p1 <= p10) AND (1 <= p7))) : F (((X (G (NOT(X ((p3 <= 0))))) OR X (F (X ((p4 <= p10))))) OR (1 <= p3))) : NOT(G (X (X ((p9 <= p6))))) : (F (G ((1 <= p4))) OR X ((p3 <= p0))) : X (((G (NOT(X ((2 <= p11)))) U (p1 <= p10)) OR X (X (X ((p1 <= p10)))))) : NOT(X (F (X ((p6 <= 2))))) : F (X ((F (((0 <= 0) U F ((p4 <= p7)))) OR (p5 + 1 <= p10)))) : (NOT(G ((NOT(F ((2 <= p8))) OR NOT(X ((2 <= p8)))))) OR NOT(F (X (X (X ((p8 + 1 <= p4))))))) : X (X (X (G (F ((p3 <= 0)))))) : F ((G (((2 <= p3) U (F ((p4 <= p8)) OR (p5 + 1 <= p3)))) AND F ((p3 <= p5)))) : F (G (X ((3 <= p6)))) : F (NOT(G (NOT(G (X ((X (NOT(G ((1 <= p3)))) U (p4 <= p7))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((1 <= p7)) OR (p8 <= 1))) U ((p1 <= p10) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((G ((1 <= p7)) OR (p8 <= 1))) U ((p1 <= p10) AND (1 <= p7)))
lola: processed formula length: 64
lola: 79 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((G ((1 <= p3)) OR F ((p4 <= p10))))) OR (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((G ((1 <= p3)) OR F ((p4 <= p10))))) OR (1 <= p3)))
lola: processed formula length: 61
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p6 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p6 + 1 <= p9))))
lola: processed formula length: 26
lola: 79 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p4))) OR X ((p3 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p4)))
lola: processed formula length: 17
lola: 79 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: add low 4
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, 7 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p3 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p3 <= p0))
lola: processed formula length: 14
lola: 79 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (G ((p11 <= 1))) U (p1 <= p10)) OR X (X (X ((p1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (G ((p11 <= 1))) U (p1 <= p10)) OR X (X (X ((p1 <= p10))))))
lola: processed formula length: 67
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((3 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((3 <= p6))))
lola: processed formula length: 21
lola: 79 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: 524264 markings, 720861 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p4 <= p7)) OR (p5 + 1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p4 <= p7)) OR (p5 + 1 <= p10))))
lola: processed formula length: 43
lola: 79 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((2 <= p8)) AND X ((2 <= p8)))) OR X (X (X (G ((p4 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((2 <= p8)) AND X ((2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((2 <= p8)) AND X ((2 <= p8))))
lola: processed formula length: 37
lola: 79 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p4 <= p7)) AND (X (F ((p3 <= 0))) OR (p4 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p4 <= p7)) AND (X (F ((p3 <= 0))) OR (p4 <= p7)))))
lola: processed formula length: 62
lola: 79 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: add low 4
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: 524302 markings, 720917 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((3 <= p6)))
lola: processed formula length: 17
lola: 79 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: add low 4
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: 458731 markings, 655329 edges
lola: ========================================
lola: subprocess 10 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p3 <= 0)))
lola: processed formula length: 17
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((F ((p4 <= p8)) OR (p5 + 1 <= p3))) AND ((2 <= p3) OR (F ((p4 <= p8)) OR (p5 + 1 <= p3))))) AND F ((p3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((F ((p4 <= p8)) OR (p5 + 1 <= p3))) AND ((2 <= p3) OR (F ((p4 <= p8)) OR (p5 + 1 <= p3))))) AND F ((p3 <= p5))))
lola: processed formula length: 123
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 3784273 markings, 6491405 edges, 756855 markings/sec, 0 secs
lola: 7552693 markings, 13086140 edges, 753684 markings/sec, 5 secs
lola: 11197573 markings, 19464680 edges, 728976 markings/sec, 10 secs
lola: 14742530 markings, 25668355 edges, 708991 markings/sec, 15 secs
lola: 18251777 markings, 31809537 edges, 701849 markings/sec, 20 secs
lola: 21259487 markings, 37073038 edges, 601542 markings/sec, 25 secs
lola: 24565336 markings, 42858265 edges, 661170 markings/sec, 30 secs
lola: 27771599 markings, 48469226 edges, 641253 markings/sec, 35 secs
lola: 30991363 markings, 54103813 edges, 643953 markings/sec, 40 secs
lola: 34126243 markings, 59589853 edges, 626976 markings/sec, 45 secs
lola: 37386867 markings, 65295945 edges, 652125 markings/sec, 50 secs
lola: 40416381 markings, 70597592 edges, 605903 markings/sec, 55 secs
lola: 43590673 markings, 76152606 edges, 634858 markings/sec, 60 secs
lola: 46528344 markings, 81293531 edges, 587534 markings/sec, 65 secs
lola: 49555064 markings, 86590290 edges, 605344 markings/sec, 70 secs
lola: 52588602 markings, 91898981 edges, 606708 markings/sec, 75 secs
lola: 55299658 markings, 96643335 edges, 542211 markings/sec, 80 secs
lola: 58150550 markings, 101632391 edges, 570178 markings/sec, 85 secs
lola: 61147112 markings, 106876374 edges, 599312 markings/sec, 90 secs
lola: 64115144 markings, 112070430 edges, 593606 markings/sec, 95 secs
lola: 67213576 markings, 117492687 edges, 619686 markings/sec, 100 secs
lola: 70389798 markings, 123051073 edges, 635244 markings/sec, 105 secs
lola: 73460226 markings, 128424324 edges, 614086 markings/sec, 110 secs
lola: 76519559 markings, 133778154 edges, 611867 markings/sec, 115 secs
lola: 79508465 markings, 139008740 edges, 597781 markings/sec, 120 secs
lola: 82425535 markings, 144113612 edges, 583414 markings/sec, 125 secs
lola: 85477526 markings, 149454598 edges, 610398 markings/sec, 130 secs
lola: 88410080 markings, 154586568 edges, 586511 markings/sec, 135 secs
lola: 91229303 markings, 159520210 edges, 563845 markings/sec, 140 secs
lola: 94136410 markings, 164607644 edges, 581421 markings/sec, 145 secs
lola: 96926755 markings, 169490749 edges, 558069 markings/sec, 150 secs
lola: 99678297 markings, 174305948 edges, 550308 markings/sec, 155 secs
lola: 102606905 markings, 179439675 edges, 585722 markings/sec, 160 secs
lola: 104613327 markings, 182942248 edges, 401284 markings/sec, 165 secs
lola: 106521154 markings, 186280945 edges, 381565 markings/sec, 170 secs
lola: 108220045 markings, 189254006 edges, 339778 markings/sec, 175 secs
lola: 109678069 markings, 191805549 edges, 291605 markings/sec, 180 secs
lola: 111320518 markings, 194679842 edges, 328490 markings/sec, 185 secs
lola: 113491682 markings, 198479372 edges, 434233 markings/sec, 190 secs
lola: 114872152 markings, 200895193 edges, 276094 markings/sec, 195 secs
lola: 117267316 markings, 205086730 edges, 479033 markings/sec, 200 secs
lola: 118222746 markings, 206758732 edges, 191086 markings/sec, 205 secs
lola: 120338281 markings, 210460918 edges, 423107 markings/sec, 210 secs
lola: 121335278 markings, 212205663 edges, 199399 markings/sec, 215 secs
lola: 123502935 markings, 215999064 edges, 433531 markings/sec, 220 secs
lola: 124787600 markings, 218247229 edges, 256933 markings/sec, 225 secs
lola: 126544367 markings, 221321568 edges, 351353 markings/sec, 230 secs
lola: 127124451 markings, 222336717 edges, 116017 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((F ((p4 <= p8)) OR (p5 + 1 <= p3))) AND ((2 <= p3) OR (F ((p4 <= p8)) OR (p5 + 1 <= p3))))) AND F ((p3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((F ((p4 <= p8)) OR (p5 + 1 <= p3))) AND ((2 <= p3) OR (F ((p4 <= p8)) OR (p5 + 1 <= p3))))) AND F ((p3 <= p5))))
lola: processed formula length: 123
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 3228410 markings, 5518646 edges, 645682 markings/sec, 0 secs
lola: 6864155 markings, 11881197 edges, 727149 markings/sec, 5 secs
lola: 10243502 markings, 17795062 edges, 675869 markings/sec, 10 secs
lola: 13684378 markings, 23816589 edges, 688175 markings/sec, 15 secs
lola: 17087468 markings, 29771997 edges, 680618 markings/sec, 20 secs
lola: 20457304 markings, 35669212 edges, 673967 markings/sec, 25 secs
lola: 23719880 markings, 41378717 edges, 652515 markings/sec, 30 secs
lola: 27012287 markings, 47140429 edges, 658481 markings/sec, 35 secs
lola: 30025793 markings, 52414065 edges, 602701 markings/sec, 40 secs
lola: 33086388 markings, 57770106 edges, 612119 markings/sec, 45 secs
lola: 36048310 markings, 62953469 edges, 592384 markings/sec, 50 secs
lola: 39222908 markings, 68509017 edges, 634920 markings/sec, 55 secs
lola: 42246180 markings, 73799743 edges, 604654 markings/sec, 60 secs
lola: 45221472 markings, 79006504 edges, 595058 markings/sec, 65 secs
lola: 48152265 markings, 84135389 edges, 586159 markings/sec, 70 secs
lola: 51266348 markings, 89585035 edges, 622817 markings/sec, 75 secs
lola: 54277332 markings, 94854257 edges, 602197 markings/sec, 80 secs
lola: 56968560 markings, 99563908 edges, 538246 markings/sec, 85 secs
lola: 59863616 markings, 104630256 edges, 579011 markings/sec, 90 secs
lola: 62871510 markings, 109894070 edges, 601579 markings/sec, 95 secs
lola: 65865613 markings, 115133749 edges, 598821 markings/sec, 100 secs
lola: 69119817 markings, 120828606 edges, 650841 markings/sec, 105 secs
lola: 72034857 markings, 125929927 edges, 583008 markings/sec, 110 secs
lola: 75144261 markings, 131371384 edges, 621881 markings/sec, 115 secs
lola: 77988992 markings, 136349664 edges, 568946 markings/sec, 120 secs
lola: 80883098 markings, 141414350 edges, 578821 markings/sec, 125 secs
lola: 83670744 markings, 146292729 edges, 557529 markings/sec, 130 secs
lola: 86575028 markings, 151375226 edges, 580857 markings/sec, 135 secs
lola: 89471917 markings, 156444782 edges, 579378 markings/sec, 140 secs
lola: 92357553 markings, 161494646 edges, 577127 markings/sec, 145 secs
lola: 95080747 markings, 166260235 edges, 544639 markings/sec, 150 secs
lola: 97898856 markings, 171191926 edges, 563622 markings/sec, 155 secs
lola: 100662171 markings, 176027726 edges, 552663 markings/sec, 160 secs
lola: 102972430 markings, 180070680 edges, 462052 markings/sec, 165 secs
lola: 105072974 markings, 183750097 edges, 420109 markings/sec, 170 secs
lola: 106184705 markings, 185692161 edges, 222346 markings/sec, 175 secs
lola: 107570769 markings, 188117773 edges, 277213 markings/sec, 180 secs
lola: 109471072 markings, 191443302 edges, 380061 markings/sec, 185 secs
lola: 110442037 markings, 193142492 edges, 194193 markings/sec, 190 secs
lola: 112673455 markings, 197047473 edges, 446284 markings/sec, 195 secs
lola: 114443760 markings, 200145507 edges, 354061 markings/sec, 200 secs
lola: 116047873 markings, 202952703 edges, 320823 markings/sec, 205 secs
lola: 117624439 markings, 205711696 edges, 315313 markings/sec, 210 secs
lola: 119312891 markings, 208666487 edges, 337690 markings/sec, 215 secs
lola: 120911416 markings, 211463906 edges, 319705 markings/sec, 220 secs
lola: 122594565 markings, 214409414 edges, 336630 markings/sec, 225 secs
lola: 124560088 markings, 217849081 edges, 393105 markings/sec, 230 secs
lola: 126667045 markings, 221536254 edges, 421391 markings/sec, 235 secs
lola: 127028832 markings, 222169385 edges, 72357 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no yes no no yes yes no unknown no no
lola:
preliminary result: no yes no yes no no yes yes no unknown no no
lola: memory consumption: 3436 KB
lola: time consumption: 514 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="SatelliteMemory-PT-X65535Y2048"
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 SatelliteMemory-PT-X65535Y2048, 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 r208-smll-162089471200169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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