About the Execution of LoLA for HouseConstruction-PT-16000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.100 | 899726.00 | 923314.00 | 752.10 | FFTTTF?TTFTFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246549900728.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 HouseConstruction-PT-16000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246549900728
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.1K Feb 11 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 11 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 01:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 7 01:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 3 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 3 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 03:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 31 03:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-16000-ReachabilityCardinality-00
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-01
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-02
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-03
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-04
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-05
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-06
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-07
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-08
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-09
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-10
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-11
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-12
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-13
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-14
FORMULA_NAME HouseConstruction-PT-16000-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552678327511
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ HouseConstruction-PT-16000 @ 3570 seconds
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-16000-ReachabilityCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2670
rslt: Output for ReachabilityCardinality @ HouseConstruction-PT-16000
{
"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": "Fri Mar 15 19:32:07 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p16)))",
"processed_size": 18,
"rewrites": 7
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"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 ((2 <= p18)))",
"processed_size": 18,
"rewrites": 7
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p15)))",
"processed_size": 18,
"rewrites": 7
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((p16 <= p1)))",
"processed_size": 19,
"rewrites": 8
},
"result":
{
"edges": 16006,
"markings": 16007,
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p17) AND (3 <= p7))))",
"processed_size": 34,
"rewrites": 7
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((2 <= p16) OR (p19 <= p1))))",
"processed_size": 36,
"rewrites": 8
},
"result":
{
"edges": 16008,
"markings": 16009,
"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"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 (((p18 <= 1) OR (p9 <= 2) OR (p15 <= 1))))",
"processed_size": 49,
"rewrites": 8
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": false
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p27 <= p23) OR (p13 <= p21))))",
"processed_size": 39,
"rewrites": 8
},
"result":
{
"edges": 17,
"markings": 18,
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p2) OR (p5 <= p13) OR (p1 + 1 <= p15) OR (p9 <= 1))))",
"processed_size": 69,
"rewrites": 8
},
"result":
{
"edges": 112138,
"markings": 112092,
"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": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p10 <= 1) OR (p12 + 1 <= p9) OR (p18 + 1 <= p2) OR (p13 <= 2))))",
"processed_size": 75,
"rewrites": 8
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"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": "E (F (((3 <= p12) AND ((2 <= p17) OR (2 <= p2)) AND (2 <= p27) AND ((2 <= p9) OR (p4 <= p14)))))",
"processed_size": 98,
"rewrites": 7
},
"result":
{
"edges": 112732,
"markings": 112393,
"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": 16,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((p14 <= p21) AND (p12 <= p7) AND ((p19 <= p6) OR (p10 <= p18)) AND (1 <= p14))))",
"processed_size": 88,
"rewrites": 7
},
"result":
{
"edges": 128003,
"markings": 128004,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3126
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p18) AND (1 <= p27) AND ((p17 <= p1) OR (p26 <= p5)) AND ((2 <= p19) OR (p17 <= p9) OR ((p11 <= p21) AND (p2 <= p7))))))",
"processed_size": 136,
"rewrites": 7
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 26,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22320,
"runtime": 900.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : TRUE : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : TRUE : A(G(**))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 18,
"places": 26,
"places_significant": 18,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no yes yes yes no unknown yes yes no yes no yes yes yes no ",
"value": "no no yes yes yes no unknown yes yes no yes no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 44/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 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: place invariant simplifies atomic proposition
lola: before: (p20 <= p19)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always true: (p7 <= p4)
lola: A (G ((p16 <= p1))) : A (G (((p10 <= 1) OR (p12 + 1 <= p9) OR (p18 + 1 <= p2) OR (p13 <= 2)))) : E (F (((3 <= p12) AND ((2 <= p17) OR (2 <= p2)) AND (2 <= p27) AND ((2 <= p9) OR (p4 <= p14))))) : E (F ((3 <= p15))) : E (F (((3 <= p17) AND (3 <= p7)))) : A (G (((2 <= p16) OR (p19 <= p1)))) : A (G (((p15 <= p18) OR (1 <= p15) OR ((p1 <= p23) AND (2 <= p27)) OR (((1 <= p16) OR (2 <= p16)) AND ((3 <= p19) OR (p9 <= p26)))))) : A (G (())) : E (F ((3 <= p16))) : A (G (((p27 <= p23) OR (p13 <= p21)))) : E (F (((3 <= p18) AND (1 <= p27) AND ((p17 <= p1) OR (p26 <= p5)) AND ((2 <= p19) OR (p17 <= p9) OR ((p11 <= p21) AND (p2 <= p7)))))) : A (G (((1 <= p2) OR (p5 <= p13) OR (p1 + 1 <= p15) OR (p9 <= 1)))) : E (F ((2 <= p18))) : E (F (((p14 <= p21) AND (p12 <= p7) AND ((p19 <= p6) OR (p10 <= p18)) AND (1 <= p14)))) : A (G (())) : A (G (((p18 <= 1) OR (p9 <= 2) OR (p15 <= 1))))
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 222 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: 6 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 1 will run for 237 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: 6 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p16)))
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 <= p16)))
lola: processed formula length: 18
lola: 7 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 <= p16)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p18)))
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 <= p18)))
lola: processed formula length: 18
lola: 7 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 <= p18)
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-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: ...considering subproblem: E (F ((3 <= p15)))
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 <= p15)))
lola: processed formula length: 18
lola: 7 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 <= p15)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
sara: error: :135: error: syntax error, unexpected $end, 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: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p16 <= p1)))
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 ((p16 <= p1)))
lola: processed formula length: 19
lola: 8 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: (p1 + 1 <= p16)
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: :135: error: syntax error, unexpected $end, 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16007 markings, 16006 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p17) AND (3 <= p7))))
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 <= p17) AND (3 <= p7))))
lola: processed formula length: 34
lola: 7 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 <= p17) AND (3 <= p7))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p16) OR (p19 <= p1))))
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 (((2 <= p16) OR (p19 <= p1))))
lola: processed formula length: 36
lola: 8 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: ========================================
lola: state equation: calling and running sara
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: ((p16 <= 1) AND (p1 + 1 <= p19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: try reading problem file ReachabilityCardinality-6-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16009 markings, 16008 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p18 <= 1) OR (p9 <= 2) OR (p15 <= 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 (((p18 <= 1) OR (p9 <= 2) OR (p15 <= 1))))
lola: processed formula length: 49
lola: 8 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((2 <= p18) AND (3 <= p9) AND (2 <= p15))
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p27 <= p23) OR (p13 <= p21))))
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 (((p27 <= p23) OR (p13 <= p21))))
lola: processed formula length: 39
lola: 8 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: ((p23 + 1 <= p27) AND (p21 + 1 <= p13))
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 not invariant.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p2) OR (p5 <= p13) OR (p1 + 1 <= p15) OR (p9 <= 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 (((1 <= p2) OR (p5 <= p13) OR (p1 + 1 <= p15) OR (p9 <= 1))))
lola: processed formula length: 69
lola: 8 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: ((p2 <= 0) AND (p13 + 1 <= p5) AND (p15 <= p1) AND (2 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 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: :135: error: syntax error, unexpected $end, 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: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 112092 markings, 112138 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p10 <= 1) OR (p12 + 1 <= p9) OR (p18 + 1 <= p2) OR (p13 <= 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 (((p10 <= 1) OR (p12 + 1 <= p9) OR (p18 + 1 <= p2) OR (p13 <= 2))))
lola: processed formula length: 75
lola: 8 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: ((2 <= p10) AND (p9 <= p12) AND (p2 <= p18) AND (3 <= p13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p12) AND ((2 <= p17) OR (2 <= p2)) AND (2 <= p27) AND ((2 <= p9) OR (p4 <= p14)))))
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 <= p12) AND ((2 <= p17) OR (2 <= p2)) AND (2 <= p27) AND ((2 <= p9) OR (p4 <= p14)))))
lola: processed formula length: 98
lola: 7 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 <= p12) AND ((2 <= p17) OR (2 <= p2)) AND (2 <= p27) AND ((2 <= p9) OR (p4 <= p14)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 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-11-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 112393 markings, 112732 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p14 <= p21) AND (p12 <= p7) AND ((p19 <= p6) OR (p10 <= p18)) AND (1 <= p14))))
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 (((p14 <= p21) AND (p12 <= p7) AND ((p19 <= p6) OR (p10 <= p18)) AND (1 <= p14))))
lola: processed formula length: 88
lola: 7 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: ((p14 <= p21) AND (p12 <= p7) AND ((p19 <= p6) OR (p10 <= p18)) AND (1 <= p14))
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-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 128004 markings, 128003 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p15 <= p18) OR (1 <= p15) OR ((p1 <= p23) AND (2 <= p27)) OR (((1 <= p16) OR (2 <= p16)) AND ((3 <= p19) OR (p9 <= p26))))))
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 (((p15 <= p18) OR (1 <= p15) OR ((p1 <= p23) AND (2 <= p27)) OR (((1 <= p16) OR (2 <= p16)) AND ((3 <= p19) OR (p9 <= p26))))))
lola: processed formula length: 137
lola: 8 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: ((p18 + 1 <= p15) AND (p15 <= 0) AND ((p23 + 1 <= p1) OR (p27 <= 1)) AND (((p16 <= 0) AND (p16 <= 1)) OR ((p19 <= 2) AND (p26 + 1 <= p9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 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: :135: error: syntax error, unexpected $end, 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 || 5532811 markings, 5532968 edges, 1106562 markings/sec, 0 secs
lola: sara is running 5 secs || 10829480 markings, 10829805 edges, 1059334 markings/sec, 5 secs
lola: sara is running 10 secs || 15972123 markings, 15972608 edges, 1028529 markings/sec, 10 secs
lola: sara is running 15 secs || 21102757 markings, 21103404 edges, 1026127 markings/sec, 15 secs
lola: sara is running 20 secs || 26170491 markings, 26171297 edges, 1013547 markings/sec, 20 secs
lola: sara is running 25 secs || 31264377 markings, 31265344 edges, 1018777 markings/sec, 25 secs
lola: sara is running 30 secs || 36371129 markings, 36372257 edges, 1021350 markings/sec, 30 secs
lola: sara is running 35 secs || 41693086 markings, 41694381 edges, 1064391 markings/sec, 35 secs
lola: sara is running 40 secs || 47051780 markings, 47053245 edges, 1071739 markings/sec, 40 secs
lola: sara is running 45 secs || 52341265 markings, 52342899 edges, 1057897 markings/sec, 45 secs
lola: sara is running 50 secs || 57607076 markings, 57608876 edges, 1053162 markings/sec, 50 secs
lola: sara is running 55 secs || 62956169 markings, 62958139 edges, 1069819 markings/sec, 55 secs
lola: sara is running 60 secs || 68261007 markings, 68263145 edges, 1060968 markings/sec, 60 secs
lola: sara is running 65 secs || 73561506 markings, 73563817 edges, 1060100 markings/sec, 65 secs
lola: sara is running 70 secs || 78827960 markings, 78830439 edges, 1053291 markings/sec, 70 secs
lola: sara is running 75 secs || 84106476 markings, 84109123 edges, 1055703 markings/sec, 75 secs
lola: sara is running 80 secs || 89421106 markings, 89423922 edges, 1062926 markings/sec, 80 secs
lola: sara is running 85 secs || 94764646 markings, 94767635 edges, 1068708 markings/sec, 85 secs
lola: sara is running 90 secs || 100020437 markings, 100023595 edges, 1051158 markings/sec, 90 secs
lola: sara is running 95 secs || 105303849 markings, 105307175 edges, 1056682 markings/sec, 95 secs
lola: sara is running 100 secs || 110553113 markings, 110556608 edges, 1049853 markings/sec, 100 secs
lola: sara is running 105 secs || 115841713 markings, 115845377 edges, 1057720 markings/sec, 105 secs
lola: sara is running 110 secs || 121132332 markings, 121136168 edges, 1058124 markings/sec, 110 secs
lola: sara is running 115 secs || 126369573 markings, 126373579 edges, 1047448 markings/sec, 115 secs
lola: sara is running 120 secs || 131605861 markings, 131610036 edges, 1047258 markings/sec, 120 secs
lola: sara is running 125 secs || 136836610 markings, 136840958 edges, 1046150 markings/sec, 125 secs
lola: sara is running 130 secs || 142030221 markings, 142034737 edges, 1038722 markings/sec, 130 secs
lola: sara is running 135 secs || 147345147 markings, 147349837 edges, 1062985 markings/sec, 135 secs
lola: sara is running 140 secs || 152637732 markings, 152642593 edges, 1058517 markings/sec, 140 secs
lola: sara is running 145 secs || 157874757 markings, 157879791 edges, 1047405 markings/sec, 145 secs
lola: sara is running 150 secs || 163137747 markings, 163142951 edges, 1052598 markings/sec, 150 secs
lola: sara is running 155 secs || 168349211 markings, 168354588 edges, 1042293 markings/sec, 155 secs
lola: sara is running 160 secs || 173641278 markings, 173646829 edges, 1058413 markings/sec, 160 secs
lola: sara is running 165 secs || 178889822 markings, 178895544 edges, 1049709 markings/sec, 165 secs
lola: sara is running 170 secs || 184101427 markings, 184107321 edges, 1042321 markings/sec, 170 secs
lola: sara is running 175 secs || 189293857 markings, 189299922 edges, 1038486 markings/sec, 175 secs
lola: sara is running 180 secs || 194491008 markings, 194497245 edges, 1039430 markings/sec, 180 secs
lola: sara is running 185 secs || 199759571 markings, 199765984 edges, 1053713 markings/sec, 185 secs
lola: sara is running 190 secs || 204997087 markings, 205003675 edges, 1047503 markings/sec, 190 secs
lola: sara is running 195 secs || 210174213 markings, 210180971 edges, 1035425 markings/sec, 195 secs
lola: sara is running 200 secs || 215384936 markings, 215391867 edges, 1042145 markings/sec, 200 secs
lola: sara is running 205 secs || 220579089 markings, 220586195 edges, 1038831 markings/sec, 205 secs
lola: sara is running 210 secs || 225773375 markings, 225780656 edges, 1038857 markings/sec, 210 secs
lola: sara is running 215 secs || 230973247 markings, 230980698 edges, 1039974 markings/sec, 215 secs
lola: sara is running 220 secs || 236089688 markings, 236097312 edges, 1023288 markings/sec, 220 secs
lola: sara is running 225 secs || 241281866 markings, 241289665 edges, 1038436 markings/sec, 225 secs
lola: sara is running 230 secs || 246363985 markings, 246371954 edges, 1016424 markings/sec, 230 secs
lola: sara is running 235 secs || 251482919 markings, 251491061 edges, 1023787 markings/sec, 235 secs
lola: sara is running 240 secs || 256752833 markings, 256761152 edges, 1053983 markings/sec, 240 secs
lola: sara is running 245 secs || 261982124 markings, 261990618 edges, 1045858 markings/sec, 245 secs
lola: sara is running 250 secs || 267200394 markings, 267209068 edges, 1043654 markings/sec, 250 secs
lola: sara is running 255 secs || 272387223 markings, 272396072 edges, 1037366 markings/sec, 255 secs
lola: sara is running 260 secs || 277541793 markings, 277550817 edges, 1030914 markings/sec, 260 secs
lola: sara is running 265 secs || 282675817 markings, 282685016 edges, 1026805 markings/sec, 265 secs
lola: sara is running 270 secs || 287727429 markings, 287736798 edges, 1010322 markings/sec, 270 secs
lola: sara is running 275 secs || 292810123 markings, 292819667 edges, 1016539 markings/sec, 275 secs
lola: sara is running 280 secs || 297899464 markings, 297909181 edges, 1017868 markings/sec, 280 secs
lola: sara is running 285 secs || 303030771 markings, 303040665 edges, 1026261 markings/sec, 285 secs
lola: sara is running 290 secs || 308245220 markings, 308255293 edges, 1042890 markings/sec, 290 secs
lola: sara is running 295 secs || 313423609 markings, 313433860 edges, 1035678 markings/sec, 295 secs
lola: sara is running 300 secs || 318595928 markings, 318606359 edges, 1034464 markings/sec, 300 secs
lola: sara is running 305 secs || 323750338 markings, 323760944 edges, 1030882 markings/sec, 305 secs
lola: sara is running 310 secs || 328846518 markings, 328857301 edges, 1019236 markings/sec, 310 secs
lola: sara is running 315 secs || 333988110 markings, 333999073 edges, 1028318 markings/sec, 315 secs
lola: sara is running 320 secs || 339004669 markings, 339015802 edges, 1003312 markings/sec, 320 secs
lola: sara is running 325 secs || 343982963 markings, 343994270 edges, 995659 markings/sec, 325 secs
lola: sara is running 330 secs || 348955916 markings, 348967397 edges, 994591 markings/sec, 330 secs
lola: sara is running 335 secs || 353911574 markings, 353923225 edges, 991132 markings/sec, 335 secs
lola: sara is running 340 secs || 359102069 markings, 359113902 edges, 1038099 markings/sec, 340 secs
lola: sara is running 345 secs || 364336276 markings, 364348291 edges, 1046841 markings/sec, 345 secs
lola: sara is running 350 secs || 369468739 markings, 369480936 edges, 1026493 markings/sec, 350 secs
lola: sara is running 355 secs || 374641443 markings, 374653822 edges, 1034541 markings/sec, 355 secs
lola: sara is running 360 secs || 379701008 markings, 379713567 edges, 1011913 markings/sec, 360 secs
lola: sara is running 365 secs || 384840133 markings, 384852869 edges, 1027825 markings/sec, 365 secs
lola: sara is running 370 secs || 389876776 markings, 389889692 edges, 1007329 markings/sec, 370 secs
lola: sara is running 375 secs || 395010993 markings, 395024090 edges, 1026843 markings/sec, 375 secs
lola: sara is running 380 secs || 400088594 markings, 400101869 edges, 1015520 markings/sec, 380 secs
lola: sara is running 385 secs || 405110093 markings, 405123548 edges, 1004300 markings/sec, 385 secs
lola: sara is running 390 secs || 410371257 markings, 410384901 edges, 1052233 markings/sec, 390 secs
lola: sara is running 395 secs || 415593493 markings, 415607321 edges, 1044447 markings/sec, 395 secs
lola: sara is running 400 secs || 420754423 markings, 420768438 edges, 1032186 markings/sec, 400 secs
lola: sara is running 405 secs || 425951450 markings, 425965648 edges, 1039405 markings/sec, 405 secs
lola: sara is running 410 secs || 431100117 markings, 431114497 edges, 1029733 markings/sec, 410 secs
lola: sara is running 415 secs || 436020563 markings, 436035124 edges, 984089 markings/sec, 415 secs
lola: sara is running 420 secs || 440590659 markings, 440605382 edges, 914019 markings/sec, 420 secs
lola: sara is running 425 secs || 442558393 markings, 442573187 edges, 393547 markings/sec, 425 secs
lola: sara is running 430 secs || 443007435 markings, 443022248 edges, 89808 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3126 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p18) AND (1 <= p27) AND ((p17 <= p1) OR (p26 <= p5)) AND ((2 <= p19) OR (p17 <= p9) OR ((p11 <= p21) AND (p2 <= p7))))))
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 <= p18) AND (1 <= p27) AND ((p17 <= p1) OR (p26 <= p5)) AND ((2 <= p19) OR (p17 <= p9) OR ((p11 <= p21) AND (p2 <= p7))))))
lola: processed formula length: 136
lola: 7 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 <= p18) AND (1 <= p27) AND ((p17 <= p1) OR (p26 <= p5)) AND ((2 <= p19) OR (p17 <= p9) OR ((p11 <= p21) AND (p2 <= p7))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 26 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p15 <= p18) OR (1 <= p15) OR ((p1 <= p23) AND (2 <= p27)) OR (((1 <= p16) OR (2 <= p16)) AND ((3 <= p19) OR (p9 <= p26))))))
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 (((p15 <= p18) OR (1 <= p15) OR ((p1 <= p23) AND (2 <= p27)) OR (((1 <= p16) OR (2 <= p16)) AND ((3 <= p19) OR (p9 <= p26))))))
lola: processed formula length: 137
lola: 8 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: ((p18 + 1 <= p15) AND (p15 <= 0) AND ((p23 + 1 <= p1) OR (p27 <= 1)) AND (((p16 <= 0) AND (p16 <= 1)) OR ((p19 <= 2) AND (p26 + 1 <= p9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
sara: error: :135: error: syntax error, unexpected $end, 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 || 4988677 markings, 4988818 edges, 997735 markings/sec, 0 secs
lola: sara is running 5 secs || 9859896 markings, 9860191 edges, 974244 markings/sec, 5 secs
lola: sara is running 10 secs || 14627017 markings, 14627461 edges, 953424 markings/sec, 10 secs
lola: sara is running 15 secs || 19420831 markings, 19421427 edges, 958763 markings/sec, 15 secs
lola: sara is running 20 secs || 24671461 markings, 24672220 edges, 1050126 markings/sec, 20 secs
lola: sara is running 25 secs || 29521706 markings, 29522618 edges, 970049 markings/sec, 25 secs
lola: sara is running 30 secs || 34300042 markings, 34301107 edges, 955667 markings/sec, 30 secs
lola: sara is running 35 secs || 39031298 markings, 39032510 edges, 946251 markings/sec, 35 secs
lola: sara is running 40 secs || 43860041 markings, 43861407 edges, 965749 markings/sec, 40 secs
lola: sara is running 45 secs || 48591034 markings, 48592549 edges, 946199 markings/sec, 45 secs
lola: sara is running 50 secs || 53258157 markings, 53259818 edges, 933425 markings/sec, 50 secs
lola: sara is running 55 secs || 58254306 markings, 58256127 edges, 999230 markings/sec, 55 secs
lola: sara is running 60 secs || 63171509 markings, 63173487 edges, 983441 markings/sec, 60 secs
lola: sara is running 65 secs || 67854920 markings, 67857049 edges, 936682 markings/sec, 65 secs
lola: sara is running 70 secs || 72511408 markings, 72513684 edges, 931298 markings/sec, 70 secs
lola: sara is running 75 secs || 77522550 markings, 77524987 edges, 1002228 markings/sec, 75 secs
lola: sara is running 80 secs || 82795714 markings, 82798319 edges, 1054633 markings/sec, 80 secs
lola: sara is running 85 secs || 88124490 markings, 88127265 edges, 1065755 markings/sec, 85 secs
lola: sara is running 90 secs || 93515203 markings, 93518152 edges, 1078143 markings/sec, 90 secs
lola: sara is running 95 secs || 98854383 markings, 98857501 edges, 1067836 markings/sec, 95 secs
lola: sara is running 100 secs || 104191712 markings, 104195003 edges, 1067466 markings/sec, 100 secs
lola: sara is running 105 secs || 109507951 markings, 109511412 edges, 1063248 markings/sec, 105 secs
lola: sara is running 110 secs || 114808398 markings, 114812033 edges, 1060089 markings/sec, 110 secs
lola: sara is running 115 secs || 120145202 markings, 120149006 edges, 1067361 markings/sec, 115 secs
lola: sara is running 120 secs || 125466506 markings, 125470483 edges, 1064261 markings/sec, 120 secs
lola: sara is running 125 secs || 130754344 markings, 130758491 edges, 1057568 markings/sec, 125 secs
lola: sara is running 130 secs || 135999067 markings, 136003387 edges, 1048945 markings/sec, 130 secs
lola: sara is running 135 secs || 141212736 markings, 141217225 edges, 1042734 markings/sec, 135 secs
lola: sara is running 140 secs || 146583199 markings, 146587863 edges, 1074093 markings/sec, 140 secs
lola: sara is running 145 secs || 151922646 markings, 151927485 edges, 1067889 markings/sec, 145 secs
lola: sara is running 150 secs || 157274516 markings, 157279529 edges, 1070374 markings/sec, 150 secs
lola: sara is running 155 secs || 162568351 markings, 162573539 edges, 1058767 markings/sec, 155 secs
lola: sara is running 160 secs || 167833263 markings, 167838621 edges, 1052982 markings/sec, 160 secs
lola: sara is running 165 secs || 173142677 markings, 173148210 edges, 1061883 markings/sec, 165 secs
lola: sara is running 170 secs || 178434333 markings, 178440041 edges, 1058331 markings/sec, 170 secs
lola: sara is running 175 secs || 183695863 markings, 183701744 edges, 1052306 markings/sec, 175 secs
lola: sara is running 180 secs || 188964257 markings, 188970313 edges, 1053679 markings/sec, 180 secs
lola: sara is running 185 secs || 194198155 markings, 194204382 edges, 1046780 markings/sec, 185 secs
lola: sara is running 190 secs || 199475595 markings, 199481996 edges, 1055488 markings/sec, 190 secs
lola: sara is running 195 secs || 204722433 markings, 204729008 edges, 1049368 markings/sec, 195 secs
lola: sara is running 200 secs || 209944041 markings, 209950792 edges, 1044322 markings/sec, 200 secs
lola: sara is running 205 secs || 215188958 markings, 215195883 edges, 1048983 markings/sec, 205 secs
lola: sara is running 210 secs || 220394101 markings, 220401200 edges, 1041029 markings/sec, 210 secs
lola: sara is running 215 secs || 225648023 markings, 225655297 edges, 1050784 markings/sec, 215 secs
lola: sara is running 220 secs || 230874747 markings, 230882197 edges, 1045345 markings/sec, 220 secs
lola: sara is running 225 secs || 236052970 markings, 236060594 edges, 1035645 markings/sec, 225 secs
lola: sara is running 230 secs || 241272161 markings, 241279960 edges, 1043838 markings/sec, 230 secs
lola: sara is running 235 secs || 246457232 markings, 246465206 edges, 1037014 markings/sec, 235 secs
lola: sara is running 240 secs || 251672196 markings, 251680345 edges, 1042993 markings/sec, 240 secs
lola: sara is running 245 secs || 256984091 markings, 256992417 edges, 1062379 markings/sec, 245 secs
lola: sara is running 250 secs || 262254305 markings, 262262811 edges, 1054043 markings/sec, 250 secs
lola: sara is running 255 secs || 267539596 markings, 267548279 edges, 1057058 markings/sec, 255 secs
lola: sara is running 260 secs || 272769194 markings, 272778057 edges, 1045920 markings/sec, 260 secs
lola: sara is running 265 secs || 277960453 markings, 277969491 edges, 1038252 markings/sec, 265 secs
lola: sara is running 270 secs || 283171086 markings, 283180301 edges, 1042127 markings/sec, 270 secs
lola: sara is running 275 secs || 288375063 markings, 288384453 edges, 1040795 markings/sec, 275 secs
lola: sara is running 280 secs || 293594537 markings, 293604107 edges, 1043895 markings/sec, 280 secs
lola: sara is running 285 secs || 298784848 markings, 298794595 edges, 1038062 markings/sec, 285 secs
lola: sara is running 290 secs || 303724908 markings, 303734824 edges, 988012 markings/sec, 290 secs
lola: sara is running 295 secs || 308994705 markings, 309004802 edges, 1053959 markings/sec, 295 secs
lola: sara is running 300 secs || 314197003 markings, 314207280 edges, 1040460 markings/sec, 300 secs
lola: sara is running 305 secs || 319433194 markings, 319443653 edges, 1047238 markings/sec, 305 secs
lola: sara is running 310 secs || 324621410 markings, 324632046 edges, 1037643 markings/sec, 310 secs
lola: sara is running 315 secs || 329713568 markings, 329724379 edges, 1018432 markings/sec, 315 secs
lola: sara is running 320 secs || 334893929 markings, 334904920 edges, 1036072 markings/sec, 320 secs
lola: sara is running 325 secs || 340075929 markings, 340087103 edges, 1036400 markings/sec, 325 secs
lola: sara is running 330 secs || 345241579 markings, 345252929 edges, 1033130 markings/sec, 330 secs
lola: sara is running 335 secs || 350384560 markings, 350396090 edges, 1028596 markings/sec, 335 secs
lola: sara is running 340 secs || 355492436 markings, 355504143 edges, 1021575 markings/sec, 340 secs
lola: sara is running 345 secs || 360808946 markings, 360820840 edges, 1063302 markings/sec, 345 secs
lola: sara is running 350 secs || 365728609 markings, 365740672 edges, 983933 markings/sec, 350 secs
lola: sara is running 355 secs || 370416981 markings, 370429211 edges, 937674 markings/sec, 355 secs
lola: sara is running 360 secs || 375110068 markings, 375122461 edges, 938617 markings/sec, 360 secs
lola: sara is running 365 secs || 379843048 markings, 379855609 edges, 946596 markings/sec, 365 secs
lola: sara is running 370 secs || 385150409 markings, 385163158 edges, 1061472 markings/sec, 370 secs
lola: sara is running 375 secs || 390402213 markings, 390415145 edges, 1050361 markings/sec, 375 secs
lola: sara is running 380 secs || 395561240 markings, 395574359 edges, 1031805 markings/sec, 380 secs
lola: sara is running 385 secs || 400779861 markings, 400793162 edges, 1043724 markings/sec, 385 secs
lola: sara is running 390 secs || 405956375 markings, 405969860 edges, 1035303 markings/sec, 390 secs
lola: sara is running 395 secs || 411188660 markings, 411202332 edges, 1046457 markings/sec, 395 secs
lola: sara is running 400 secs || 416385331 markings, 416399188 edges, 1039334 markings/sec, 400 secs
lola: sara is running 405 secs || 421618622 markings, 421632665 edges, 1046658 markings/sec, 405 secs
lola: sara is running 410 secs || 426766145 markings, 426780372 edges, 1029505 markings/sec, 410 secs
lola: sara is running 415 secs || 431955160 markings, 431969574 edges, 1037803 markings/sec, 415 secs
lola: sara is running 420 secs || 437205299 markings, 437219902 edges, 1050028 markings/sec, 420 secs
lola: sara is running 425 secs || 442296164 markings, 442310949 edges, 1018173 markings/sec, 425 secs
lola: sara is running 430 secs || 442794915 markings, 442809716 edges, 99750 markings/sec, 430 secs
lola: sara is running 435 secs || 443106444 markings, 443121257 edges, 62306 markings/sec, 435 secs
lola: sara is running 440 secs || 443110403 markings, 443125217 edges, 792 markings/sec, 440 secs
lola: sara is running 445 secs || 443300795 markings, 443315616 edges, 38078 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes yes yes no unknown yes yes no yes no yes yes yes no
lola:
preliminary result: no no yes yes yes no unknown yes yes no yes no yes yes yes no
lola: memory consumption: 22320 KB
lola: time consumption: 900 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552679227237
--------------------
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="HouseConstruction-PT-16000"
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 HouseConstruction-PT-16000, 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 r082-csrt-155246549900728"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-16000.tgz
mv HouseConstruction-PT-16000 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 ;