fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913500187
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.700 3600000.00 842442.00 273.80 FTTFTFFTFTFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913500187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is BridgeAndVehicles-COL-V20P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913500187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 41K Mar 24 05:37 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 BridgeAndVehicles-COL-V20P20N50-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591131857309

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:04:19] [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-02 21:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:04:19] [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-02 21:04:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2020-06-02 21:04:20] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-06-02 21:04:20] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 39 ms.
[2020-06-02 21:04:20] [INFO ] Computed order based on color domains.
[2020-06-02 21:04:20] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions in 41 ms.
[2020-06-02 21:04:20] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 94 ms.
Incomplete random walk after 100000 steps, including 577 resets, run finished after 778 ms. (steps per millisecond=128 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1]
[2020-06-02 21:04:21] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-02 21:04:21] [INFO ] Computed 7 place invariants in 10 ms
[2020-06-02 21:04:21] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-06-02 21:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:21] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-06-02 21:04:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:04:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 21:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:21] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2020-06-02 21:04:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-02 21:04:21] [INFO ] [Nat]Added 102 Read/Feed constraints in 27 ms returned sat
[2020-06-02 21:04:21] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 225 ms.
[2020-06-02 21:04:37] [INFO ] Added : 217 causal constraints over 51 iterations in 15496 ms. Result :unknown
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 21:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:37] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-02 21:04:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:04:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 31 ms returned sat
[2020-06-02 21:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:04:38] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2020-06-02 21:04:38] [INFO ] [Nat]Added 102 Read/Feed constraints in 22 ms returned sat
[2020-06-02 21:04:38] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 177 ms.
[2020-06-02 21:04:41] [INFO ] Added : 178 causal constraints over 36 iterations in 3300 ms. Result :sat
[2020-06-02 21:04:41] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 21:04:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-02 21:04:41] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 21:04:41] [INFO ] Flatten gal took : 261 ms
[2020-06-02 21:04:42] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 21:04:42] [INFO ] Flatten gal took : 253 ms
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 21:04:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2020-06-02 21:04:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 41 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BridgeAndVehicles-COL-V20P20N50 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2787
rslt: Output for CTLCardinality @ BridgeAndVehicles-COL-V20P20N50

{
"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": "Tue Jun 2 21:04:42 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"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": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "EF(AX(((p50 <= 1) AND (p49 <= p53 + p54))))",
"processed_size": 43,
"rewrites": 23
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 22,
"markings": 23,
"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": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "AF(EX(((p51 + p52 <= p47) AND (p49 <= 1))))",
"processed_size": 43,
"rewrites": 23
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 23812047,
"markings": 7503691,
"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": 428
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p48 <= p23) AND (p53 + p54 <= p23))))",
"processed_size": 45,
"rewrites": 23
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 489
},
"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": 24
},
"result":
{
"edges": 167,
"markings": 168,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 571
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p51 + p52 <= 0)",
"processed_size": 16,
"rewrites": 24
},
"result":
{
"edges": 164,
"markings": 165,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 685
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "AF(EG((p47 <= 1)))",
"processed_size": 18,
"rewrites": 23
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 857
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG(((p0 <= p53 + p54) OR EF((p48 <= p22))))",
"processed_size": 43,
"rewrites": 23
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 47372976,
"markings": 9792342,
"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": 1112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "E (((p23 <= p22) R (p22 <= p24)))",
"processed_size": 33,
"rewrites": 24
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((p23 <= 1) R ((p50 + 1 <= p23) OR (p51 + p52 + 1 <= p24))))",
"processed_size": 64,
"rewrites": 26
},
"result":
{
"edges": 83,
"markings": 84,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3335
},
"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": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(DEADLOCK AND (1 <= p51 + p52))",
"processed_size": 31,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(DEADLOCK AND (1 <= p51 + p52))",
"processed_size": 31,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p24)",
"processed_size": 10,
"rewrites": 25
},
"result":
{
"edges": 15673223,
"markings": 4673923,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 82004,
"runtime": 783.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : (A(G(A(F(**)))) OR (DEADLOCK AND **)) : A(G((** OR E(F(**))))) : A((* R *)) : A(F(E(G(*)))) : E(F(A(X(**)))) : E((* R *)) : A(G(**)) : A(F(*)) : NODEADLOCK : A(F(E(X(**))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no yes yes no yes yes yes no no yes yes ",
"value": "no yes yes no yes yes yes no no yes yes "
},
"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: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 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: A (G (E (F ((p51 + p52 <= 0))))) : (A (G (A (F ((p24 <= 1))))) OR (A (X ((1 <= 0))) AND (1 <= p51 + p52))) : A (G (((p0 <= p53 + p54) OR E (F ((p48 <= p22)))))) : NOT(E (((2 <= p23) U ((p23 <= p50) AND (p24 <= p51 + p52))))) : A (F (NOT(A (F ((2 <= p47)))))) : E (F (A (X (((p50 <= 1) AND (p49 <= p53 + p54)))))) : NOT(A (((p22 + 1 <= p23) U (p24 + 1 <= p22)))) : E (G (A (G (((p48 <= p23) AND (p53 + p54 <= p23)))))) : NOT(E (G ((1 <= p0)))) : E (X (E (G ((0 <= 0))))) : A (F (E (X (((p51 + p52 <= p47) AND (p49 <= 1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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: 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:130
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 21 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 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p50 <= 1) AND (p49 <= p53 + p54))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p50 <= 1) AND (p49 <= p53 + p54))))
lola: processed formula length: 43
lola: 23 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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 2 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((p51 + p52 <= p47) AND (p49 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((p51 + p52 <= p47) AND (p49 <= 1))))
lola: processed formula length: 43
lola: 23 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: 387623 markings, 999442 edges, 77525 markings/sec, 0 secs
lola: 759537 markings, 2088411 edges, 74383 markings/sec, 5 secs
lola: 1125876 markings, 3218679 edges, 73268 markings/sec, 10 secs
lola: 1491552 markings, 4353906 edges, 73135 markings/sec, 15 secs
lola: 1858558 markings, 5501839 edges, 73401 markings/sec, 20 secs
lola: 2226701 markings, 6651198 edges, 73629 markings/sec, 25 secs
lola: 2603621 markings, 7818659 edges, 75384 markings/sec, 30 secs
lola: 2968207 markings, 8929503 edges, 72917 markings/sec, 35 secs
lola: 3319253 markings, 10140170 edges, 70209 markings/sec, 40 secs
lola: 3689714 markings, 11284919 edges, 74092 markings/sec, 45 secs
lola: 4032442 markings, 12445468 edges, 68546 markings/sec, 50 secs
lola: 4407560 markings, 13609997 edges, 75024 markings/sec, 55 secs
lola: 4745804 markings, 14758756 edges, 67649 markings/sec, 60 secs
lola: 5121852 markings, 15910349 edges, 75210 markings/sec, 65 secs
lola: 5473241 markings, 17125595 edges, 70278 markings/sec, 70 secs
lola: 5851194 markings, 18232651 edges, 75591 markings/sec, 75 secs
lola: 6210438 markings, 19513672 edges, 71849 markings/sec, 80 secs
lola: 6573237 markings, 20622965 edges, 72560 markings/sec, 85 secs
lola: 6931233 markings, 21823660 edges, 71599 markings/sec, 90 secs
lola: 7282661 markings, 23054803 edges, 70286 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7503691 markings, 23812047 edges
lola: ========================================
lola: subprocess 3 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p48 <= p23) AND (p53 + p54 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p48 <= p23) AND (p53 + p54 <= p23))))
lola: processed formula length: 45
lola: 23 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: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
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: ((p23 + 1 <= p48) OR (p23 + 1 <= p53 + p54))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: subprocess 4 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p0 <= 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: (1 <= p0)
lola: processed formula length: 9
lola: 24 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: ========================================
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: (p0 <= 0)
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 168 markings, 167 edges
lola: subprocess 5 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p51 + p52 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p51 + p52 <= 0)
lola: processed formula length: 16
lola: 24 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: ========================================
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 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: (p51 + p52 <= 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 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 <= p51 + p52)
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: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 165 markings, 164 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.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.
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: subprocess 6 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p47 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p47 <= 1)))
lola: processed formula length: 18
lola: 23 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 7 will run for 857 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 <= p53 + p54) OR E (F ((p48 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((p0 <= p53 + p54) OR EF((p48 <= p22))))
lola: processed formula length: 43
lola: 23 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).
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: 616346 markings, 2733492 edges, 123269 markings/sec, 0 secs
lola: 1214980 markings, 5468437 edges, 119727 markings/sec, 5 secs
lola: 1784761 markings, 8161017 edges, 113956 markings/sec, 10 secs
lola: 2351588 markings, 10806244 edges, 113365 markings/sec, 15 secs
lola: 2906424 markings, 13462321 edges, 110967 markings/sec, 20 secs
lola: 3444750 markings, 16036475 edges, 107665 markings/sec, 25 secs
lola: 3981705 markings, 18657867 edges, 107391 markings/sec, 30 secs
lola: 4513661 markings, 21267286 edges, 106391 markings/sec, 35 secs
lola: 5034910 markings, 23791251 edges, 104250 markings/sec, 40 secs
lola: 5567965 markings, 26353863 edges, 106611 markings/sec, 45 secs
lola: 6082742 markings, 28914776 edges, 102955 markings/sec, 50 secs
lola: 6580014 markings, 31353879 edges, 99454 markings/sec, 55 secs
lola: 7094901 markings, 33919664 edges, 102977 markings/sec, 60 secs
lola: 7594880 markings, 36367036 edges, 99996 markings/sec, 65 secs
lola: 8107675 markings, 38957979 edges, 102559 markings/sec, 70 secs
lola: 8598919 markings, 41380175 edges, 98249 markings/sec, 75 secs
lola: 9095874 markings, 43888873 edges, 99391 markings/sec, 80 secs
lola: 9599565 markings, 46428532 edges, 100738 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9792342 markings, 47372976 edges
lola: ========================================
lola: subprocess 8 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p23 <= p22) R (p22 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((p23 <= p22) R (p22 <= p24)))
lola: processed formula length: 33
lola: 24 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p24 + 1 <= p22)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 121 markings, 120 edges
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-0.sara.
lola: ========================================
lola: subprocess 9 will run for 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p23 <= 1) R ((p50 + 1 <= p23) OR (p51 + p52 + 1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p23 <= 1) R ((p50 + 1 <= p23) OR (p51 + p52 + 1 <= p24))))
lola: processed formula length: 64
lola: 26 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: ((p23 <= p50) AND (p24 <= p51 + p52))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 84 markings, 83 edges
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: ========================================
lola: subprocess 10 will run for 3335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p24 <= 1))))) OR (DEADLOCK AND (1 <= p51 + p52)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND (1 <= p51 + p52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (DEADLOCK AND (1 <= p51 + p52))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p24 <= 1))))) OR (DEADLOCK AND (1 <= p51 + p52)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND (1 <= p51 + p52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (DEADLOCK AND (1 <= p51 + p52))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: ========================================
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: ...considering subproblem: A (G (A (F ((p24 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= p24)
lola: processed formula length: 10
lola: 25 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 /EFEG)
lola: state space: using reachability graph (EFEG 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: 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: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p24)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
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: (p24 <= 1)
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-12-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: sara is running 0 secs || sara is running 0 secs || 32630 markings, 73838 edges, 6526 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 78376 markings, 210157 edges, 9149 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 124623 markings, 360815 edges, 9249 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 170304 markings, 509611 edges, 9136 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 216123 markings, 657603 edges, 9164 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 262467 markings, 810050 edges, 9269 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 305915 markings, 953544 edges, 8690 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 351476 markings, 1101408 edges, 9112 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 394326 markings, 1242930 edges, 8570 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 440177 markings, 1391308 edges, 9170 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 483429 markings, 1535533 edges, 8650 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 529491 markings, 1683615 edges, 9212 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 571775 markings, 1825813 edges, 8457 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 616615 markings, 1969447 edges, 8968 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 661033 markings, 2116845 edges, 8884 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 704963 markings, 2263487 edges, 8786 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 747641 markings, 2403604 edges, 8536 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 791976 markings, 2551704 edges, 8867 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 834426 markings, 2692716 edges, 8490 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 877520 markings, 2835627 edges, 8619 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 921000 markings, 2979958 edges, 8696 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 964227 markings, 3124321 edges, 8645 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 1007328 markings, 3267933 edges, 8620 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 1047938 markings, 3408060 edges, 8122 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 1094887 markings, 3558823 edges, 9390 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 1139126 markings, 3705787 edges, 8848 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 1182369 markings, 3852469 edges, 8649 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 1224596 markings, 3996136 edges, 8445 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 1267750 markings, 4138819 edges, 8631 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 1312751 markings, 4285875 edges, 9000 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 1355352 markings, 4428316 edges, 8520 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 1398600 markings, 4574587 edges, 8650 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 1439997 markings, 4711448 edges, 8279 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 1486809 markings, 4870644 edges, 9362 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 1531556 markings, 5020349 edges, 8949 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 1572222 markings, 5158080 edges, 8133 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 1614020 markings, 5298700 edges, 8360 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 1657550 markings, 5443397 edges, 8706 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 1699420 markings, 5587365 edges, 8374 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 1745711 markings, 5741101 edges, 9258 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 1790280 markings, 5886815 edges, 8914 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 1830655 markings, 6027017 edges, 8075 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 1875084 markings, 6177843 edges, 8886 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 1912029 markings, 6308538 edges, 7389 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 1958929 markings, 6459551 edges, 9380 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 2006419 markings, 6613653 edges, 9498 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 2048825 markings, 6758284 edges, 8481 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 2089767 markings, 6896428 edges, 8188 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 2127404 markings, 7032625 edges, 7527 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 2170456 markings, 7169571 edges, 8610 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 2212834 markings, 7318695 edges, 8476 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 2257549 markings, 7465090 edges, 8943 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 2303947 markings, 7619113 edges, 9280 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 2347746 markings, 7768801 edges, 8760 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 2387837 markings, 7902353 edges, 8018 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 2429422 markings, 8043152 edges, 8317 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 2467563 markings, 8181764 edges, 7628 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 2509474 markings, 8314658 edges, 8382 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 2554371 markings, 8470459 edges, 8979 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 2601418 markings, 8627623 edges, 9409 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 2647405 markings, 8779896 edges, 9197 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 2688773 markings, 8919476 edges, 8274 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 2731588 markings, 9062294 edges, 8563 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 2768752 markings, 9201659 edges, 7433 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 2810485 markings, 9333194 edges, 8347 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 2850922 markings, 9471623 edges, 8087 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 2896056 markings, 9628222 edges, 9027 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 2947160 markings, 9795792 edges, 10221 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 2989525 markings, 9938400 edges, 8473 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 3034474 markings, 10089402 edges, 8990 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 3073440 markings, 10229575 edges, 7793 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 3115822 markings, 10369563 edges, 8476 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 3157866 markings, 10516616 edges, 8409 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 3198077 markings, 10654872 edges, 8042 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 3237649 markings, 10790179 edges, 7914 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 3284168 markings, 10942731 edges, 9304 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 3334457 markings, 11107489 edges, 10058 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 3379222 markings, 11254928 edges, 8953 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 3421625 markings, 11404376 edges, 8481 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 3461697 markings, 11539965 edges, 8014 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 3500721 markings, 11682318 edges, 7805 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 3541962 markings, 11823265 edges, 8248 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 3581735 markings, 11961326 edges, 7955 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 3620083 markings, 12096022 edges, 7670 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 3661972 markings, 12230805 edges, 8378 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 3709283 markings, 12342097 edges, 9462 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 3762084 markings, 12431151 edges, 10560 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 3806686 markings, 12558090 edges, 8920 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 3852520 markings, 12741207 edges, 9167 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 3901644 markings, 12934342 edges, 9825 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 3951161 markings, 13128104 edges, 9903 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 3998679 markings, 13313448 edges, 9504 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 4035395 markings, 13452093 edges, 7343 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 4063136 markings, 13565049 edges, 5548 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 4094145 markings, 13678654 edges, 6202 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 4119668 markings, 13785356 edges, 5105 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 4152694 markings, 13906027 edges, 6605 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 4206070 markings, 13998599 edges, 10675 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 4258133 markings, 14085977 edges, 10413 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 4302278 markings, 14219190 edges, 8829 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 4349640 markings, 14408878 edges, 9472 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 4399396 markings, 14605013 edges, 9951 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 4447418 markings, 14793201 edges, 9604 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 4496018 markings, 14983434 edges, 9720 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 4541605 markings, 15145175 edges, 9117 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 4569306 markings, 15268316 edges, 5540 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 4597966 markings, 15382328 edges, 5732 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 4625638 markings, 15487824 edges, 5534 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 4652558 markings, 15596298 edges, 5384 markings/sec, 540 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 4673923 markings, 15673223 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no no yes yes
lola:
preliminary result: no yes yes no yes yes yes no no yes yes
lola: ========================================
lola: memory consumption: 82004 KB
lola: time consumption: 783 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="BridgeAndVehicles-COL-V20P20N50"
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 BridgeAndVehicles-COL-V20P20N50, 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 r182-oct2-158987913500187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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