About the Execution of LoLA for DNAwalker-PT-08ringLL
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4289.720 | 1549150.00 | 1572059.00 | 52.50 | FFTFFFTTTFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r049-oct2-155234405400665.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is DNAwalker-PT-08ringLL, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405400665
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.5K Feb 10 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 10 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 6 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 6 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 23:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 3 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 30 22:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 30 22:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 112K Mar 10 17:31 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 DNAwalker-PT-08ringLL-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552473062024
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-08ringLL @ 3570 seconds
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2021
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-08ringLL
{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 13 10:31:02 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 193
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 206
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 258
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((2 <= B5))))",
"processed_size": 19,
"rewrites": 13
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 281
},
"exit":
{
"localtimelimitreached": true,
"memory": 977060,
"runtime": 750.000000
},
"files":
{
"JSON": "ReachabilityCardinality.json"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= A17)))",
"processed_size": 18,
"rewrites": 13
},
"result":
{
"edges": 230723196,
"markings": 27950651,
"preliminary_value": "no no unknown unknown unknown unknown unknown yes unknown no unknown unknown unknown yes unknown unknown ",
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 281
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((3 <= A13))))",
"processed_size": 20,
"rewrites": 13
},
"result":
{
"edges": 121262408,
"markings": 26423519,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((3 <= B14) OR (3 <= B3))))",
"processed_size": 34,
"rewrites": 13
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((3 <= A10) OR (1 <= B2) OR (B5 <= 1)))))",
"processed_size": 50,
"rewrites": 14
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((B4 <= A21) AND (3 <= B14))))",
"processed_size": 36,
"rewrites": 13
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((3 <= A15) AND ((A2 + 1 <= B2) OR (A15 + 1 <= A17)))))",
"processed_size": 62,
"rewrites": 13
},
"result":
{
"edges": 77344551,
"markings": 14516824,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 513
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= A15) OR (3 <= A6) OR (2 <= A15)) AND (A8 + 1 <= A9))))",
"processed_size": 70,
"rewrites": 13
},
"result":
{
"edges": 41583451,
"markings": 7234765,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 628
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((A4 <= B14) OR (A12 <= B5) OR ((1 <= A9) AND (2 <= B5)) OR (A8 <= 2))))",
"processed_size": 81,
"rewrites": 14
},
"result":
{
"edges": 52974425,
"markings": 13230859,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((3 <= A8) AND ((A20 <= A12) OR (2 <= A9) OR ((A9 <= A19) AND (B14 <= A15))))))",
"processed_size": 87,
"rewrites": 13
},
"result":
{
"edges": 132439582,
"markings": 23688975,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= A3) AND (3 <= A2)) OR ((A16 <= A13) AND (A12 <= A18)) OR (A11 <= 2))))",
"processed_size": 86,
"rewrites": 14
},
"result":
{
"edges": 167723092,
"markings": 26808513,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2066
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((A12 <= A8) OR (1 <= A19) OR (A13 <= A4) OR (B5 <= A2) OR (3 <= B15))))",
"processed_size": 82,
"rewrites": 14
},
"result":
{
"edges": 14073846,
"markings": 3432666,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 33668,
"runtime": 1525.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : FALSE : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : TRUE : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : TRUE : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no yes no no no yes yes yes no no no yes yes no no ",
"value": "no no yes no no no yes yes yes no no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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 ReachabilityCardinality.xml
lola: atomic prop true by contained trap!
lola: LP says that atomic proposition is always false: (3 <= B2)
lola: atomic prop true by contained trap!
lola: E (F (())) : E (F ((A7 <= 0))) : A (G ((((3 <= A10) OR (1 <= B2) OR (B5 <= 1))))) : E (F (((3 <= B14) OR (3 <= B3)))) : E (F (((3 <= A8) AND ((A20 <= A12) OR (2 <= A9) OR ((A9 <= A19) AND (B14 <= A15)))))) : E (F (((3 <= A13)))) : A (G ((((1 <= A3) AND (3 <= A2)) OR ((A16 <= A13) AND (A12 <= A18)) OR (A11 <= 2)))) : A (G (())) : E (F ((((2 <= A15) OR (3 <= A6) OR (2 <= A15)) AND (A8 + 1 <= A9)))) : E (F (((2 <= B5)))) : E (F ((3 <= A17))) : A (G (((A12 <= A8) OR (1 <= A19) OR (A13 <= A4) OR (B5 <= A2) OR (3 <= B15)))) : A (G (((A4 <= B14) OR (A12 <= B5) OR ((1 <= A9) AND (2 <= B5)) OR (A8 <= 2)))) : A (G (())) : E (F (((3 <= A15) AND ((A2 + 1 <= B2) OR (A15 + 1 <= A17))))) : E (F (((B4 <= A21) AND (3 <= B14))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= B5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= B5))))
lola: processed formula length: 19
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= B5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: subprocess 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= A17)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= A17)))
lola: processed formula length: 18
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= A17)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 573391 markings, 3127213 edges, 114678 markings/sec, 0 secs
lola: sara is running 5 secs || 1064882 markings, 6484172 edges, 98298 markings/sec, 5 secs
lola: sara is running 10 secs || 1582243 markings, 9961312 edges, 103472 markings/sec, 10 secs
lola: sara is running 15 secs || 2112788 markings, 13620643 edges, 106109 markings/sec, 15 secs
lola: sara is running 20 secs || 2658802 markings, 17493405 edges, 109203 markings/sec, 20 secs
lola: sara is running 25 secs || 3195308 markings, 21298453 edges, 107301 markings/sec, 25 secs
lola: sara is running 30 secs || 3722248 markings, 25244169 edges, 105388 markings/sec, 30 secs
lola: sara is running 35 secs || 4258936 markings, 29225231 edges, 107338 markings/sec, 35 secs
lola: sara is running 40 secs || 4776127 markings, 33246753 edges, 103438 markings/sec, 40 secs
lola: sara is running 45 secs || 5291478 markings, 37150285 edges, 103070 markings/sec, 45 secs
lola: sara is running 50 secs || 5836879 markings, 40957251 edges, 109080 markings/sec, 50 secs
lola: sara is running 55 secs || 6381566 markings, 44846573 edges, 108937 markings/sec, 55 secs
lola: sara is running 60 secs || 6921437 markings, 48730855 edges, 107974 markings/sec, 60 secs
lola: sara is running 65 secs || 7439911 markings, 52837300 edges, 103695 markings/sec, 65 secs
lola: sara is running 70 secs || 7956438 markings, 56844115 edges, 103305 markings/sec, 70 secs
lola: sara is running 75 secs || 8501250 markings, 60732537 edges, 108962 markings/sec, 75 secs
lola: sara is running 80 secs || 9027952 markings, 64537026 edges, 105340 markings/sec, 80 secs
lola: sara is running 85 secs || 9469528 markings, 68456922 edges, 88315 markings/sec, 85 secs
lola: sara is running 90 secs || 9967125 markings, 72134240 edges, 99519 markings/sec, 90 secs
lola: sara is running 95 secs || 10423520 markings, 76010935 edges, 91279 markings/sec, 95 secs
lola: sara is running 100 secs || 10892588 markings, 79884601 edges, 93814 markings/sec, 100 secs
lola: sara is running 105 secs || 11393283 markings, 84007275 edges, 100139 markings/sec, 105 secs
lola: sara is running 110 secs || 11891873 markings, 88134151 edges, 99718 markings/sec, 110 secs
lola: sara is running 115 secs || 12383911 markings, 92442510 edges, 98408 markings/sec, 115 secs
lola: sara is running 120 secs || 12942351 markings, 96492242 edges, 111688 markings/sec, 120 secs
lola: sara is running 125 secs || 13497371 markings, 100414806 edges, 111004 markings/sec, 125 secs
lola: sara is running 130 secs || 14006035 markings, 104389662 edges, 101733 markings/sec, 130 secs
lola: sara is running 135 secs || 14480243 markings, 108473197 edges, 94842 markings/sec, 135 secs
lola: sara is running 140 secs || 14937506 markings, 112564193 edges, 91453 markings/sec, 140 secs
lola: sara is running 145 secs || 15396666 markings, 116607386 edges, 91832 markings/sec, 145 secs
lola: sara is running 150 secs || 15906987 markings, 120571786 edges, 102064 markings/sec, 150 secs
lola: sara is running 155 secs || 16378231 markings, 124636666 edges, 94249 markings/sec, 155 secs
lola: sara is running 160 secs || 16830198 markings, 128864986 edges, 90393 markings/sec, 160 secs
lola: sara is running 165 secs || 17328655 markings, 133117069 edges, 99691 markings/sec, 165 secs
lola: sara is running 170 secs || 17810475 markings, 137398979 edges, 96364 markings/sec, 170 secs
lola: sara is running 175 secs || 18289143 markings, 141572656 edges, 95734 markings/sec, 175 secs
lola: sara is running 180 secs || 18753281 markings, 145840133 edges, 92828 markings/sec, 180 secs
lola: sara is running 185 secs || 19254674 markings, 150273676 edges, 100279 markings/sec, 185 secs
lola: sara is running 190 secs || 19773686 markings, 154700958 edges, 103802 markings/sec, 190 secs
lola: sara is running 195 secs || 20283871 markings, 159098222 edges, 102037 markings/sec, 195 secs
lola: sara is running 200 secs || 20780700 markings, 163594160 edges, 99366 markings/sec, 200 secs
lola: sara is running 205 secs || 21269807 markings, 168094613 edges, 97821 markings/sec, 205 secs
lola: sara is running 210 secs || 21765068 markings, 172632176 edges, 99052 markings/sec, 210 secs
lola: sara is running 215 secs || 22238713 markings, 176981559 edges, 94729 markings/sec, 215 secs
lola: sara is running 220 secs || 22708932 markings, 181443239 edges, 94044 markings/sec, 220 secs
lola: sara is running 225 secs || 23209744 markings, 185791513 edges, 100162 markings/sec, 225 secs
lola: sara is running 230 secs || 23686789 markings, 190286254 edges, 95409 markings/sec, 230 secs
lola: sara is running 235 secs || 24152527 markings, 194756519 edges, 93148 markings/sec, 235 secs
lola: sara is running 240 secs || 24615647 markings, 199218870 edges, 92624 markings/sec, 240 secs
lola: sara is running 245 secs || 25103104 markings, 203685735 edges, 97491 markings/sec, 245 secs
lola: sara is running 250 secs || 25540064 markings, 207876333 edges, 87392 markings/sec, 250 secs
lola: sara is running 255 secs || 26019296 markings, 212300201 edges, 95846 markings/sec, 255 secs
lola: sara is running 260 secs || 26490811 markings, 216609689 edges, 94303 markings/sec, 260 secs
lola: sara is running 265 secs || 26955619 markings, 220577531 edges, 92962 markings/sec, 265 secs
lola: sara is running 270 secs || 27378600 markings, 224834475 edges, 84596 markings/sec, 270 secs
lola: sara is running 275 secs || 27791785 markings, 228955777 edges, 82637 markings/sec, 275 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown unknown unknown unknown yes unknown no unknown unknown unknown yes unknown unknown
lola: memory consumption: 977060 KB
lola: time consumption: 750 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 27950651 markings, 230723196 edges
lola: ========================================
lola: subprocess 6 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A13))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= A13))))
lola: processed formula length: 20
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= A13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1033265 markings, 3780037 edges, 206653 markings/sec, 0 secs
lola: sara is running 5 secs || 1988915 markings, 7711771 edges, 191130 markings/sec, 5 secs
lola: sara is running 10 secs || 2928805 markings, 11506778 edges, 187978 markings/sec, 10 secs
lola: sara is running 15 secs || 3860843 markings, 15273667 edges, 186408 markings/sec, 15 secs
lola: sara is running 20 secs || 4780757 markings, 19168428 edges, 183983 markings/sec, 20 secs
lola: sara is running 25 secs || 5689789 markings, 22878242 edges, 181806 markings/sec, 25 secs
lola: sara is running 30 secs || 6656225 markings, 26749230 edges, 193287 markings/sec, 30 secs
lola: sara is running 35 secs || 7548550 markings, 30672112 edges, 178465 markings/sec, 35 secs
lola: sara is running 40 secs || 8452275 markings, 34533276 edges, 180745 markings/sec, 40 secs
lola: sara is running 45 secs || 9353092 markings, 38344865 edges, 180163 markings/sec, 45 secs
lola: sara is running 50 secs || 10229552 markings, 42364965 edges, 175292 markings/sec, 50 secs
lola: sara is running 55 secs || 11054751 markings, 46433934 edges, 165040 markings/sec, 55 secs
lola: sara is running 60 secs || 11954724 markings, 50395436 edges, 179995 markings/sec, 60 secs
lola: sara is running 65 secs || 12905288 markings, 54405606 edges, 190113 markings/sec, 65 secs
lola: sara is running 70 secs || 13849160 markings, 58389394 edges, 188774 markings/sec, 70 secs
lola: sara is running 75 secs || 14752449 markings, 62466858 edges, 180658 markings/sec, 75 secs
lola: sara is running 80 secs || 15692066 markings, 66493058 edges, 187923 markings/sec, 80 secs
lola: sara is running 85 secs || 16607761 markings, 70625473 edges, 183139 markings/sec, 85 secs
lola: sara is running 90 secs || 17508313 markings, 74691511 edges, 180110 markings/sec, 90 secs
lola: sara is running 95 secs || 18432065 markings, 78772170 edges, 184750 markings/sec, 95 secs
lola: sara is running 100 secs || 19344904 markings, 82649858 edges, 182568 markings/sec, 100 secs
lola: sara is running 105 secs || 20233766 markings, 86679306 edges, 177772 markings/sec, 105 secs
lola: sara is running 110 secs || 21123919 markings, 90696136 edges, 178031 markings/sec, 110 secs
lola: sara is running 115 secs || 22044474 markings, 94754542 edges, 184111 markings/sec, 115 secs
lola: sara is running 120 secs || 22922754 markings, 98740157 edges, 175656 markings/sec, 120 secs
lola: sara is running 125 secs || 23814957 markings, 102772039 edges, 178441 markings/sec, 125 secs
lola: sara is running 130 secs || 24619894 markings, 107106422 edges, 160987 markings/sec, 130 secs
lola: sara is running 135 secs || 25239211 markings, 111647265 edges, 123863 markings/sec, 135 secs
lola: sara is running 140 secs || 25808074 markings, 116117469 edges, 113773 markings/sec, 140 secs
lola: sara is running 145 secs || 26342942 markings, 120527772 edges, 106974 markings/sec, 145 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 26423519 markings, 121262408 edges
lola: ========================================
lola: subprocess 7 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= B14) OR (3 <= B3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= B14) OR (3 <= B3))))
lola: processed formula length: 34
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= A10) OR (1 <= B2) OR (B5 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((3 <= A10) OR (1 <= B2) OR (B5 <= 1)))))
lola: processed formula length: 50
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((A10 <= 2) AND (B2 <= 0) AND (2 <= B5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((B4 <= A21) AND (3 <= B14))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((B4 <= A21) AND (3 <= B14))))
lola: processed formula length: 36
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((B4 <= A21) AND (3 <= B14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: subprocess 10 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A15) AND ((A2 + 1 <= B2) OR (A15 + 1 <= A17)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= A15) AND ((A2 + 1 <= B2) OR (A15 + 1 <= A17)))))
lola: processed formula length: 62
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: ========================================
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= A15) AND ((A2 + 1 <= B2) OR (A15 + 1 <= A17)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 771553 markings, 3233242 edges, 154311 markings/sec, 0 secs
lola: sara is running 5 secs || 1486765 markings, 6770596 edges, 143042 markings/sec, 5 secs
lola: sara is running 10 secs || 2307665 markings, 10473903 edges, 164180 markings/sec, 10 secs
lola: sara is running 15 secs || 3031585 markings, 14075238 edges, 144784 markings/sec, 15 secs
lola: sara is running 20 secs || 3804204 markings, 17788490 edges, 154524 markings/sec, 20 secs
lola: sara is running 25 secs || 4571771 markings, 21350508 edges, 153513 markings/sec, 25 secs
lola: sara is running 30 secs || 5299977 markings, 25119918 edges, 145641 markings/sec, 30 secs
lola: sara is running 35 secs || 6062462 markings, 28954871 edges, 152497 markings/sec, 35 secs
lola: sara is running 40 secs || 6700073 markings, 32779065 edges, 127522 markings/sec, 40 secs
lola: sara is running 45 secs || 7448048 markings, 36654324 edges, 149595 markings/sec, 45 secs
lola: sara is running 50 secs || 8181453 markings, 40683053 edges, 146681 markings/sec, 50 secs
lola: sara is running 55 secs || 8922243 markings, 44786514 edges, 148158 markings/sec, 55 secs
lola: sara is running 60 secs || 9575443 markings, 48972768 edges, 130640 markings/sec, 60 secs
lola: sara is running 65 secs || 10305598 markings, 53006601 edges, 146031 markings/sec, 65 secs
lola: sara is running 70 secs || 11025460 markings, 57112566 edges, 143972 markings/sec, 70 secs
lola: sara is running 75 secs || 11733784 markings, 61256788 edges, 141665 markings/sec, 75 secs
lola: sara is running 80 secs || 12390561 markings, 65475128 edges, 131355 markings/sec, 80 secs
lola: sara is running 85 secs || 12971727 markings, 69900737 edges, 116233 markings/sec, 85 secs
lola: sara is running 90 secs || 13753269 markings, 74161510 edges, 156308 markings/sec, 90 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 14516824 markings, 77344551 edges
lola: ========================================
lola: subprocess 11 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= A15) OR (3 <= A6) OR (2 <= A15)) AND (A8 + 1 <= A9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((2 <= A15) OR (3 <= A6) OR (2 <= A15)) AND (A8 + 1 <= A9))))
lola: processed formula length: 70
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((2 <= A15) OR (3 <= A6) OR (2 <= A15)) AND (A8 + 1 <= A9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 805202 markings, 3384658 edges, 161040 markings/sec, 0 secs
lola: sara is running 5 secs || 1510646 markings, 6759900 edges, 141089 markings/sec, 5 secs
lola: sara is running 10 secs || 2061032 markings, 10530304 edges, 110077 markings/sec, 10 secs
lola: sara is running 15 secs || 2782693 markings, 14106229 edges, 144332 markings/sec, 15 secs
lola: sara is running 20 secs || 3329343 markings, 17579936 edges, 109330 markings/sec, 20 secs
lola: sara is running 25 secs || 3966602 markings, 21043031 edges, 127452 markings/sec, 25 secs
lola: sara is running 30 secs || 4618053 markings, 24684207 edges, 130290 markings/sec, 30 secs
lola: sara is running 35 secs || 5296403 markings, 28306129 edges, 135670 markings/sec, 35 secs
lola: sara is running 40 secs || 5892451 markings, 32093116 edges, 119210 markings/sec, 40 secs
lola: sara is running 45 secs || 6482785 markings, 35841833 edges, 118067 markings/sec, 45 secs
lola: sara is running 50 secs || 7033573 markings, 39781005 edges, 110158 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7234765 markings, 41583451 edges
lola: ========================================
lola: subprocess 12 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A4 <= B14) OR (A12 <= B5) OR ((1 <= A9) AND (2 <= B5)) OR (A8 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((A4 <= B14) OR (A12 <= B5) OR ((1 <= A9) AND (2 <= B5)) OR (A8 <= 2))))
lola: processed formula length: 81
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((B14 + 1 <= A4) AND (B5 + 1 <= A12) AND ((A9 <= 0) OR (B5 <= 1)) AND (3 <= A8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1229180 markings, 3300118 edges, 245836 markings/sec, 0 secs
lola: sara is running 5 secs || 2320527 markings, 6931103 edges, 218269 markings/sec, 5 secs
lola: sara is running 10 secs || 3443282 markings, 10541430 edges, 224551 markings/sec, 10 secs
lola: sara is running 15 secs || 4627169 markings, 14215181 edges, 236777 markings/sec, 15 secs
lola: sara is running 20 secs || 5586482 markings, 18333910 edges, 191863 markings/sec, 20 secs
lola: sara is running 25 secs || 6664660 markings, 22728521 edges, 215636 markings/sec, 25 secs
lola: sara is running 30 secs || 7646890 markings, 26853333 edges, 196446 markings/sec, 30 secs
lola: sara is running 35 secs || 8576298 markings, 31044104 edges, 185882 markings/sec, 35 secs
lola: sara is running 40 secs || 9485140 markings, 35266950 edges, 181768 markings/sec, 40 secs
lola: sara is running 45 secs || 10330127 markings, 39569405 edges, 168997 markings/sec, 45 secs
lola: sara is running 50 secs || 11234806 markings, 44087797 edges, 180936 markings/sec, 50 secs
lola: sara is running 55 secs || 12236518 markings, 48758578 edges, 200342 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 13230859 markings, 52974425 edges
lola: ========================================
lola: subprocess 13 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A8) AND ((A20 <= A12) OR (2 <= A9) OR ((A9 <= A19) AND (B14 <= A15))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= A8) AND ((A20 <= A12) OR (2 <= A9) OR ((A9 <= A19) AND (B14 <= A15))))))
lola: processed formula length: 87
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= A8) AND ((A20 <= A12) OR (2 <= A9) OR ((A9 <= A19) AND (B14 <= A15))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 745645 markings, 3655903 edges, 149129 markings/sec, 0 secs
lola: sara is running 5 secs || 1512078 markings, 7517410 edges, 153287 markings/sec, 5 secs
lola: sara is running 10 secs || 2294913 markings, 11412126 edges, 156567 markings/sec, 10 secs
lola: sara is running 15 secs || 2975484 markings, 15286295 edges, 136114 markings/sec, 15 secs
lola: sara is running 20 secs || 3756515 markings, 19179518 edges, 156206 markings/sec, 20 secs
lola: sara is running 25 secs || 4418858 markings, 23160324 edges, 132469 markings/sec, 25 secs
lola: sara is running 30 secs || 5116416 markings, 26705392 edges, 139512 markings/sec, 30 secs
lola: sara is running 35 secs || 5821794 markings, 30411034 edges, 141076 markings/sec, 35 secs
lola: sara is running 40 secs || 6533956 markings, 34031785 edges, 142432 markings/sec, 40 secs
lola: sara is running 45 secs || 7170674 markings, 37767350 edges, 127344 markings/sec, 45 secs
lola: sara is running 50 secs || 7834365 markings, 41373597 edges, 132738 markings/sec, 50 secs
lola: sara is running 55 secs || 8514690 markings, 45002607 edges, 136065 markings/sec, 55 secs
lola: sara is running 60 secs || 9176904 markings, 49066297 edges, 132443 markings/sec, 60 secs
lola: sara is running 65 secs || 9794571 markings, 52951563 edges, 123533 markings/sec, 65 secs
lola: sara is running 70 secs || 10461175 markings, 56795576 edges, 133321 markings/sec, 70 secs
lola: sara is running 75 secs || 11103120 markings, 60618225 edges, 128389 markings/sec, 75 secs
lola: sara is running 80 secs || 11860305 markings, 64378533 edges, 151437 markings/sec, 80 secs
lola: sara is running 85 secs || 12542294 markings, 68303679 edges, 136398 markings/sec, 85 secs
lola: sara is running 90 secs || 13250147 markings, 72080793 edges, 141571 markings/sec, 90 secs
lola: sara is running 95 secs || 13940888 markings, 76011778 edges, 138148 markings/sec, 95 secs
lola: sara is running 100 secs || 14655617 markings, 79817059 edges, 142946 markings/sec, 100 secs
lola: sara is running 105 secs || 15303799 markings, 83757824 edges, 129636 markings/sec, 105 secs
lola: sara is running 110 secs || 15947351 markings, 87478230 edges, 128710 markings/sec, 110 secs
lola: sara is running 115 secs || 16592316 markings, 91319325 edges, 128993 markings/sec, 115 secs
lola: sara is running 120 secs || 17296686 markings, 95032068 edges, 140874 markings/sec, 120 secs
lola: sara is running 125 secs || 17913692 markings, 98931887 edges, 123401 markings/sec, 125 secs
lola: sara is running 130 secs || 18617649 markings, 102826361 edges, 140791 markings/sec, 130 secs
lola: sara is running 135 secs || 19176824 markings, 106562519 edges, 111835 markings/sec, 135 secs
lola: sara is running 140 secs || 19836610 markings, 110503514 edges, 131957 markings/sec, 140 secs
lola: sara is running 145 secs || 20513317 markings, 114292056 edges, 135341 markings/sec, 145 secs
lola: sara is running 150 secs || 21080383 markings, 118199389 edges, 113413 markings/sec, 150 secs
lola: sara is running 155 secs || 21818960 markings, 122233093 edges, 147715 markings/sec, 155 secs
lola: sara is running 160 secs || 22615068 markings, 126295946 edges, 159222 markings/sec, 160 secs
lola: sara is running 165 secs || 23350563 markings, 130386964 edges, 147099 markings/sec, 165 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 23688975 markings, 132439582 edges
lola: ========================================
lola: subprocess 14 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= A3) AND (3 <= A2)) OR ((A16 <= A13) AND (A12 <= A18)) OR (A11 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= A3) AND (3 <= A2)) OR ((A16 <= A13) AND (A12 <= A18)) OR (A11 <= 2))))
lola: processed formula length: 86
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((A3 <= 0) OR (A2 <= 2)) AND ((A13 + 1 <= A16) OR (A18 + 1 <= A12)) AND (3 <= A11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 885860 markings, 3749153 edges, 177172 markings/sec, 0 secs
lola: sara is running 5 secs || 1800573 markings, 7991034 edges, 182943 markings/sec, 5 secs
lola: sara is running 10 secs || 2621906 markings, 11771465 edges, 164267 markings/sec, 10 secs
lola: sara is running 15 secs || 3309012 markings, 15255766 edges, 137421 markings/sec, 15 secs
lola: sara is running 20 secs || 3969070 markings, 18773279 edges, 132012 markings/sec, 20 secs
lola: sara is running 25 secs || 4646527 markings, 22149823 edges, 135491 markings/sec, 25 secs
lola: sara is running 30 secs || 5394109 markings, 25784622 edges, 149516 markings/sec, 30 secs
lola: sara is running 35 secs || 5919692 markings, 29581014 edges, 105117 markings/sec, 35 secs
lola: sara is running 40 secs || 6539602 markings, 33386744 edges, 123982 markings/sec, 40 secs
lola: sara is running 45 secs || 7134100 markings, 37022695 edges, 118900 markings/sec, 45 secs
lola: sara is running 50 secs || 7685557 markings, 40874857 edges, 110291 markings/sec, 50 secs
lola: sara is running 55 secs || 8239039 markings, 44993199 edges, 110696 markings/sec, 55 secs
lola: sara is running 60 secs || 8802140 markings, 49177373 edges, 112620 markings/sec, 60 secs
lola: sara is running 65 secs || 9312663 markings, 53191012 edges, 102105 markings/sec, 65 secs
lola: sara is running 70 secs || 9849742 markings, 57489910 edges, 107416 markings/sec, 70 secs
lola: sara is running 75 secs || 10445574 markings, 61781883 edges, 119166 markings/sec, 75 secs
lola: sara is running 80 secs || 10945698 markings, 66126511 edges, 100025 markings/sec, 80 secs
lola: sara is running 85 secs || 11559356 markings, 70572439 edges, 122732 markings/sec, 85 secs
lola: sara is running 90 secs || 12089568 markings, 75001170 edges, 106042 markings/sec, 90 secs
lola: sara is running 95 secs || 13050842 markings, 78747798 edges, 192255 markings/sec, 95 secs
lola: sara is running 100 secs || 14096090 markings, 82650246 edges, 209050 markings/sec, 100 secs
lola: sara is running 105 secs || 14961401 markings, 86480145 edges, 173062 markings/sec, 105 secs
lola: sara is running 110 secs || 15481525 markings, 90071190 edges, 104025 markings/sec, 110 secs
lola: sara is running 115 secs || 15959651 markings, 93678146 edges, 95625 markings/sec, 115 secs
lola: sara is running 120 secs || 16477688 markings, 97780857 edges, 103607 markings/sec, 120 secs
lola: sara is running 125 secs || 17010323 markings, 101931062 edges, 106527 markings/sec, 125 secs
lola: sara is running 130 secs || 17507622 markings, 106037333 edges, 99460 markings/sec, 130 secs
lola: sara is running 135 secs || 17970213 markings, 110206110 edges, 92518 markings/sec, 135 secs
lola: sara is running 140 secs || 18496781 markings, 114351086 edges, 105314 markings/sec, 140 secs
lola: sara is running 145 secs || 19138267 markings, 118052680 edges, 128297 markings/sec, 145 secs
lola: sara is running 150 secs || 19845550 markings, 121622501 edges, 141457 markings/sec, 150 secs
lola: sara is running 155 secs || 20568207 markings, 125437620 edges, 144531 markings/sec, 155 secs
lola: sara is running 160 secs || 21482262 markings, 129355010 edges, 182811 markings/sec, 160 secs
lola: sara is running 165 secs || 22485146 markings, 133533701 edges, 200577 markings/sec, 165 secs
lola: sara is running 170 secs || 23109038 markings, 137896199 edges, 124778 markings/sec, 170 secs
lola: sara is running 175 secs || 23635815 markings, 142092361 edges, 105355 markings/sec, 175 secs
lola: sara is running 180 secs || 24172836 markings, 146459270 edges, 107404 markings/sec, 180 secs
lola: sara is running 185 secs || 24748358 markings, 150798004 edges, 115104 markings/sec, 185 secs
lola: sara is running 190 secs || 25310898 markings, 155231047 edges, 112508 markings/sec, 190 secs
lola: sara is running 195 secs || 25794893 markings, 159488981 edges, 96799 markings/sec, 195 secs
lola: sara is running 200 secs || 26343472 markings, 163713696 edges, 109716 markings/sec, 200 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 26808513 markings, 167723092 edges
lola: ========================================
lola: subprocess 15 will run for 2066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A12 <= A8) OR (1 <= A19) OR (A13 <= A4) OR (B5 <= A2) OR (3 <= B15))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((A12 <= A8) OR (1 <= A19) OR (A13 <= A4) OR (B5 <= A2) OR (3 <= B15))))
lola: processed formula length: 82
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((A8 + 1 <= A12) AND (A19 <= 0) AND (A4 + 1 <= A13) AND (A2 + 1 <= B5) AND (B15 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 928775 markings, 3219458 edges, 185755 markings/sec, 0 secs
lola: sara is running 5 secs || 1779464 markings, 6713489 edges, 170138 markings/sec, 5 secs
lola: sara is running 10 secs || 2623520 markings, 10226793 edges, 168811 markings/sec, 10 secs
lola: sara is running 15 secs || 3400254 markings, 13910622 edges, 155347 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3432666 markings, 14073846 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes yes yes no no no yes yes no no
lola:
preliminary result: no no yes no no no yes yes yes no no no yes yes no no
lola: memory consumption: 33668 KB
lola: time consumption: 1525 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552474611174
--------------------
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="DNAwalker-PT-08ringLL"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is DNAwalker-PT-08ringLL, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r049-oct2-155234405400665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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
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 ;