About the Execution of ITS-LoLa for Angiogenesis-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15740.840 | 3600000.00 | 25500.00 | 258.60 | FTFFTFFFFFFFFFTF | normal |
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-158987787500321.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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787500321
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.5K 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.5K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 4.2K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K 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-05-00
FORMULA_NAME Angiogenesis-PT-05-01
FORMULA_NAME Angiogenesis-PT-05-02
FORMULA_NAME Angiogenesis-PT-05-03
FORMULA_NAME Angiogenesis-PT-05-04
FORMULA_NAME Angiogenesis-PT-05-05
FORMULA_NAME Angiogenesis-PT-05-06
FORMULA_NAME Angiogenesis-PT-05-07
FORMULA_NAME Angiogenesis-PT-05-08
FORMULA_NAME Angiogenesis-PT-05-09
FORMULA_NAME Angiogenesis-PT-05-10
FORMULA_NAME Angiogenesis-PT-05-11
FORMULA_NAME Angiogenesis-PT-05-12
FORMULA_NAME Angiogenesis-PT-05-13
FORMULA_NAME Angiogenesis-PT-05-14
FORMULA_NAME Angiogenesis-PT-05-15
=== Now, execution of the tool begins
BK_START 1591414075195
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 03:27: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 03:27:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 03:27:58] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-06-06 03:27:58] [INFO ] Transformed 39 places.
[2020-06-06 03:27:58] [INFO ] Transformed 64 transitions.
[2020-06-06 03:27:58] [INFO ] Parsed PT model containing 39 places and 64 transitions in 159 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 100004 steps, including 1 resets, run finished after 238 ms. (steps per millisecond=420 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 64 rows 39 cols
[2020-06-06 03:27:58] [INFO ] Computed 8 place invariants in 6 ms
[2020-06-06 03:27:59] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2020-06-06 03:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:27:59] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-06-06 03:27:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:27:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-06-06 03:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:27:59] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-06 03:27:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 40 ms.
[2020-06-06 03:27:59] [INFO ] Added : 51 causal constraints over 11 iterations in 218 ms. Result :sat
[2020-06-06 03:27:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-06 03:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:27:59] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-06-06 03:27:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:27:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-06 03:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:27:59] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-06 03:27:59] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 24 ms.
[2020-06-06 03:27:59] [INFO ] Added : 52 causal constraints over 11 iterations in 169 ms. Result :sat
[2020-06-06 03:27:59] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 03:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:00] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-06 03:28:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:28:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-06-06 03:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:00] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-06 03:28:00] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 17 ms.
[2020-06-06 03:28:00] [INFO ] Added : 57 causal constraints over 12 iterations in 179 ms. Result :sat
[2020-06-06 03:28:00] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 03:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:00] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-06 03:28:00] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 12 ms.
[2020-06-06 03:28:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:28:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-06 03:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-06 03:28:00] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-06-06 03:28:00] [INFO ] Added : 51 causal constraints over 11 iterations in 165 ms. Result :sat
[2020-06-06 03:28:00] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 03:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:00] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-06-06 03:28:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:28:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-06 03:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:00] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-06 03:28:00] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 03:28:01] [INFO ] Added : 56 causal constraints over 12 iterations in 163 ms. Result :sat
[2020-06-06 03:28:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 03:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:01] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-06 03:28:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:28:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-06 03:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:28:01] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-06-06 03:28:01] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-06-06 03:28:01] [INFO ] Added : 59 causal constraints over 12 iterations in 194 ms. Result :sat
[2020-06-06 03:28:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-06 03:28:01] [INFO ] Flatten gal took : 74 ms
FORMULA Angiogenesis-PT-05-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-05-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 03:28:01] [INFO ] Flatten gal took : 23 ms
[2020-06-06 03:28:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-06 03:28:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Angiogenesis-PT-05 @ 3570 seconds
FORMULA Angiogenesis-PT-05-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Angiogenesis-PT-05-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLCardinality @ Angiogenesis-PT-05
{
"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 03:28:03 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (G ((p28 + 1 <= p16))) AND (((p28 + 1 <= p16) R (p0 <= p3)) OR (p28 <= 2))))",
"processed_size": 82,
"rewrites": 88
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "F (G ((X (F ((1 <= p22))) OR G (((p9 <= p36) OR (p14 <= p1))))))",
"processed_size": 65,
"rewrites": 88
},
"result":
{
"edges": 13141,
"markings": 6877,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((F (((p11 <= p9) OR ((p23 <= 1)))) AND (X (G ((p18 + 1 <= p21))) OR ((p11 <= p9) OR ((p23 <= 1)))))))",
"processed_size": 109,
"rewrites": 88
},
"result":
{
"edges": 202116,
"markings": 95908,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((((p17 <= p20) U (3 <= p15)) AND (p24 <= p19))) OR F ((p17 <= p20))))",
"processed_size": 76,
"rewrites": 88
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((F ((3 <= p24)) OR X (X (((p34 <= p22) U (3 <= p24))))) U X (F ((p34 <= p3)))))",
"processed_size": 83,
"rewrites": 88
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((2 <= p14)) AND (X (F ((p30 + 1 <= p32))) AND G ((X (X ((p32 <= p30))) AND (p35 <= p25))))))",
"processed_size": 99,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 5,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "F ((F ((1 <= p21)) OR X ((p36 <= p25))))",
"processed_size": 40,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((p20 <= p36)) AND ((X (((p36 + 1 <= p20) AND (p3 + 1 <= p9))) U (p17 <= 2)) OR F ((p9 <= p3)))))",
"processed_size": 103,
"rewrites": 88
},
"result":
{
"edges": 47739,
"markings": 23693,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G ((X (X ((p35 <= p13))) AND (p17 <= p9))) OR ((p35 <= p13) AND (X (X ((p35 <= p13))) AND (p17 <= p9))))))",
"processed_size": 113,
"rewrites": 88
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 26
},
"compoundnumber": 8,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "X (X (G (((p26 <= p25) OR (p14 + 1 <= p36)))))",
"processed_size": 47,
"rewrites": 88
},
"result":
{
"edges": 47010,
"markings": 23308,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p11 + 1 <= p25)))",
"processed_size": 24,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((p23 <= p15))",
"processed_size": 16,
"rewrites": 88
},
"result":
{
"edges": 874,
"markings": 607,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p5) OR (F (((p10 <= p31) AND (1 <= p9) AND (p10 <= p4))) AND F ((p10 <= p4))))))",
"processed_size": 93,
"rewrites": 88
},
"result":
{
"edges": 393,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "G ((p7 <= p38))",
"processed_size": 15,
"rewrites": 88
},
"result":
{
"edges": 1981010,
"markings": 657269,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24468,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(G(*)) AND ((* R *) OR *))) : F(G((X(F(**)) OR G(**)))) : X(G((F(**) AND (X(G(*)) OR **)))) : X((G(((** U **) AND **)) OR F(**))) : (F(((** U (** U **)) OR **)) AND G(**)) : F(G((** OR (F(**) AND F(**))))) : G(**) : X(((F(**) OR X(X((** U **)))) U X(F(**)))) : X((G(**) AND (X(F(*)) AND G((X(X(**)) AND **))))) : F((F(**) OR X(**))) : X((G(**) AND ((X(*) U **) OR F(**)))) : G(F((G((X(X(**)) AND *)) OR (* AND (X(X(**)) AND *))))) : F(G(*)) : X(X(G(*)))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no yes no no no no no no no no no no ",
"value": "no no no yes no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: NOT(X ((G (X (F ((p16 <= p28)))) OR (((p16 <= p28) U (p3 + 1 <= p0)) AND (3 <= p28))))) : X (F (NOT(G (F (NOT(X ((F (X ((1 <= p22))) OR G (((p9 <= p36) OR (p14 <= p1))))))))))) : G ((G (NOT(X (X (F ((p21 <= p18)))))) U X (((p11 <= p9) OR ((p23 <= 1)))))) : X ((G ((((p17 <= p20) U (3 <= p15)) AND (p24 <= p19))) OR F ((p17 <= p20)))) : (F ((((3 <= p37) U ((2 <= p26) U (p37 <= 2))) OR ((p15 <= p16) AND (p7 <= p38)))) AND G ((p7 <= p38))) : G (X (F (G (((2 <= p5) OR (F (((p10 <= p31) AND (1 <= p9) AND (p10 <= p4))) AND F ((p10 <= p4)))))))) : G ((p23 <= p15)) : X (((F ((3 <= p24)) OR X (X (((p34 <= p22) U (3 <= p24))))) U F (X ((p34 <= p3))))) : X (((G ((2 <= p14)) AND F (NOT(X ((p32 <= p30))))) AND G ((X (X ((p32 <= p30))) AND (p35 <= p25))))) : F ((F ((1 <= p21)) OR X ((p36 <= p25)))) : X ((G ((p20 <= p36)) AND ((NOT(X (((p20 <= p36) OR (p9 <= p3)))) U (p17 <= 2)) OR F ((p9 <= p3))))) : NOT(F (X (G (((p13 + 1 <= p35) U (NOT(X (X ((p35 <= p13)))) OR (p9 + 1 <= p17))))))) : NOT(G (X (F ((p25 <= p11))))) : X (G (NOT(F (X (F (((p25 + 1 <= p26) AND (p36 <= p14))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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 ((F (G ((p28 + 1 <= p16))) AND (((p28 + 1 <= p16) R (p0 <= p3)) OR (p28 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((p28 + 1 <= p16))) AND (((p28 + 1 <= p16) R (p0 <= p3)) OR (p28 <= 2))))
lola: processed formula length: 82
lola: 88 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: add low 53
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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F ((1 <= p22))) OR G (((p9 <= p36) OR (p14 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F ((1 <= p22))) OR G (((p9 <= p36) OR (p14 <= p1))))))
lola: processed formula length: 65
lola: 88 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: 6877 markings, 13141 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((p11 <= p9) OR ((p23 <= 1)))) AND (X (G ((p18 + 1 <= p21))) OR ((p11 <= p9) OR ((p23 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((p11 <= p9) OR ((p23 <= 1)))) AND (X (G ((p18 + 1 <= p21))) OR ((p11 <= p9) OR ((p23 <= 1)))))))
lola: processed formula length: 109
lola: 88 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: 95908 markings, 202116 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p17 <= p20) U (3 <= p15)) AND (p24 <= p19))) OR F ((p17 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p17 <= p20) U (3 <= p15)) AND (p24 <= p19))) OR F ((p17 <= p20))))
lola: processed formula length: 76
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F ((3 <= p24)) OR X (X (((p34 <= p22) U (3 <= p24))))) U X (F ((p34 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((3 <= p24)) OR X (X (((p34 <= p22) U (3 <= p24))))) U X (F ((p34 <= p3)))))
lola: processed formula length: 83
lola: 88 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((2 <= p14)) AND (X (F ((p30 + 1 <= p32))) AND G ((X (X ((p32 <= p30))) AND (p35 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((2 <= p14)) AND (X (F ((p30 + 1 <= p32))) AND G ((X (X ((p32 <= p30))) AND (p35 <= p25))))))
lola: processed formula length: 99
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p21)) OR X ((p36 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p21)) OR X ((p36 <= p25))))
lola: processed formula length: 40
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p20 <= p36)) AND ((X (((p36 + 1 <= p20) AND (p3 + 1 <= p9))) U (p17 <= 2)) OR F ((p9 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p20 <= p36)) AND ((X (((p36 + 1 <= p20) AND (p3 + 1 <= p9))) U (p17 <= 2)) OR F ((p9 <= p3)))))
lola: processed formula length: 103
lola: 88 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: 23693 markings, 47739 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((X (X ((p35 <= p13))) AND (p17 <= p9))) OR ((p35 <= p13) AND (X (X ((p35 <= p13))) AND (p17 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((X (X ((p35 <= p13))) AND (p17 <= p9))) OR ((p35 <= p13) AND (X (X ((p35 <= p13))) AND (p17 <= p9))))))
lola: processed formula length: 113
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 26 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p26 <= p25) OR (p14 + 1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p26 <= p25) OR (p14 + 1 <= p36)))))
lola: processed formula length: 47
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 23308 markings, 47010 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p11 + 1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p11 + 1 <= p25)))
lola: processed formula length: 24
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 53
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, 4 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p23 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p23 <= p15))
lola: processed formula length: 16
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 607 markings, 874 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p5) OR (F (((p10 <= p31) AND (1 <= p9) AND (p10 <= p4))) AND F ((p10 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((2 <= p5) OR (F (((p10 <= p31) AND (1 <= p9) AND (p10 <= p4))) AND F ((p10 <= p4))))))
lola: processed formula length: 93
lola: 88 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 60
lola: add low 60
lola: add low 52
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: 194 markings, 393 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((3 <= p37) U ((2 <= p26) U (p37 <= 2))) OR ((p15 <= p16) AND (p7 <= p38)))) AND G ((p7 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p7 <= p38))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p7 <= p38))
lola: processed formula length: 15
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 657269 markings, 1981010 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no no no no no
lola:
preliminary result: no no no yes no no no no no no no no no no
lola: memory consumption: 24468 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Angiogenesis-PT-05"
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-05, 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-158987787500321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-05.tgz
mv Angiogenesis-PT-05 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 '
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 ;