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-159033477200265.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 ShieldIIPt-PT-004A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477200265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.2K May 14 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 22K 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 ShieldIIPt-PT-004A-00
FORMULA_NAME ShieldIIPt-PT-004A-01
FORMULA_NAME ShieldIIPt-PT-004A-02
FORMULA_NAME ShieldIIPt-PT-004A-03
FORMULA_NAME ShieldIIPt-PT-004A-04
FORMULA_NAME ShieldIIPt-PT-004A-05
FORMULA_NAME ShieldIIPt-PT-004A-06
FORMULA_NAME ShieldIIPt-PT-004A-07
FORMULA_NAME ShieldIIPt-PT-004A-08
FORMULA_NAME ShieldIIPt-PT-004A-09
FORMULA_NAME ShieldIIPt-PT-004A-10
FORMULA_NAME ShieldIIPt-PT-004A-11
FORMULA_NAME ShieldIIPt-PT-004A-12
FORMULA_NAME ShieldIIPt-PT-004A-13
FORMULA_NAME ShieldIIPt-PT-004A-14
FORMULA_NAME ShieldIIPt-PT-004A-15

=== Now, execution of the tool begins

BK_START 1591295362515

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 18:29:24] [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 18:29:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 18:29:24] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-06-04 18:29:24] [INFO ] Transformed 79 places.
[2020-06-04 18:29:24] [INFO ] Transformed 59 transitions.
[2020-06-04 18:29:24] [INFO ] Found NUPN structural information;
[2020-06-04 18:29:24] [INFO ] Parsed PT model containing 79 places and 59 transitions in 66 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 317 ms. (steps per millisecond=315 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 58 rows 79 cols
[2020-06-04 18:29:24] [INFO ] Computed 37 place invariants in 6 ms
[2020-06-04 18:29:24] [INFO ] [Real]Absence check using 37 positive place invariants in 30 ms returned sat
[2020-06-04 18:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:29:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-04 18:29:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:29:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned unsat
[2020-06-04 18:29:24] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2020-06-04 18:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:29:24] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-04 18:29:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:29:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned unsat
[2020-06-04 18:29:25] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2020-06-04 18:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:29:25] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-04 18:29:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:29:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned unsat
[2020-06-04 18:29:25] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2020-06-04 18:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:29:25] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-04 18:29:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:29:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned unsat
[2020-06-04 18:29:25] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2020-06-04 18:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:29:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-04 18:29:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:29:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
[2020-06-04 18:29:25] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 18:29:25] [INFO ] Flatten gal took : 33 ms
FORMULA ShieldIIPt-PT-004A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 18:29:25] [INFO ] Applying decomposition
[2020-06-04 18:29:25] [INFO ] Flatten gal took : 9 ms
[2020-06-04 18:29:25] [INFO ] Decomposing Gal with order
[2020-06-04 18:29:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 18:29:25] [INFO ] Removed a total of 16 redundant transitions.
[2020-06-04 18:29:25] [INFO ] Flatten gal took : 33 ms
[2020-06-04 18:29:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-06-04 18:29:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 18:29:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-004A @ 3570 seconds

FORMULA ShieldIIPt-PT-004A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3390
rslt: Output for LTLCardinality @ ShieldIIPt-PT-004A

{
"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 18:29:25 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 4,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((((1 <= p52)) AND ((p11 <= 0)) AND (((p43 <= 0)) OR ((1 <= p37)))) R X (G ((((1 <= p43)) AND ((p37 <= 0))))))))",
"processed_size": 119,
"rewrites": 62
},
"result":
{
"edges": 174,
"markings": 173,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G (((((1 <= p10)) U (((1 <= p26)) AND ((p30 <= 0)))) AND X (((1 <= p10))))) AND X (G ((((p50 <= 0)) OR ((1 <= p40)))))))",
"processed_size": 125,
"rewrites": 62
},
"result":
{
"edges": 172,
"markings": 172,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (((1 <= p34)))",
"processed_size": 16,
"rewrites": 62
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p9)) AND ((p6 <= 0)))) AND X (((p25 <= 0))))))",
"processed_size": 64,
"rewrites": 62
},
"result":
{
"edges": 101179998,
"markings": 33613627,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 678
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"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 (G ((X ((((1 <= p73)) AND ((p45 <= 0)))) OR G ((((1 <= p30)) AND ((p11 <= 0)))))))",
"processed_size": 84,
"rewrites": 62
},
"result":
{
"edges": 172,
"markings": 172,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 847
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 10,
"adisj": 5,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((X ((((1 <= p15)) OR ((1 <= p58)))) U (((p32 <= 0)) OR ((1 <= p69)))) OR ((((p32 <= 0)) OR ((1 <= p69))) OR (G ((((1 <= p32)) AND ((p69 <= 0)))) AND F ((((p32 <= 0)) OR ((1 <= p69))))))))",
"processed_size": 195,
"rewrites": 62
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 1130
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X (F ((((1 <= p72)) AND ((p58 <= 0)))))) R ((((1 <= p33)) AND ((p16 <= 0))) R (((1 <= p72)) AND ((p58 <= 0))))))",
"processed_size": 119,
"rewrites": 62
},
"result":
{
"edges": 172,
"markings": 172,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p17)) AND ((p64 <= 0)))))",
"processed_size": 39,
"rewrites": 62
},
"result":
{
"edges": 32,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p43)) AND ((p51 <= 0)))))",
"processed_size": 39,
"rewrites": 62
},
"result":
{
"edges": 68,
"markings": 67,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 30844,
"runtime": 180.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : F(G((* R X(G(*))))) : F((G(((** U **) AND X(**))) AND X(G(**)))) : G(F(*)) : X(**) : F(G((F(*) AND X(*)))) : X(G((X(*) OR G(*)))) : X(((X(**) U **) OR (** OR (G(*) AND F(**))))) : X((X(X(F(*))) R (* R *)))"
},
"net":
{
"arcs": 244,
"conflict_clusters": 31,
"places": 79,
"places_significant": 42,
"singleton_clusters": 0,
"transitions": 58
},
"result":
{
"preliminary_value": "no no no no yes no no yes no ",
"value": "no no no no yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 137/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 58 transitions, 42 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: NOT(G (F ((((p43 <= 0)) OR ((1 <= p51)))))) : F (G (NOT(((((p52 <= 0)) OR ((1 <= p11)) OR (((1 <= p43)) AND ((p37 <= 0)))) U F (X ((((p43 <= 0)) OR ((1 <= p37))))))))) : F ((G (((((1 <= p10)) U (((1 <= p26)) AND ((p30 <= 0)))) AND ((1 <= 0) U X (((1 <= p10)))))) AND G (X ((((p50 <= 0)) OR ((1 <= p40))))))) : NOT(F (G (X ((((p17 <= 0)) OR ((1 <= p64))))))) : (X (((G (((1 <= p34))) U (0 <= 0)) OR ((0 <= 0) U (0 <= 0)))) AND X (((1 <= p34)))) : NOT(G (F (((((p25 <= 0)) U ((1 <= p25))) U ((((p65 <= 0)) OR ((1 <= p47))) U (G ((((p9 <= 0)) OR ((1 <= p6)))) OR X (((1 <= p25))))))))) : G (NOT(X ((X ((((p73 <= 0)) OR ((1 <= p45)))) AND F ((((p30 <= 0)) OR ((1 <= p11)))))))) : X (((X ((((1 <= p15)) OR ((1 <= p58)))) U (((p32 <= 0)) OR ((1 <= p69)))) OR (NOT(F ((((p32 <= 0)) OR ((1 <= p69))))) U (((p32 <= 0)) OR ((1 <= p69)))))) : X (NOT((((1 <= 0) U G (X (X ((((p72 <= 0)) OR ((1 <= p58))))))) U ((((p33 <= 0)) OR ((1 <= p16))) U (((p72 <= 0)) OR ((1 <= p58)))))))
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k: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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((1 <= p52)) AND ((p11 <= 0)) AND (((p43 <= 0)) OR ((1 <= p37)))) R X (G ((((1 <= p43)) AND ((p37 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((1 <= p52)) AND ((p11 <= 0)) AND (((p43 <= 0)) OR ((1 <= p37)))) R X (G ((((1 <= p43)) AND ((p37 <= 0))))))))
lola: processed formula length: 119
lola: 62 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: 173 markings, 174 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((((1 <= p10)) U (((1 <= p26)) AND ((p30 <= 0)))) AND X (((1 <= p10))))) AND X (G ((((p50 <= 0)) OR ((1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((((1 <= p10)) U (((1 <= p26)) AND ((p30 <= 0)))) AND X (((1 <= p10))))) AND X (G ((((p50 <= 0)) OR ((1 <= p40)))))))
lola: processed formula length: 125
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 172 markings, 172 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p34)))
lola: processed formula length: 16
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p9)) AND ((p6 <= 0)))) AND X (((p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p9)) AND ((p6 <= 0)))) AND X (((p25 <= 0))))))
lola: processed formula length: 64
lola: 62 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: 1587488 markings, 3968504 edges, 317498 markings/sec, 0 secs
lola: 2965486 markings, 7720289 edges, 275600 markings/sec, 5 secs
lola: 4400341 markings, 11745985 edges, 286971 markings/sec, 10 secs
lola: 5698807 markings, 15458487 edges, 259693 markings/sec, 15 secs
lola: 6799094 markings, 18649408 edges, 220057 markings/sec, 20 secs
lola: 7847113 markings, 21717185 edges, 209604 markings/sec, 25 secs
lola: 8745303 markings, 24361297 edges, 179638 markings/sec, 30 secs
lola: 9685430 markings, 27144002 edges, 188025 markings/sec, 35 secs
lola: 10572637 markings, 29791825 edges, 177441 markings/sec, 40 secs
lola: 11528207 markings, 32652945 edges, 191114 markings/sec, 45 secs
lola: 12461640 markings, 35458679 edges, 186687 markings/sec, 50 secs
lola: 13391677 markings, 38271650 edges, 186007 markings/sec, 55 secs
lola: 14355714 markings, 41200483 edges, 192807 markings/sec, 60 secs
lola: 15297728 markings, 44064437 edges, 188403 markings/sec, 65 secs
lola: 16236419 markings, 46936724 edges, 187738 markings/sec, 70 secs
lola: 17197044 markings, 49867170 edges, 192125 markings/sec, 75 secs
lola: 18085658 markings, 52594225 edges, 177723 markings/sec, 80 secs
lola: 18962911 markings, 55293157 edges, 175451 markings/sec, 85 secs
lola: 19846719 markings, 58013484 edges, 176762 markings/sec, 90 secs
lola: 20766071 markings, 60857525 edges, 183870 markings/sec, 95 secs
lola: 21654481 markings, 63622773 edges, 177682 markings/sec, 100 secs
lola: 22489408 markings, 66213008 edges, 166985 markings/sec, 105 secs
lola: 23300241 markings, 68739547 edges, 162167 markings/sec, 110 secs
lola: 24119833 markings, 71297428 edges, 163918 markings/sec, 115 secs
lola: 24952712 markings, 73894931 edges, 166576 markings/sec, 120 secs
lola: 25754116 markings, 76404208 edges, 160281 markings/sec, 125 secs
lola: 26544281 markings, 78879083 edges, 158033 markings/sec, 130 secs
lola: 27327652 markings, 81338684 edges, 156674 markings/sec, 135 secs
lola: 28187200 markings, 84043219 edges, 171910 markings/sec, 140 secs
lola: 29072362 markings, 86826077 edges, 177032 markings/sec, 145 secs
lola: 29920573 markings, 89497620 edges, 169642 markings/sec, 150 secs
lola: 30820036 markings, 92337791 edges, 179893 markings/sec, 155 secs
lola: 31718902 markings, 95172962 edges, 179773 markings/sec, 160 secs
lola: 32615745 markings, 98016812 edges, 179369 markings/sec, 165 secs
lola: 33460645 markings, 100696688 edges, 168980 markings/sec, 170 secs
lola: add low 22
lola: add low 43
lola: add low 11
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: 33613627 markings, 101179998 edges
lola: ========================================
lola: subprocess 4 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((((1 <= p73)) AND ((p45 <= 0)))) OR G ((((1 <= p30)) AND ((p11 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((((1 <= p73)) AND ((p45 <= 0)))) OR G ((((1 <= p30)) AND ((p11 <= 0)))))))
lola: processed formula length: 84
lola: 62 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: 172 markings, 172 edges
lola: ========================================
lola: subprocess 5 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X ((((1 <= p15)) OR ((1 <= p58)))) U (((p32 <= 0)) OR ((1 <= p69)))) OR ((((p32 <= 0)) OR ((1 <= p69))) OR (G ((((1 <= p32)) AND ((p69 <= 0)))) AND F ((((p32 <= 0)) OR ((1 <= p69))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X ((((1 <= p15)) OR ((1 <= p58)))) U (((p32 <= 0)) OR ((1 <= p69)))) OR ((((p32 <= 0)) OR ((1 <= p69))) OR (G ((((1 <= p32)) AND ((p69 <= 0)))) AND F ((((p32 <= 0)) OR ((1 <= p69))))))))
lola: processed formula length: 195
lola: 62 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: 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 1130 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (F ((((1 <= p72)) AND ((p58 <= 0)))))) R ((((1 <= p33)) AND ((p16 <= 0))) R (((1 <= p72)) AND ((p58 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (F ((((1 <= p72)) AND ((p58 <= 0)))))) R ((((1 <= p33)) AND ((p16 <= 0))) R (((1 <= p72)) AND ((p58 <= 0))))))
lola: processed formula length: 119
lola: 62 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: 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: 172 markings, 172 edges
lola: ========================================
lola: subprocess 7 will run for 1695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p17)) AND ((p64 <= 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 ((((1 <= p17)) AND ((p64 <= 0)))))
lola: processed formula length: 39
lola: 62 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: 31 markings, 32 edges
lola: ========================================
lola: subprocess 8 will run for 3390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p43)) AND ((p51 <= 0)))))
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 <= p43)) AND ((p51 <= 0)))))
lola: processed formula length: 39
lola: 62 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: 67 markings, 68 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes no
lola:
preliminary result: no no no no yes no no yes no
lola: memory consumption: 30844 KB
lola: time consumption: 180 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="ShieldIIPt-PT-004A"
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 ShieldIIPt-PT-004A, 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-159033477200265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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