Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r172-smll-158987827700331.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Referendum-COL-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-158987827700331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.7K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 08:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.5K Mar 24 05:38 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 Referendum-COL-0010-CTLCardinality-00
FORMULA_NAME Referendum-COL-0010-CTLCardinality-01
FORMULA_NAME Referendum-COL-0010-CTLCardinality-02
FORMULA_NAME Referendum-COL-0010-CTLCardinality-03
FORMULA_NAME Referendum-COL-0010-CTLCardinality-04
FORMULA_NAME Referendum-COL-0010-CTLCardinality-05
FORMULA_NAME Referendum-COL-0010-CTLCardinality-06
FORMULA_NAME Referendum-COL-0010-CTLCardinality-07
FORMULA_NAME Referendum-COL-0010-CTLCardinality-08
FORMULA_NAME Referendum-COL-0010-CTLCardinality-09
FORMULA_NAME Referendum-COL-0010-CTLCardinality-10
FORMULA_NAME Referendum-COL-0010-CTLCardinality-11
FORMULA_NAME Referendum-COL-0010-CTLCardinality-12
FORMULA_NAME Referendum-COL-0010-CTLCardinality-13
FORMULA_NAME Referendum-COL-0010-CTLCardinality-14
FORMULA_NAME Referendum-COL-0010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591391909814

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 21:18:32] [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 21:18:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 21:18:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-05 21:18:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 929 ms
[2020-06-05 21:18:33] [INFO ] sort/places :
Voters->voted_no,voted_yes,voting,
Dot->ready,

[2020-06-05 21:18:33] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 31 PT places and 21.0 transition bindings in 14 ms.
[2020-06-05 21:18:33] [INFO ] Computed order based on color domains.
[2020-06-05 21:18:33] [INFO ] Unfolded HLPN to a Petri net with 31 places and 21 transitions in 5 ms.
[2020-06-05 21:18:33] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 743 ms. (steps per millisecond=134 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 21 rows 31 cols
[2020-06-05 21:18:34] [INFO ] Computed 10 place invariants in 4 ms
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
[2020-06-05 21:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-06-05 21:18:35] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-06-05 21:18:35] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-05 21:18:35] [INFO ] Flatten gal took : 41 ms
[2020-06-05 21:18:35] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 21:18:35] [INFO ] Flatten gal took : 18 ms
FORMULA Referendum-COL-0010-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 21:18:35] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-05 21:18:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Referendum-COL-0010 @ 3570 seconds

FORMULA Referendum-COL-0010-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ Referendum-COL-0010

{
"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",
"--safe",
"--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 21:18:36 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)",
"processed_size": 111,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "AF(AX((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0)))",
"processed_size": 77,
"rewrites": 19
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 393661,
"markings": 59050,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AX(EG((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))",
"processed_size": 119,
"rewrites": 19
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AX(((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0) AND ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))",
"processed_size": 266,
"rewrites": 18
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (G (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))",
"processed_size": 121,
"rewrites": 18
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "EG(AF(((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))",
"processed_size": 191,
"rewrites": 19
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 203,
"markings": 137,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AF((EG((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND AG((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))",
"processed_size": 203,
"rewrites": 20
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 39,
"markings": 12,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "(F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0)) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))",
"processed_size": 129,
"rewrites": 19
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 18568,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : ** : A(X(**)) : A(X(A(G(*)))) : A(F(A(X(**)))) : A((A(F(**)) U **)) : A(X(E(G(**)))) : E(G(A(F(**)))) : TRUE : A(F((E(G(**)) AND A(G(**)))))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 31,
"places": 31,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 21
},
"result":
{
"preliminary_value": "yes yes yes yes yes no yes yes yes no ",
"value": "yes yes yes yes yes no yes yes 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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 31
lola: finding significant places
lola: 31 places, 21 transitions, 21 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: E (G (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) : ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND E (G ((0 <= 0)))) : (E (G (A (X ((0 <= 0))))) AND A (X (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0) AND ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))))) : A (X (NOT(E (F ((1 <= p0)))))) : A (F (A (X ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0))))) : A ((A (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))) : A (X (E (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))) : E (G (A (F (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))) : E (F (E (G ((0 <= 0))))) : A (F ((E (G ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND A (G ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)
lola: processed formula length: 111
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 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: 17 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 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 20 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is invariant from successors.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p0)))
lola: processed formula length: 77
lola: 19 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: 59050 markings, 393661 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))
lola: processed formula length: 119
lola: 19 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0) AND ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0) AND ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))
lola: processed formula length: 266
lola: 18 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 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
lola: processed formula length: 121
lola: 18 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0) OR (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
lola: processed formula length: 191
lola: 19 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: 137 markings, 203 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND A (G ((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND AG((2 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))
lola: processed formula length: 203
lola: 20 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12 markings, 39 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0)) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))
lola: processed formula length: 129
lola: 19 rewrites
lola: closed formula file CTLCardinality.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 12 markings, 12 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes yes yes no
lola:
preliminary result: yes yes yes yes yes no yes yes yes no
lola: memory consumption: 18568 KB
lola: time consumption: 3 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="Referendum-COL-0010"
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 Referendum-COL-0010, 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 r172-smll-158987827700331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0010.tgz
mv Referendum-COL-0010 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 ;