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-159033477700579.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 ShieldPPPt-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.3K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:48 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 19K 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 ShieldPPPt-PT-001B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-001B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591316331294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:18:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 00:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:18:52] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-06-05 00:18:52] [INFO ] Transformed 81 places.
[2020-06-05 00:18:52] [INFO ] Transformed 74 transitions.
[2020-06-05 00:18:52] [INFO ] Found NUPN structural information;
[2020-06-05 00:18:52] [INFO ] Parsed PT model containing 81 places and 74 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100000 steps, including 6 resets, run finished after 120 ms. (steps per millisecond=833 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 74 rows 81 cols
[2020-06-05 00:18:53] [INFO ] Computed 12 place invariants in 5 ms
[2020-06-05 00:18:53] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2020-06-05 00:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:18:53] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-05 00:18:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:18:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 00:18:53] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 00:18:53] [INFO ] Flatten gal took : 47 ms
[2020-06-05 00:18:53] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 00:18:53] [INFO ] Flatten gal took : 8 ms
FORMULA ShieldPPPt-PT-001B-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:18:53] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-05 00:18:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldPPPt-PT-001B @ 3570 seconds

FORMULA ShieldPPPt-PT-001B-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3443
rslt: Output for CTLCardinality @ ShieldPPPt-PT-001B

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 00:18:53 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG(EX((((p35 <= 0)) OR ((1 <= p34)) OR ((p59 <= 0)) OR ((1 <= p51)))))",
"processed_size": 73,
"rewrites": 29
},
"net":
{
"conflict_clusters": 67,
"singleton_clusters": 0
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((((p0 <= 0)) OR ((1 <= p14))))",
"processed_size": 34,
"rewrites": 28
},
"net":
{
"conflict_clusters": 67,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p68 <= 0)) OR ((1 <= p58)))",
"processed_size": 31,
"rewrites": 29
},
"result":
{
"edges": 78,
"markings": 72,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 230,
"markings": 226,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((((1 <= p59)) AND ((p15 <= 0)))))",
"processed_size": 39,
"rewrites": 28
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p79 <= 0)) OR ((1 <= p50)))",
"processed_size": 31,
"rewrites": 31
},
"result":
{
"edges": 103956044,
"markings": 17903046,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1147
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p37 <= 0)) OR ((1 <= p58)))",
"processed_size": 31,
"rewrites": 30
},
"result":
{
"edges": 112,
"markings": 112,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1721
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((AF(((1 <= p23))) AND (((1 <= p26)) OR ((p40 <= 0)) OR ((1 <= p23)))))",
"processed_size": 75,
"rewrites": 29
},
"net":
{
"conflict_clusters": 67,
"singleton_clusters": 0
},
"result":
{
"edges": 307,
"markings": 100,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p62 <= 0))",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 25488,
"runtime": 127.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F((A(F(**)) AND **))) : E(G(E(X(**)))) : E(F(*)) : E(G(E(F(**)))) : E(F(DEADLOCK)) : TRUE : E(F(A(G(*)))) : (E(X(E(G(**)))) AND (E(X(**)) AND (A(F(**)) OR **))) : A(F(*))"
},
"net":
{
"arcs": 184,
"conflict_clusters": 67,
"places": 81,
"places_significant": 69,
"singleton_clusters": 0,
"transitions": 74
},
"result":
{
"preliminary_value": "yes yes yes yes yes yes no no no ",
"value": "yes yes yes yes yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 155/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2592
lola: finding significant places
lola: 81 places, 74 transitions, 69 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: E (F ((A (F (((1 <= p23)))) AND (((1 <= p26)) OR ((p40 <= 0)) OR ((1 <= p23)))))) : E (G (E (X ((((p35 <= 0)) OR ((1 <= p34)) OR ((p59 <= 0)) OR ((1 <= p51))))))) : ((E (((((p31 <= 0)) OR ((1 <= p48))) U (1 <= 0))) OR NOT(A (G ((((p59 <= 0)) OR ((1 <= p15))))))) OR E (((((p76 <= 0)) OR ((1 <= p43))) U (1 <= 0)))) : E (G (E (F (((p62 <= 0)))))) : E (F (A (X ((1 <= 0))))) : E (G (NOT(E (X ((1 <= 0)))))) : NOT(A (G (E (F ((((p79 <= 0)) OR ((1 <= p50)))))))) : ((E (X (E (G ((((p68 <= 0)) OR ((1 <= p58))))))) AND E (X ((((p0 <= 0)) OR ((1 <= p14)))))) AND (A (F ((((p45 <= 0)) OR ((1 <= p46))))) OR (((1 <= p8)) AND ((p55 <= 0))))) : NOT(E (G ((((p37 <= 0)) OR ((1 <= p58))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((((p35 <= 0)) OR ((1 <= p34)) OR ((p59 <= 0)) OR ((1 <= p51)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((((p35 <= 0)) OR ((1 <= p34)) OR ((p59 <= 0)) OR ((1 <= p51)))))
lola: processed formula length: 73
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 42 markings, 42 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((((p68 <= 0)) OR ((1 <= p58))))))) AND (E (X ((((p0 <= 0)) OR ((1 <= p14))))) AND (A (F ((((p45 <= 0)) OR ((1 <= p46))))) OR (((1 <= p8)) AND ((p55 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p0 <= 0)) OR ((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p0 <= 0)) OR ((1 <= p14))))
lola: processed formula length: 34
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((p68 <= 0)) OR ((1 <= p58)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (((p68 <= 0)) OR ((1 <= p58)))
lola: processed formula length: 31
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p68 <= 0)) OR ((1 <= p58)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 72 markings, 78 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 226 markings, 230 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p59)) AND ((p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p59)) AND ((p15 <= 0)))))
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p59)) AND ((p15 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p79)) AND ((p50 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p79 <= 0)) OR ((1 <= p50)))
lola: processed formula length: 31
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p79)) AND ((p50 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p79 <= 0)) OR ((1 <= p50)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-1.sara.
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1376051 markings, 3837489 edges, 275210 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2618207 markings, 7812461 edges, 248431 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3844528 markings, 12108445 edges, 245264 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4971445 markings, 16389960 edges, 225383 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 6018800 markings, 20611489 edges, 209471 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 7010977 markings, 24866863 edges, 198435 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7950993 markings, 29177366 edges, 188003 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8861682 markings, 33564211 edges, 182138 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9741567 markings, 38051816 edges, 175977 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10601381 markings, 42555722 edges, 171963 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11474011 markings, 47207467 edges, 174526 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12318537 markings, 52038545 edges, 168905 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13142773 markings, 56869211 edges, 164847 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 13945926 markings, 61684316 edges, 160631 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 14724148 markings, 66427669 edges, 155644 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 15429636 markings, 71085238 edges, 141098 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 15602769 markings, 74435701 edges, 34627 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 15649580 markings, 77440450 edges, 9362 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 15668076 markings, 80387111 edges, 3699 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 15684055 markings, 83412354 edges, 3196 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 15695092 markings, 86446040 edges, 2207 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 15702714 markings, 89620785 edges, 1524 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 16009245 markings, 93593996 edges, 61306 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 16978075 markings, 98869661 edges, 193766 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 17903046 markings, 103956044 edges
lola: ========================================
lola: subprocess 6 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p37)) AND ((p58 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p37 <= 0)) OR ((1 <= p58)))
lola: processed formula length: 31
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p37)) AND ((p58 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 112 markings, 112 edges
lola: ========================================
lola: subprocess 7 will run for 1721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (((1 <= p23)))) AND (((1 <= p26)) OR ((p40 <= 0)) OR ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF(((1 <= p23))) AND (((1 <= p26)) OR ((p40 <= 0)) OR ((1 <= p23)))))
lola: processed formula length: 75
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 100 markings, 307 edges
lola: ========================================
lola: subprocess 8 will run for 3443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p62 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p62 <= 0))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p62 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p62))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 42 markings, 42 edges

lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no no no
lola:
preliminary result: yes yes yes yes yes yes no no no
lola: memory consumption: 25488 KB
lola: time consumption: 127 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="ShieldPPPt-PT-001B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldPPPt-PT-001B, examination is CTLCardinality"
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-159033477700579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001B.tgz
mv ShieldPPPt-PT-001B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;