Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033476900033.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
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 r211-tajo-159033476900033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.2K May 14 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 12 20:42 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 1591284181146

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:02] [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-04 15:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:02] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-06-04 15:23:02] [INFO ] Transformed 13 places.
[2020-06-04 15:23:02] [INFO ] Transformed 10 transitions.
[2020-06-04 15:23:02] [INFO ] Parsed PT model containing 13 places and 10 transitions in 56 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 160 ms. (steps per millisecond=625 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 10 rows 12 cols
[2020-06-04 15:23:02] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-04 15:23:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 7 causal constraints over 2 iterations in 28 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 0 ms.
[2020-06-04 15:23:03] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 0 ms.
[2020-06-04 15:23:03] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 0 ms.
[2020-06-04 15:23:03] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 15:23:12] [INFO ] [Nat]Absence check using state equation in 9199 ms returned unknown
[2020-06-04 15:23:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-04 15:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 15:23:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-04 15:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-04 15:23:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:12] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2020-06-04 15:23:12] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-06-04 15:23:13] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 15:23:13] [INFO ] Flatten gal took : 26 ms
FORMULA SatelliteMemory-PT-X65535Y2048-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:13] [INFO ] Flatten gal took : 4 ms
[2020-06-04 15:23:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 15:23:13] [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-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-05 TRUE 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-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-10 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 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-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X65535Y2048-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2972
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": "Thu Jun 4 15:23:13 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 284
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G ((p8 <= p6))",
"processed_size": 14,
"rewrites": 59
},
"result":
{
"edges": 172037,
"markings": 155652,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p8 <= p11) AND (G ((p6 <= 1)) OR G ((1 <= p11)))))",
"processed_size": 55,
"rewrites": 59
},
"result":
{
"edges": 22535,
"markings": 16391,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((X (X ((p2 <= p1))) AND G ((1 <= p2)))))",
"processed_size": 46,
"rewrites": 59
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (X (F ((p2 <= p4)))))",
"processed_size": 26,
"rewrites": 59
},
"result":
{
"edges": 16,
"markings": 14,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 427
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p9 <= p10)))",
"processed_size": 19,
"rewrites": 59
},
"result":
{
"edges": 2,
"markings": 3,
"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": 488
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F ((X ((p2 + 1 <= p1)) OR (p11 + 1 <= p6))) OR (p8 <= 2)))",
"processed_size": 62,
"rewrites": 59
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 569
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(p2 + 1 <= p8)",
"processed_size": 14,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((p3 + 1 <= p0)))",
"processed_size": 22,
"rewrites": 59
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((p3 <= p2) OR (F ((3 <= p1)) AND (3 <= p1)))))",
"processed_size": 53,
"rewrites": 59
},
"result":
{
"edges": 22512,
"markings": 16373,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 854
},
"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 ((p4 + 1 <= p6))))",
"processed_size": 26,
"rewrites": 59
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((X ((3 <= p11)) OR (1 <= p7))) OR (F (G ((X ((3 <= p11)) OR (1 <= p7)))) AND F (G ((p11 + 1 <= p0))))))",
"processed_size": 110,
"rewrites": 59
},
"result":
{
"edges": 45075,
"markings": 38928,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 10,
"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": 1709
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p6 <= p9)))",
"processed_size": 18,
"rewrites": 59
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3236,
"runtime": 598.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) AND ((G(**) AND **) OR (X(**) U **))))) : (X((X(F(**)) AND **)) AND G(**)) : X((** AND (G(*) OR G(**)))) : F(G((X(X(**)) AND G(**)))) : X(X(X(F(**)))) : X(F(**)) : G(F(**)) : X((F((X(*) OR *)) OR **)) : (X(G(*)) AND (* AND (F(*) OR G(*)))) : X(G((** OR (F(**) AND **)))) : X(X(F(*))) : F(G(**)) : X((G((X(**) OR **)) OR (F(G((X(**) OR **))) AND F(G(*)))))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "unknown no no no yes yes unknown yes no no yes no no ",
"value": "unknown no no no yes yes unknown yes no no yes 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: F (G (((G ((1 <= p8)) AND (1 <= p10)) U (X ((1 <= p10)) U (p9 <= p3))))) : ((NOT(X (X (NOT(F ((p5 <= p11)))))) AND X ((p5 <= p11))) AND G ((p8 <= p6))) : X (((p8 <= p11) AND (NOT(F ((X (X ((1 <= p11))) U (2 <= p6)))) OR G ((1 <= p11))))) : G (F (G ((X (X ((p2 <= p1))) AND G ((1 <= p2)))))) : F (X (X (X ((p2 <= p4))))) : F ((NOT(G ((p5 <= p2))) U X ((p9 <= p10)))) : NOT(G (F (G (G (NOT(F ((p7 <= p4)))))))) : X ((NOT(G ((X ((p1 <= p2)) AND (p6 <= p11)))) OR (p8 <= 2))) : (NOT(X (F ((p0 <= p3)))) AND NOT((G ((3 <= p3)) U (p8 <= p2)))) : G (X (((p3 <= p2) OR (F ((3 <= p1)) AND (3 <= p1))))) : X (F (NOT(X ((p6 <= p4))))) : F (((p6 <= p9) U G ((p6 <= p9)))) : X ((NOT(X (G (X (X (F ((p0 <= p11))))))) U G ((X ((3 <= p11)) OR (1 <= p7)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:329
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p9 <= p3)) AND ((G ((1 <= p8)) AND (1 <= p10)) OR (X ((1 <= p10)) U (p9 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p9 <= p3)) AND ((G ((1 <= p8)) AND (1 <= p10)) OR (X ((1 <= p10)) U (p9 <= p3))))))
lola: processed formula length: 94
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 17 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: 5246726 markings, 8459927 edges, 1049345 markings/sec, 0 secs
lola: 10088717 markings, 16279051 edges, 968398 markings/sec, 5 secs
lola: 14701044 markings, 23821109 edges, 922465 markings/sec, 10 secs
lola: 19430386 markings, 31447374 edges, 945868 markings/sec, 15 secs
lola: 23858462 markings, 38672240 edges, 885615 markings/sec, 20 secs
lola: 28223471 markings, 45786740 edges, 873002 markings/sec, 25 secs
lola: 32535947 markings, 52801771 edges, 862495 markings/sec, 30 secs
lola: 36906878 markings, 59882475 edges, 874186 markings/sec, 35 secs
lola: 41450492 markings, 67230163 edges, 908723 markings/sec, 40 secs
lola: 45683576 markings, 74113794 edges, 846617 markings/sec, 45 secs
lola: 49887211 markings, 80945921 edges, 840727 markings/sec, 50 secs
lola: 54361418 markings, 88251485 edges, 894841 markings/sec, 55 secs
lola: 58572885 markings, 95097286 edges, 842293 markings/sec, 60 secs
lola: 62679553 markings, 101759690 edges, 821334 markings/sec, 65 secs
lola: 67108569 markings, 108986116 edges, 885803 markings/sec, 70 secs
lola: 71634637 markings, 116299654 edges, 905214 markings/sec, 75 secs
lola: 76092701 markings, 123528834 edges, 891613 markings/sec, 80 secs
lola: 80689947 markings, 131049748 edges, 919449 markings/sec, 85 secs
lola: 84849975 markings, 137805530 edges, 832006 markings/sec, 90 secs
lola: 89255044 markings, 144958575 edges, 881014 markings/sec, 95 secs
lola: 92213959 markings, 149775585 edges, 591783 markings/sec, 100 secs
lola: 94394021 markings, 153322426 edges, 436012 markings/sec, 105 secs
lola: 97372779 markings, 158147643 edges, 595752 markings/sec, 110 secs
lola: 99597114 markings, 161778094 edges, 444867 markings/sec, 115 secs
lola: 102491388 markings, 166449873 edges, 578855 markings/sec, 120 secs
lola: 105115708 markings, 170715726 edges, 524864 markings/sec, 125 secs
lola: 107658489 markings, 174836969 edges, 508556 markings/sec, 130 secs
lola: 110558949 markings, 179535973 edges, 580092 markings/sec, 135 secs
lola: 110930017 markings, 180168942 edges, 74214 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F ((p5 <= p11))) AND (p5 <= p11))) AND G ((p8 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p8 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p8 <= p6))
lola: processed formula length: 14
lola: 59 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: 155652 markings, 172037 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p8 <= p11) AND (G ((p6 <= 1)) OR G ((1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p8 <= p11) AND (G ((p6 <= 1)) OR G ((1 <= p11)))))
lola: processed formula length: 55
lola: 59 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: 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: 16391 markings, 22535 edges
lola: ========================================
lola: subprocess 3 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X ((p2 <= p1))) AND G ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X ((p2 <= p1))) AND G ((1 <= p2)))))
lola: processed formula length: 46
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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, 5 edges
lola: ========================================
lola: subprocess 4 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p2 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p2 <= p4)))))
lola: processed formula length: 26
lola: 59 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: 14 markings, 16 edges
lola: ========================================
lola: subprocess 5 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p9 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p9 <= p10)))
lola: processed formula length: 19
lola: 59 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 6 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X ((p2 + 1 <= p1)) OR (p11 + 1 <= p6))) OR (p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X ((p2 + 1 <= p1)) OR (p11 + 1 <= p6))) OR (p8 <= 2)))
lola: processed formula length: 62
lola: 59 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: subprocess 7 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p3 + 1 <= p0))) AND ((p2 + 1 <= p8) AND (F ((p3 <= 2)) OR G ((p2 + 1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 + 1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 + 1 <= p8)
lola: processed formula length: 14
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p3 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p3 + 1 <= p0)))
lola: processed formula length: 22
lola: 59 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p3 <= p2) OR (F ((3 <= p1)) AND (3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p3 <= p2) OR (F ((3 <= p1)) AND (3 <= p1)))))
lola: processed formula length: 53
lola: 59 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: 16373 markings, 22512 edges
lola: ========================================
lola: subprocess 9 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p4 + 1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p4 + 1 <= p6))))
lola: processed formula length: 26
lola: 59 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((3 <= p11)) OR (1 <= p7))) OR (F (G ((X ((3 <= p11)) OR (1 <= p7)))) AND F (G ((p11 + 1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((3 <= p11)) OR (1 <= p7))) OR (F (G ((X ((3 <= p11)) OR (1 <= p7)))) AND F (G ((p11 + 1 <= p0))))))
lola: processed formula length: 110
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 38928 markings, 45075 edges
lola: ========================================
lola: subprocess 11 will run for 1709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= p9)))
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 ((p6 <= p9)))
lola: processed formula length: 18
lola: 59 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 9
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 3419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p7 <= p4)))
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 ((p7 <= p4)))
lola: processed formula length: 18
lola: 59 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: 5685139 markings, 8568683 edges, 1137028 markings/sec, 0 secs
lola: 11259818 markings, 17123447 edges, 1114936 markings/sec, 5 secs
lola: 16730818 markings, 25528451 edges, 1094200 markings/sec, 10 secs
lola: 22431881 markings, 34277092 edges, 1140213 markings/sec, 15 secs
lola: 27272940 markings, 41760859 edges, 968212 markings/sec, 20 secs
lola: 32568976 markings, 49886382 edges, 1059207 markings/sec, 25 secs
lola: 38031532 markings, 58273479 edges, 1092511 markings/sec, 30 secs
lola: 43393155 markings, 66501210 edges, 1072325 markings/sec, 35 secs
lola: 48758507 markings, 74734828 edges, 1073070 markings/sec, 40 secs
lola: 54053522 markings, 82857388 edges, 1059003 markings/sec, 45 secs
lola: 59388369 markings, 91042842 edges, 1066969 markings/sec, 50 secs
lola: 64730869 markings, 99240379 edges, 1068500 markings/sec, 55 secs
lola: 69938596 markings, 107241138 edges, 1041545 markings/sec, 60 secs
lola: 75164502 markings, 115292116 edges, 1045181 markings/sec, 65 secs
lola: 80259024 markings, 123123876 edges, 1018904 markings/sec, 70 secs
lola: 85289658 markings, 130828994 edges, 1006127 markings/sec, 75 secs
lola: 90526457 markings, 138859634 edges, 1047360 markings/sec, 80 secs
lola: 95630330 markings, 146696181 edges, 1020775 markings/sec, 85 secs
lola: 100621491 markings, 154402555 edges, 998232 markings/sec, 90 secs
lola: 104906678 markings, 160932870 edges, 857037 markings/sec, 95 secs
lola: 108183317 markings, 166002983 edges, 655328 markings/sec, 100 secs
lola: 111214878 markings, 170652934 edges, 606312 markings/sec, 105 secs
lola: 115207634 markings, 176798622 edges, 798551 markings/sec, 110 secs
lola: 118367615 markings, 181629405 edges, 631996 markings/sec, 115 secs
lola: 121350391 markings, 186192143 edges, 596555 markings/sec, 120 secs
lola: 125017401 markings, 191823904 edges, 733402 markings/sec, 125 secs
lola: 127633898 markings, 195863729 edges, 523299 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p9 <= p3)) AND ((G ((1 <= p8)) AND (1 <= p10)) OR (X ((1 <= p10)) U (p9 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p9 <= p3)) AND ((G ((1 <= p8)) AND (1 <= p10)) OR (X ((1 <= p10)) U (p9 <= p3))))))
lola: processed formula length: 94
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 17 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: 4447846 markings, 7130541 edges, 889569 markings/sec, 0 secs
lola: 8756514 markings, 14117850 edges, 861734 markings/sec, 5 secs
lola: 13211851 markings, 21351336 edges, 891067 markings/sec, 10 secs
lola: 17415643 markings, 28183707 edges, 840758 markings/sec, 15 secs
lola: 21639644 markings, 35051443 edges, 844800 markings/sec, 20 secs
lola: 25830945 markings, 41861952 edges, 838260 markings/sec, 25 secs
lola: 30620589 markings, 49666580 edges, 957929 markings/sec, 30 secs
lola: 34705150 markings, 56317730 edges, 816912 markings/sec, 35 secs
lola: 38759877 markings, 62914787 edges, 810945 markings/sec, 40 secs
lola: 42639348 markings, 69179596 edges, 775894 markings/sec, 45 secs
lola: 46965627 markings, 76226318 edges, 865256 markings/sec, 50 secs
lola: 51571677 markings, 83714753 edges, 921210 markings/sec, 55 secs
lola: 56192256 markings, 91193318 edges, 924116 markings/sec, 60 secs
lola: 60761585 markings, 98665380 edges, 913866 markings/sec, 65 secs
lola: 65269314 markings, 105965207 edges, 901546 markings/sec, 70 secs
lola: 69946003 markings, 113558510 edges, 935338 markings/sec, 75 secs
lola: 74531506 markings, 121038189 edges, 917101 markings/sec, 80 secs
lola: 79119038 markings, 128443799 edges, 917506 markings/sec, 85 secs
lola: 83625691 markings, 135794099 edges, 901331 markings/sec, 90 secs
lola: 87753666 markings, 142493791 edges, 825595 markings/sec, 95 secs
lola: 90838686 markings, 147500622 edges, 617004 markings/sec, 100 secs
lola: 94195297 markings, 152982278 edges, 671322 markings/sec, 105 secs
lola: 97118693 markings, 157702995 edges, 584679 markings/sec, 110 secs
lola: 100200839 markings, 162703550 edges, 616429 markings/sec, 115 secs
lola: 102811823 markings, 166997745 edges, 522197 markings/sec, 120 secs
lola: 105661634 markings, 171604607 edges, 569962 markings/sec, 125 secs
lola: 108720292 markings, 176564060 edges, 611732 markings/sec, 130 secs
lola: 110954535 markings, 180215653 edges, 446849 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((p7 <= p4)))
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 ((p7 <= p4)))
lola: processed formula length: 18
lola: 59 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: 5935188 markings, 8943652 edges, 1187038 markings/sec, 0 secs
lola: 11340896 markings, 17240991 edges, 1081142 markings/sec, 5 secs
lola: 17115561 markings, 26120892 edges, 1154933 markings/sec, 10 secs
lola: 22683144 markings, 34673822 edges, 1113517 markings/sec, 15 secs
lola: 28157700 markings, 43079866 edges, 1094911 markings/sec, 20 secs
lola: 33631884 markings, 51485326 edges, 1094837 markings/sec, 25 secs
lola: 38984780 markings, 59699278 edges, 1070579 markings/sec, 30 secs
lola: 44217856 markings, 67744194 edges, 1046615 markings/sec, 35 secs
lola: 49465611 markings, 75826735 edges, 1049551 markings/sec, 40 secs
lola: 54603488 markings, 83725757 edges, 1027575 markings/sec, 45 secs
lola: 59857207 markings, 91783113 edges, 1050744 markings/sec, 50 secs
lola: 65086054 markings, 99801198 edges, 1045769 markings/sec, 55 secs
lola: 70230138 markings, 107685443 edges, 1028817 markings/sec, 60 secs
lola: 75317873 markings, 115513652 edges, 1017547 markings/sec, 65 secs
lola: 80336953 markings, 123246923 edges, 1003816 markings/sec, 70 secs
lola: 85255863 markings, 130775634 edges, 983782 markings/sec, 75 secs
lola: 90400317 markings, 138660465 edges, 1028891 markings/sec, 80 secs
lola: 95429539 markings, 146406150 edges, 1005844 markings/sec, 85 secs
lola: 100328386 markings, 153939742 edges, 979769 markings/sec, 90 secs
lola: 104634626 markings, 160540854 edges, 861248 markings/sec, 95 secs
lola: 107080667 markings, 164285833 edges, 489208 markings/sec, 100 secs
lola: 109605230 markings, 168190737 edges, 504913 markings/sec, 105 secs
lola: 112083179 markings, 171968757 edges, 495590 markings/sec, 110 secs
lola: 115164081 markings, 176729855 edges, 616180 markings/sec, 115 secs
lola: 117965837 markings, 180995036 edges, 560351 markings/sec, 120 secs
lola: 120965258 markings, 185635841 edges, 599884 markings/sec, 125 secs
lola: 123778413 markings, 189934782 edges, 562631 markings/sec, 130 secs
lola: 126912005 markings, 194728039 edges, 626718 markings/sec, 135 secs
lola: 129739326 markings, 199108757 edges, 565464 markings/sec, 140 secs
lola: 129741152 markings, 199111642 edges, 365 markings/sec, 145 secs
lola: 129768108 markings, 199154204 edges, 5391 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no yes yes unknown yes no no yes no no
lola:
preliminary result: unknown no no no yes yes unknown yes no no yes no no
lola: memory consumption: 3236 KB
lola: time consumption: 598 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="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 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 r211-tajo-159033476900033"
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 ;