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.r166-smll-158987787600353.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 Angiogenesis-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787600353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.7K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 33K Apr 28 14:22 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 Angiogenesis-PT-25-00
FORMULA_NAME Angiogenesis-PT-25-01
FORMULA_NAME Angiogenesis-PT-25-02
FORMULA_NAME Angiogenesis-PT-25-03
FORMULA_NAME Angiogenesis-PT-25-04
FORMULA_NAME Angiogenesis-PT-25-05
FORMULA_NAME Angiogenesis-PT-25-06
FORMULA_NAME Angiogenesis-PT-25-07
FORMULA_NAME Angiogenesis-PT-25-08
FORMULA_NAME Angiogenesis-PT-25-09
FORMULA_NAME Angiogenesis-PT-25-10
FORMULA_NAME Angiogenesis-PT-25-11
FORMULA_NAME Angiogenesis-PT-25-12
FORMULA_NAME Angiogenesis-PT-25-13
FORMULA_NAME Angiogenesis-PT-25-14
FORMULA_NAME Angiogenesis-PT-25-15

=== Now, execution of the tool begins

BK_START 1591433275883

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 08:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 08:47:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 08:47:58] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2020-06-06 08:47:58] [INFO ] Transformed 39 places.
[2020-06-06 08:47:58] [INFO ] Transformed 64 transitions.
[2020-06-06 08:47:58] [INFO ] Parsed PT model containing 39 places and 64 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100011 steps, including 1 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 64 rows 39 cols
[2020-06-06 08:47:58] [INFO ] Computed 8 place invariants in 9 ms
[2020-06-06 08:47:58] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned unsat
[2020-06-06 08:47:58] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 08:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-06 08:47:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 16 ms.
[2020-06-06 08:47:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-06 08:47:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 41 ms.
[2020-06-06 08:47:59] [INFO ] Added : 58 causal constraints over 12 iterations in 165 ms. Result :sat
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-06 08:47:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-06 08:47:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 08:47:59] [INFO ] Added : 51 causal constraints over 11 iterations in 104 ms. Result :sat
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-06 08:47:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2020-06-06 08:47:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-06 08:47:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-06-06 08:47:59] [INFO ] Added : 59 causal constraints over 12 iterations in 102 ms. Result :sat
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-06 08:47:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 08:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 08:47:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-06 08:47:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-06-06 08:48:00] [INFO ] Added : 57 causal constraints over 12 iterations in 105 ms. Result :sat
[2020-06-06 08:48:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-06 08:48:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 08:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 08:48:00] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-06 08:48:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 08:48:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 08:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 08:48:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-06 08:48:00] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 08:48:00] [INFO ] Added : 59 causal constraints over 12 iterations in 101 ms. Result :sat
[2020-06-06 08:48:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-06-06 08:48:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 08:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 08:48:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-06 08:48:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 08:48:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 08:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 08:48:00] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-06-06 08:48:00] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 08:48:00] [INFO ] Added : 57 causal constraints over 12 iterations in 132 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2020-06-06 08:48:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-06 08:48:00] [INFO ] Flatten gal took : 50 ms
FORMULA Angiogenesis-PT-25-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 08:48:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-06 08:48:00] [INFO ] Flatten gal took : 15 ms
[2020-06-06 08:48:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Angiogenesis-PT-25-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 08:48:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-06 08:48:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Angiogenesis-PT-25 @ 3570 seconds

FORMULA Angiogenesis-PT-25-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-25-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-25-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-25-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-25-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for LTLCardinality @ Angiogenesis-PT-25

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "(p16 <= p28)",
"processed_size": 12,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((F (G ((p3 + 1 <= p0))) AND (3 <= p28))) AND (2 <= p18)))",
"processed_size": 64,
"rewrites": 58
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((X (X ((2 <= p23))) OR (p18 + 1 <= p21)) AND F ((2 <= p23))))",
"processed_size": 65,
"rewrites": 58
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"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": "(p22 <= 2)",
"processed_size": 10,
"rewrites": 60
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (X (((p8 <= 2) R (p5 <= 1)))) OR G ((p9 <= 0)))))",
"processed_size": 58,
"rewrites": 58
},
"result":
{
"edges": 12558850,
"markings": 5924777,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p33 <= p27)))",
"processed_size": 20,
"rewrites": 58
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 23180,
"runtime": 3571.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((G((F(G(*)) AND **)) AND **)) AND **) : F(((** U G(*)) AND **)) : G(F((G(*) OR (G(*) AND *)))) : G(((X(X(*)) OR *) AND F(*))) : (X(G(*)) AND F(**)) : G(F((X(X((* R *))) OR G(**)))) : X(G(**)) : (X(F(**)) AND ((X(**) U **) OR F(*))) : X(X(X(G(*)))) : (** U X((X(**) OR **))) : (X(**) OR (G(**) AND **)) : G(F(**)) : X((((G(*) AND **) U **) U X(F(**)))) : (G((G(**) AND **)) AND X((G(F(**)) OR **)))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"interim_value": "no unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown "
},
"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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p10 <= p35)
lola: (X ((G ((NOT(G (F ((p0 <= p3)))) AND (3 <= p28))) AND (2 <= p18))) AND (p16 <= p28)) : F ((((3 <= p2) U NOT(((0 <= 0) U (3 <= p2)))) AND ((p13 + 1 <= p2)))) : NOT(G (F (G ((F ((p9 <= p36)) U (p22 <= 0)))))) : NOT(F (((X (X ((p23 <= 1))) AND (p21 <= p18)) OR G ((p23 <= 1))))) : (G (NOT(X ((p17 <= p20)))) AND F ((3 <= p22))) : X (G (F ((NOT(X (X (((3 <= p8) U (2 <= p5))))) OR G ((p9 <= 0)))))) : G (X ((p33 <= p27))) : (F (X ((p34 <= p22))) AND ((X ((p22 + 1 <= p34)) U (2 <= p32)) OR NOT(G ((p34 <= p22))))) : X (NOT(X (NOT(G (NOT(X ((((p30 + 1 <= p32) OR (p32 <= p30)) AND (2 <= p14))))))))) : ((1 <= p38) U X ((X (((p36 <= p25) OR (1 <= p21))) OR (p17 <= p33)))) : (X (((p20 <= p36) OR (p9 <= p3))) OR (G ((p9 <= p3)) AND (p11 <= p10))) : G (F (G (F ((p35 <= p13))))) : X ((((NOT(F ((p19 <= p31))) AND (p5 <= 2)) U (p18 <= 1)) U F (X (F ((p19 <= p31)))))) : (G ((G ((p3 <= p18)) AND (p26 <= p25))) AND X ((X (G (F ((p3 <= p18)))) OR (p26 <= p25))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((F (G ((p3 + 1 <= p0))) AND (3 <= p28))) AND (2 <= p18))) AND (p16 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p16 <= p28)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= p28)
lola: processed formula length: 12
lola: 58 rewrites
lola: closed formula file LTLCardinality.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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((F (G ((p3 + 1 <= p0))) AND (3 <= p28))) AND (2 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((F (G ((p3 + 1 <= p0))) AND (3 <= p28))) AND (2 <= p18)))
lola: processed formula length: 64
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (X ((2 <= p23))) OR (p18 + 1 <= p21)) AND F ((2 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X ((2 <= p23))) OR (p18 + 1 <= p21)) AND F ((2 <= p23))))
lola: processed formula length: 65
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p20 + 1 <= p17))) AND F ((3 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p22 <= 2)
lola: processed formula length: 10
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (((p8 <= 2) R (p5 <= 1)))) OR G ((p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (((p8 <= 2) R (p5 <= 1)))) OR G ((p9 <= 0)))))
lola: processed formula length: 58
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2133991 markings, 4475002 edges, 426798 markings/sec, 0 secs
lola: 4357189 markings, 9218648 edges, 444640 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5924777 markings, 12558850 edges
lola: ========================================
lola: subprocess 4 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p33 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p33 <= p27)))
lola: processed formula length: 20
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p34 <= p22))) AND ((X ((p22 + 1 <= p34)) U (2 <= p32)) OR F ((p22 + 1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 23180 KB
lola: time consumption: 411 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: no unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 23180 KB
lola: time consumption: 3571 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16125444 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16125436 kB

--------------------
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="Angiogenesis-PT-25"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Angiogenesis-PT-25, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-158987787600353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-25.tgz
mv Angiogenesis-PT-25 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;