About the Execution of LoLA for Diffusion2D-PT-D50N150
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4868.950 | 512031.00 | 709756.00 | 105.10 | TFTFTFTTTTTTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234654900260.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Diffusion2D-PT-D50N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654900260
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 3.8K Feb 10 21:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 21:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 6 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 6 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 23:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Jan 30 23:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 30 23:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-00
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-01
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-02
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-03
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-04
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-05
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-06
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-07
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-08
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-09
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D50N150-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552602159642
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D50N150 @ 3570 seconds
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3058
rslt: Output for ReachabilityCardinality @ Diffusion2D-PT-D50N150
{
"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": "Thu Mar 14 22:22:39 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 202
},
"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 <= cAMP__49_28_)))",
"processed_size": 27,
"rewrites": 1
},
"result":
{
"edges": 15856,
"markings": 4393,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 215
},
"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 <= cAMP__15_35_)))",
"processed_size": 27,
"rewrites": 1
},
"result":
{
"edges": 4716,
"markings": 1372,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 231
},
"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 <= cAMP__32_16_)))",
"processed_size": 27,
"rewrites": 1
},
"result":
{
"edges": 3571,
"markings": 1064,
"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": 248
},
"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 ((1 <= cAMP__41_37_)))",
"processed_size": 27,
"rewrites": 1
},
"result":
{
"edges": 15,
"markings": 16,
"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": 269
},
"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 ((cAMP__24_5_ <= cAMP__15_16_)))",
"processed_size": 37,
"rewrites": 2
},
"result":
{
"edges": 224,
"markings": 77,
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"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 ((cAMP__44_33_ <= cAMP__47_9_)))",
"processed_size": 37,
"rewrites": 2
},
"result":
{
"edges": 18,
"markings": 19,
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"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 (((1 <= cAMP__21_14_) OR (1 <= cAMP__44_13_))))",
"processed_size": 53,
"rewrites": 1
},
"result":
{
"edges": 12,
"markings": 13,
"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": 359
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((cAMP__18_27_ + 1 <= cAMP__43_11_)))",
"processed_size": 42,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 396
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= cAMP__39_49_) AND ((cAMP__1_25_ <= 0) OR (cAMP__17_39_ <= 2)))))",
"processed_size": 78,
"rewrites": 1
},
"result":
{
"edges": 23,
"markings": 24,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 453
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((3 <= cAMP__33_34_) AND (cAMP__46_42_ + 1 <= cAMP__42_3_))))",
"processed_size": 67,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"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": 519
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((3 <= cAMP__26_46_) AND (cAMP__38_16_ + 1 <= cAMP__47_8_))))",
"processed_size": 67,
"rewrites": 1
},
"result":
{
"edges": 52688,
"markings": 15560,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((cAMP__42_33_ <= cAMP__8_3_) AND (cAMP__7_34_ <= cAMP__37_7_))))",
"processed_size": 71,
"rewrites": 2
},
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 772
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((2 <= cAMP__37_1_) AND ((3 <= cAMP__45_4_) OR (cAMP__1_4_ <= cAMP__50_28_)) AND (cAMP__12_1_ <= cAMP__6_12_))))",
"processed_size": 119,
"rewrites": 1
},
"result":
{
"edges": 12017,
"markings": 3352,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1028
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((2 <= cAMP__36_35_) OR ((cAMP__42_21_ <= cAMP__18_33_) AND (cAMP__28_13_ <= cAMP__46_48_) AND (cAMP__33_7_ <= cAMP__6_12_) AND (1 <= cAMP__37_17_)))))",
"processed_size": 158,
"rewrites": 1
},
"result":
{
"edges": 4755,
"markings": 1385,
"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": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1541
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((cAMP__48_45_ + 1 <= cAMP__3_26_) AND (cAMP__18_23_ <= 1) AND ((2 <= cAMP__30_2_) OR (cAMP__45_4_ <= cAMP__13_21_) OR (cAMP__34_25_ <= cAMP__21_21_) OR (cAMP__31_8_ <= cAMP__13_6_)))))",
"processed_size": 194,
"rewrites": 1
},
"result":
{
"edges": 23,
"markings": 24,
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3082
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F ((((cAMP__39_2_ <= cAMP__9_46_) OR (cAMP__50_5_ <= cAMP__4_35_)) AND (3 <= cAMP__37_35_) AND (((cAMP__44_19_ <= cAMP__37_1_) AND (cAMP__14_24_ <= cAMP__44_8_)) OR (cAMP__40_41_ <= cAMP__19_45_)))))",
"processed_size": 204,
"rewrites": 1
},
"result":
{
"edges": 48879,
"markings": 13517,
"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": 14,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 618936,
"runtime": 512.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 38808,
"conflict_clusters": 2500,
"places": 2500,
"places_significant": 2499,
"singleton_clusters": 0,
"transitions": 19404
},
"result":
{
"preliminary_value": "yes no yes no yes no yes yes yes yes yes yes yes yes yes yes ",
"value": "yes no yes no yes no yes yes yes yes yes yes yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 21904/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 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: E (F (((1 <= cAMP__21_14_) OR (1 <= cAMP__44_13_)))) : A (G ((cAMP__24_5_ <= cAMP__15_16_))) : E (F (((1 <= cAMP__39_49_) AND ((cAMP__1_25_ <= 0) OR (cAMP__17_39_ <= 2))))) : A (G ((cAMP__44_33_ <= cAMP__47_9_))) : E (F ((2 <= cAMP__49_28_))) : A (G (((cAMP__42_33_ <= cAMP__8_3_) AND (cAMP__7_34_ <= cAMP__37_7_)))) : E (F (((2 <= cAMP__36_35_) OR ((cAMP__42_21_ <= cAMP__18_33_) AND (cAMP__28_13_ <= cAMP__46_48_) AND (cAMP__33_7_ <= cAMP__6_12_) AND (1 <= cAMP__37_17_))))) : E (F ((((cAMP__39_2_ <= cAMP__9_46_) OR (cAMP__50_5_ <= cAMP__4_35_)) AND (3 <= cAMP__37_35_) AND (((cAMP__44_19_ <= cAMP__37_1_) AND (cAMP__14_24_ <= cAMP__44_8_)) OR (cAMP__40_41_ <= cAMP__19_45_))))) : E (F ((2 <= cAMP__15_35_))) : E (F ((2 <= cAMP__32_16_))) : E (F (((3 <= cAMP__33_34_) AND (cAMP__46_42_ + 1 <= cAMP__42_3_)))) : E (F ((1 <= cAMP__41_37_))) : E (F ((cAMP__18_27_ + 1 <= cAMP__43_11_))) : E (F (((cAMP__48_45_ + 1 <= cAMP__3_26_) AND (cAMP__18_23_ <= 1) AND ((2 <= cAMP__30_2_) OR (cAMP__45_4_ <= cAMP__13_21_) OR (cAMP__34_25_ <= cAMP__21_21_) OR (cAMP__31_8_ <= cAMP__13_6_))))) : E (F (((3 <= cAMP__26_46_) AND (cAMP__38_16_ + 1 <= cAMP__47_8_)))) : E (F (((2 <= cAMP__37_1_) AND ((3 <= cAMP__45_4_) OR (cAMP__1_4_ <= cAMP__50_28_)) AND (cAMP__12_1_ <= cAMP__6_12_))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__49_28_)))
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 <= cAMP__49_28_)))
lola: processed formula length: 27
lola: 1 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 <= cAMP__49_28_)
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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 2785 markings, 10300 edges, 557 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4393 markings, 15856 edges
lola: ========================================
lola: subprocess 1 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__15_35_)))
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 <= cAMP__15_35_)))
lola: processed formula length: 27
lola: 1 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 <= cAMP__15_35_)
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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1372 markings, 4716 edges
lola: ========================================
lola: subprocess 2 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__32_16_)))
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 <= cAMP__32_16_)))
lola: processed formula length: 27
lola: 1 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 <= cAMP__32_16_)
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1064 markings, 3571 edges
lola: ========================================
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cAMP__41_37_)))
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 ((1 <= cAMP__41_37_)))
lola: processed formula length: 27
lola: 1 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: (1 <= cAMP__41_37_)
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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__24_5_ <= cAMP__15_16_)))
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 ((cAMP__24_5_ <= cAMP__15_16_)))
lola: processed formula length: 37
lola: 2 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: (cAMP__15_16_ + 1 <= cAMP__24_5_)
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 not invariant.
lola: 77 markings, 224 edges
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__44_33_ <= cAMP__47_9_)))
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 ((cAMP__44_33_ <= cAMP__47_9_)))
lola: processed formula length: 37
lola: 2 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: (cAMP__47_9_ + 1 <= cAMP__44_33_)
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 not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__21_14_) OR (1 <= cAMP__44_13_))))
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 (((1 <= cAMP__21_14_) OR (1 <= cAMP__44_13_))))
lola: processed formula length: 53
lola: 1 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: ((1 <= cAMP__21_14_) OR (1 <= cAMP__44_13_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__18_27_ + 1 <= cAMP__43_11_)))
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 ((cAMP__18_27_ + 1 <= cAMP__43_11_)))
lola: processed formula length: 42
lola: 1 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: (cAMP__18_27_ + 1 <= cAMP__43_11_)
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 2920 markings, 9968 edges, 584 markings/sec, 0 secs
lola: sara is running 5 secs || 5844 markings, 19978 edges, 585 markings/sec, 5 secs
lola: sara is running 10 secs || 8765 markings, 29983 edges, 584 markings/sec, 10 secs
lola: sara is running 15 secs || 11684 markings, 39983 edges, 584 markings/sec, 15 secs
lola: sara is running 20 secs || 14603 markings, 49983 edges, 584 markings/sec, 20 secs
lola: sara is running 25 secs || 17527 markings, 60004 edges, 585 markings/sec, 25 secs
lola: sara is running 30 secs || 20450 markings, 69880 edges, 585 markings/sec, 30 secs
lola: sara is running 35 secs || 23367 markings, 80423 edges, 583 markings/sec, 35 secs
lola: sara is running 40 secs || 26314 markings, 89970 edges, 589 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 29256 markings, 99971 edges, 588 markings/sec, 45 secs
lola: sara is running 50 secs || 32224 markings, 108730 edges, 594 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__39_49_) AND ((cAMP__1_25_ <= 0) OR (cAMP__17_39_ <= 2)))))
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 (((1 <= cAMP__39_49_) AND ((cAMP__1_25_ <= 0) OR (cAMP__17_39_ <= 2)))))
lola: processed formula length: 78
lola: 1 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: ((1 <= cAMP__39_49_) AND ((cAMP__1_25_ <= 0) OR (cAMP__17_39_ <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__33_34_) AND (cAMP__46_42_ + 1 <= cAMP__42_3_))))
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 <= cAMP__33_34_) AND (cAMP__46_42_ + 1 <= cAMP__42_3_))))
lola: processed formula length: 67
lola: 1 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 <= cAMP__33_34_) AND (cAMP__46_42_ + 1 <= cAMP__42_3_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 2881 markings, 10179 edges, 576 markings/sec, 0 secs
lola: sara is running 5 secs || 5777 markings, 20394 edges, 579 markings/sec, 5 secs
lola: sara is running 10 secs || 8690 markings, 29349 edges, 583 markings/sec, 10 secs
lola: sara is running 15 secs || 11574 markings, 39193 edges, 577 markings/sec, 15 secs
lola: sara is running 20 secs || 14465 markings, 48987 edges, 578 markings/sec, 20 secs
lola: sara is running 25 secs || 17344 markings, 59066 edges, 576 markings/sec, 25 secs
lola: sara is running 30 secs || 20234 markings, 69264 edges, 578 markings/sec, 30 secs
lola: sara is running 35 secs || 23112 markings, 79275 edges, 576 markings/sec, 35 secs
lola: sara is running 40 secs || 26022 markings, 88742 edges, 582 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 28900 markings, 98775 edges, 576 markings/sec, 45 secs
lola: sara is running 50 secs || 31806 markings, 108565 edges, 581 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__26_46_) AND (cAMP__38_16_ + 1 <= cAMP__47_8_))))
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 <= cAMP__26_46_) AND (cAMP__38_16_ + 1 <= cAMP__47_8_))))
lola: processed formula length: 67
lola: 1 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 <= cAMP__26_46_) AND (cAMP__38_16_ + 1 <= cAMP__47_8_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 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.
lola: sara is running 0 secs || 2723 markings, 9921 edges, 545 markings/sec, 0 secs
lola: sara is running 5 secs || 5512 markings, 19525 edges, 558 markings/sec, 5 secs
lola: sara is running 10 secs || 8333 markings, 29022 edges, 564 markings/sec, 10 secs
lola: sara is running 15 secs || 11114 markings, 38516 edges, 556 markings/sec, 15 secs
lola: sara is running 20 secs || 13876 markings, 47437 edges, 552 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15560 markings, 52688 edges
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__42_33_ <= cAMP__8_3_) AND (cAMP__7_34_ <= cAMP__37_7_))))
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 (((cAMP__42_33_ <= cAMP__8_3_) AND (cAMP__7_34_ <= cAMP__37_7_))))
lola: processed formula length: 71
lola: 2 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: ((cAMP__8_3_ + 1 <= cAMP__42_33_) OR (cAMP__37_7_ + 1 <= cAMP__7_34_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 12 will run for 772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__37_1_) AND ((3 <= cAMP__45_4_) OR (cAMP__1_4_ <= cAMP__50_28_)) AND (cAMP__12_1_ <= cAMP__6_12_))))
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 <= cAMP__37_1_) AND ((3 <= cAMP__45_4_) OR (cAMP__1_4_ <= cAMP__50_28_)) AND (cAMP__12_1_ <= cAMP__6_12_))))
lola: processed formula length: 119
lola: 1 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 <= cAMP__37_1_) AND ((3 <= cAMP__45_4_) OR (cAMP__1_4_ <= cAMP__50_28_)) AND (cAMP__12_1_ <= cAMP__6_12_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 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.
lola: sara is running 0 secs || 2958 markings, 10770 edges, 592 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3352 markings, 12017 edges
lola: ========================================
lola: subprocess 13 will run for 1028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__36_35_) OR ((cAMP__42_21_ <= cAMP__18_33_) AND (cAMP__28_13_ <= cAMP__46_48_) AND (cAMP__33_7_ <= cAMP__6_12_) AND (1 <= cAMP__37_17_)))))
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 <= cAMP__36_35_) OR ((cAMP__42_21_ <= cAMP__18_33_) AND (cAMP__28_13_ <= cAMP__46_48_) AND (cAMP__33_7_ <= cAMP__6_12_) AND (1 <= cAMP__37_17_)))))
lola: processed formula length: 158
lola: 1 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 <= cAMP__36_35_) OR ((cAMP__42_21_ <= cAMP__18_33_) AND (cAMP__28_13_ <= cAMP__46_48_) AND (cAMP__33_7_ <= cAMP__6_12_) AND (1 <= cAMP__37_17_)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1385 markings, 4755 edges
lola: ========================================
lola: subprocess 14 will run for 1541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__48_45_ + 1 <= cAMP__3_26_) AND (cAMP__18_23_ <= 1) AND ((2 <= cAMP__30_2_) OR (cAMP__45_4_ <= cAMP__13_21_) OR (cAMP__34_25_ <= cAMP__21_21_) OR (cAMP__31_8_ <= cAMP__13_6_)))))
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 (((cAMP__48_45_ + 1 <= cAMP__3_26_) AND (cAMP__18_23_ <= 1) AND ((2 <= cAMP__30_2_) OR (cAMP__45_4_ <= cAMP__13_21_) OR (cAMP__34_25_ <= cAMP__21_21_) OR (cAMP__31_8_ <= cAMP__13_6_)))))
lola: processed formula length: 194
lola: 1 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: ((cAMP__48_45_ + 1 <= cAMP__3_26_) AND (cAMP__18_23_ <= 1) AND ((2 <= cAMP__30_2_) OR (cAMP__45_4_ <= cAMP__13_21_) OR (cAMP__34_25_ <= cAMP__21_21_) OR (cAMP__31_8_ <= cAMP__13_6_)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 15 will run for 3082 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__39_2_ <= cAMP__9_46_) OR (cAMP__50_5_ <= cAMP__4_35_)) AND (3 <= cAMP__37_35_) AND (((cAMP__44_19_ <= cAMP__37_1_) AND (cAMP__14_24_ <= cAMP__44_8_)) OR (cAMP__40_41_ <= cAMP__19_45_)))))
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 ((((cAMP__39_2_ <= cAMP__9_46_) OR (cAMP__50_5_ <= cAMP__4_35_)) AND (3 <= cAMP__37_35_) AND (((cAMP__44_19_ <= cAMP__37_1_) AND (cAMP__14_24_ <= cAMP__44_8_)) OR (cAMP__40_41_ <= cAMP__19_45_)))))
lola: processed formula length: 204
lola: 1 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: (((cAMP__39_2_ <= cAMP__9_46_) OR (cAMP__50_5_ <= cAMP__4_35_)) AND (3 <= cAMP__37_35_) AND (((cAMP__44_19_ <= cAMP__37_1_) AND (cAMP__14_24_ <= cAMP__44_8_)) OR (cAMP__40_41_ <= cAMP__19_45_)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 4 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.
lola: sara is running 0 secs || 2885 markings, 9983 edges, 577 markings/sec, 0 secs
lola: sara is running 5 secs || 5769 markings, 20724 edges, 577 markings/sec, 5 secs
lola: sara is running 10 secs || 8581 markings, 31770 edges, 562 markings/sec, 10 secs
lola: sara is running 15 secs || 11450 markings, 41848 edges, 574 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13517 markings, 48879 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no yes yes yes yes yes yes yes yes yes yes
lola:
preliminary result: yes no yes no yes no yes yes yes yes yes yes yes yes yes yes
lola: memory consumption: 618936 KB
lola: time consumption: 512 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552602671673
--------------------
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="Diffusion2D-PT-D50N150"
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 Diffusion2D-PT-D50N150, 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 r060-ebro-155234654900260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N150.tgz
mv Diffusion2D-PT-D50N150 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 ;