Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334600149.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudDeployment-PT-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 156K May 5 16:51 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 CloudDeployment-PT-4a-00
FORMULA_NAME CloudDeployment-PT-4a-01
FORMULA_NAME CloudDeployment-PT-4a-02
FORMULA_NAME CloudDeployment-PT-4a-03
FORMULA_NAME CloudDeployment-PT-4a-04
FORMULA_NAME CloudDeployment-PT-4a-05
FORMULA_NAME CloudDeployment-PT-4a-06
FORMULA_NAME CloudDeployment-PT-4a-07
FORMULA_NAME CloudDeployment-PT-4a-08
FORMULA_NAME CloudDeployment-PT-4a-09
FORMULA_NAME CloudDeployment-PT-4a-10
FORMULA_NAME CloudDeployment-PT-4a-11
FORMULA_NAME CloudDeployment-PT-4a-12
FORMULA_NAME CloudDeployment-PT-4a-13
FORMULA_NAME CloudDeployment-PT-4a-14
FORMULA_NAME CloudDeployment-PT-4a-15

=== Now, execution of the tool begins

BK_START 1620900036689

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 10:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:00:39] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-13 10:00:39] [INFO ] Transformed 141 places.
[2021-05-13 10:00:39] [INFO ] Transformed 475 transitions.
[2021-05-13 10:00:39] [INFO ] Found NUPN structural information;
[2021-05-13 10:00:39] [INFO ] Parsed PT model containing 141 places and 475 transitions in 114 ms.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1650 resets, run finished after 247 ms. (steps per millisecond=404 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1]
[2021-05-13 10:00:39] [INFO ] Flow matrix only has 226 transitions (discarded 197 similar events)
// Phase 1: matrix 226 rows 141 cols
[2021-05-13 10:00:39] [INFO ] Computed 24 place invariants in 7 ms
[2021-05-13 10:00:40] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-13 10:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:40] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-13 10:00:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:40] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 80 ms returned unsat
[2021-05-13 10:00:40] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-13 10:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:40] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-13 10:00:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:40] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 32 ms returned unsat
[2021-05-13 10:00:41] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 60 ms returned sat
[2021-05-13 10:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:41] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2021-05-13 10:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:41] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 137 ms returned sat
[2021-05-13 10:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:41] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-13 10:00:41] [INFO ] State equation strengthened by 90 read => feed constraints.
[2021-05-13 10:00:41] [INFO ] [Nat]Added 90 Read/Feed constraints in 65 ms returned sat
[2021-05-13 10:00:41] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 70 ms.
[2021-05-13 10:00:42] [INFO ] Added : 141 causal constraints over 29 iterations in 652 ms. Result :sat
[2021-05-13 10:00:42] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 90 ms returned sat
[2021-05-13 10:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:42] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-13 10:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:42] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 120 ms returned sat
[2021-05-13 10:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:43] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-13 10:00:43] [INFO ] [Nat]Added 90 Read/Feed constraints in 21 ms returned sat
[2021-05-13 10:00:43] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 24 ms.
[2021-05-13 10:00:43] [INFO ] Added : 152 causal constraints over 31 iterations in 489 ms. Result :sat
[2021-05-13 10:00:43] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 161 ms returned sat
[2021-05-13 10:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:44] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2021-05-13 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:44] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
[2021-05-13 10:00:44] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-13 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:44] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-13 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:44] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2021-05-13 10:00:44] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-13 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:44] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-13 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:44] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2021-05-13 10:00:44] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-13 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:45] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2021-05-13 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:45] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 29 ms returned sat
[2021-05-13 10:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:45] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2021-05-13 10:00:46] [INFO ] [Nat]Added 90 Read/Feed constraints in 27 ms returned sat
[2021-05-13 10:00:46] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 21 ms.
[2021-05-13 10:00:47] [INFO ] Added : 155 causal constraints over 33 iterations in 1027 ms. Result :sat
[2021-05-13 10:00:47] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-13 10:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:47] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-13 10:00:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:47] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2021-05-13 10:00:47] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-13 10:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:47] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-13 10:00:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:47] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 30 ms returned unsat
[2021-05-13 10:00:47] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-13 10:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:47] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-13 10:00:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:47] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2021-05-13 10:00:47] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-13 10:00:47] [INFO ] Flatten gal took : 76 ms
FORMULA CloudDeployment-PT-4a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:00:47] [INFO ] Applying decomposition
[2021-05-13 10:00:47] [INFO ] Flatten gal took : 25 ms
[2021-05-13 10:00:47] [INFO ] Decomposing Gal with order
[2021-05-13 10:00:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 10:00:47] [INFO ] Removed a total of 951 redundant transitions.
[2021-05-13 10:00:48] [INFO ] Flatten gal took : 76 ms
[2021-05-13 10:00:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 11 ms.
[2021-05-13 10:00:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 10:00:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudDeployment-PT-4a @ 3570 seconds

FORMULA CloudDeployment-PT-4a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ CloudDeployment-PT-4a

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p72 <= 0))",
"processed_size": 12,
"rewrites": 31
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((p64 <= 0)) OR ((1 <= p93)))))",
"processed_size": 39,
"rewrites": 29
},
"result":
{
"edges": 89449,
"markings": 8823,
"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": "stabilization",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p109)) AND ((p140 <= 0)))",
"processed_size": 33,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G (((1 <= p70))))",
"processed_size": 20,
"rewrites": 29
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((p63 <= 0)) OR ((1 <= p61)))))",
"processed_size": 39,
"rewrites": 29
},
"result":
{
"edges": 5909,
"markings": 686,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((((p110 <= 0)) OR ((1 <= p109)))))",
"processed_size": 41,
"rewrites": 29
},
"result":
{
"edges": 42413,
"markings": 3563,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((((p57 <= 0)) OR ((1 <= p4))))",
"processed_size": 34,
"rewrites": 29
},
"result":
{
"edges": 1932168,
"markings": 127162,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30492,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F(G(**)) : (F(**) AND (* R X(*))) : (G(**) AND (F(G(**)) OR (** OR **))) : (X(F(**)) OR F(G(**))) : (G(**) OR (X(G(*)) AND (** AND **))) : G(F(**))"
},
"net":
{
"arcs": 2481,
"conflict_clusters": 36,
"places": 141,
"places_significant": 117,
"singleton_clusters": 0,
"transitions": 423
},
"result":
{
"preliminary_value": "no no no no yes no no ",
"value": "no no 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: 564/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 423 transitions, 117 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: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: F (X (G (X ((((p63 <= 0)) OR ((1 <= p61))))))) : G ((G (F (G (((1 <= p70))))) OR (G (((p70 <= 0))) U (1 <= 0)))) : (F (((1 <= p72))) AND NOT(((((p14 <= 0)) OR ((1 <= p9))) U X (((1 <= p72)))))) : (G ((((p57 <= 0)) OR ((1 <= p4)))) AND ((F (G ((((p57 <= 0)) OR ((1 <= p4))))) OR ((p57 <= 0))) OR ((1 <= p4)))) : (F (X ((((p114 <= 0)) OR ((1 <= p64))))) OR X (F (G ((((p64 <= 0)) OR ((1 <= p93))))))) : (G (((p44 <= 0))) OR ((NOT(X (F ((((p133 <= 0)) OR ((1 <= p46)))))) AND ((1 <= p109))) AND ((p140 <= 0)))) : G (X (G (((((1 <= p52)) U (0 <= 0)) U (((p110 <= 0)) OR ((1 <= p109)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p72))) AND ((((1 <= p14)) AND ((p9 <= 0))) R X (((p72 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p72)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p72 <= 0))
lola: processed formula length: 12
lola: 31 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p114 <= 0)) OR ((1 <= p64))))) OR F (G ((((p64 <= 0)) OR ((1 <= p93))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p64 <= 0)) OR ((1 <= p93)))))
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 ((((p64 <= 0)) OR ((1 <= p93)))))
lola: processed formula length: 39
lola: 29 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: 8823 markings, 89449 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p114 <= 0)) OR ((1 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p114 <= 0)) OR ((1 <= p64)))))
lola: processed formula length: 40
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p44 <= 0))) OR (X (G ((((1 <= p133)) AND ((p46 <= 0))))) AND (((1 <= p109)) AND ((p140 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p109)) AND ((p140 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p109)) AND ((p140 <= 0)))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p44 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p44 <= 0)))
lola: processed formula length: 16
lola: 29 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: 48 markings, 152 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p70))))
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 <= p70))))
lola: processed formula length: 20
lola: 29 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p63 <= 0)) OR ((1 <= p61)))))
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 ((((p63 <= 0)) OR ((1 <= p61)))))
lola: processed formula length: 39
lola: 29 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: 686 markings, 5909 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p110 <= 0)) OR ((1 <= p109)))))
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 ((((p110 <= 0)) OR ((1 <= p109)))))
lola: processed formula length: 41
lola: 29 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: 3563 markings, 42413 edges
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p57 <= 0)) OR ((1 <= p4)))) AND (F (G ((((p57 <= 0)) OR ((1 <= p4))))) OR (((p57 <= 0)) OR ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p57 <= 0)) OR ((1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p57 <= 0)) OR ((1 <= p4))))
lola: processed formula length: 34
lola: 29 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: ========================================
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: 127162 markings, 1932168 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no
lola:
preliminary result: no no no no yes no no
lola: memory consumption: 30492 KB
lola: time consumption: 5 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="CloudDeployment-PT-4a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is CloudDeployment-PT-4a, 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 r056-oct2-162038334600149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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